DEPARTMENT OF COMPUTER SCIENCE &

ENGINEERING

CSE249 DATABASE MANAGEMENT SYSTEMS

QUESTION BANK

1
Q. No. Questions

Define database management system and its applications.

Database management system (DBMS) is a collection of interrelated data and aset of programs to
access those data.
Applications:
▪ Banking
▪ Airlines
1. ▪ Universities
▪ Credit card transactions
▪ Tele communication
▪ Finance
▪ Sales
▪ Manufacturing
▪ Human resources

What are the advantages of using a DBMS? What is the purpose of database management system ?
a. The advantages of using a DBMS are
a) Controlling redundancy
b) Restricting unauthorized access
2.
c) Providing multiple user interfaces
d) Enforcing integrity constraints.
e) Providing backup and recovery

Compare database systems with file systems.

What are the disadvantages of file processing system?

a. Data redundancy and inconsistency

3.
b. Difficulty in accessing data
c. Atomicity of updates
d. Concurrent access by multiple users
e. Security problems

2
 List the features of a database.
• It is a persistent (stored) collection of related data.
4. • The data is input (stored) only once.
• The data is organized (in some fashion).
• The data is accessible and can be queried (effectively and efficiently).

Define a database
5. Specifying the data types, structures, and constraints of the datato be stored using
a Data Definition Language
Define a data model.
A data model is a collection of concepts that can be used to describe the
6.
structure of a database. The model provides the necessary means to achievethe abstraction.

What are the categories of data models.

High level/conceptual data models –provide concepts close to the wayusers perceive the data.
Physical data models –provide concepts that describe the details of how data is stored in the
computer. These concepts are generally meant for the specialist, and not the end user.
7. Representational data models –provide concepts that may be understood by the end user
but not far removed from the way data is
organized.

Define high level/conceptual data model.

Entity –represents a real world object or concept
Attribute - represents property of interest that describes an entity, such asname or salary.
8. Relationships –among two or more entities, represents an association
among two or more entities.

Define representational data models.

Representational data models are used most frequently in commercial DBMSs. They include relational
9. data models, and legacy models such as network and
hierarchical models.
Define physical data model.
10. Physical data models describe how data is stored in files by representing record formats, record
orderings and access paths.
What is object data model.
Object data models –a group of higher level implementation data models closer to conceptual data
11. models

What is internal level schema.

12. Object data models –a group of higher level implementation data models closer to conceptual data
models
What is the conceptual level schema.
13. The conceptual level –has a conceptual schema which describes the structure of the database for users.
It hides the details of the physical storage structures, and

3
 concentrates on describing entities, data types, relationships, user operations and constraints. Usually a
representational data model is used to describe the
conceptual schema.
What is an external or view level schema.
The External or View level –includes external schemas or user vies. Each external schema describes the
part of the database that a particular user group is interested in and hides the rest of the database from that
14. user group. Represented using the representational data model.

List the components of DBMS.

The major components of database management system are:
• Software
• Hardware
15. • Data
• Procedures
• Database Access Language
• Users
What is relational model.
The relational model represents the database as a collection of relations. A relation is nothing but a table
16. of values. Every row in the table represents a collection of related data values. These rows in the table
denote a real-world
entity or relationship.
List some of the relational model concepts.
1. Attribute: Each column in a Table. Attributes are the properties which define a relation. e.g.,
Student_Rollno, NAME,etc.
2. Tables – In the Relational model the, relations are saved in the table format. It is stored along with its
entities. A table has two properties rows and columns. Rows represent records and columns
represent attributes.
3. Tuple – It is nothing but a single row of a table, which contains a single record.
4. Relation Schema: A relation schema represents the name of the relation with its attributes.
5. Degree: The total number of attributes which in the relation is called the degree of the relation.
6. Cardinality: Total number of rows present in the Table.
17.
7. Column: The column represents the set of values for a specific attribute.
8. Relation instance – Relation instance is a finite set of tuples in the RDBMS system. Relation
instances never have duplicate tuples.
9. Relation key - Every row has one, two or multiple attributes, which is called relation key.
10. Attribute domain – Every attribute has some pre-defined value and scope which is known as
attribute domain

List some relational integrity constraints.

1. Domain Constraints
18.
2. Key constraints
3. Referential integrity constraints
Define domain constraints.
19. Domain constraints can be violated if an attribute value is not appearing in the corresponding domain
or it is not of the appropriate data type.
4
 Domain constraints specify that within each tuple, and the must be unique. value of each attribute de
This is specified as data types which inclu integers, real numbers, standard data types strings,
characters, Booleans, variable length Example: etc.
Create DOMAIN CustomerNameCHECK (value
not NULL)
The example shown demonstrates creating a domain CustomerName is
not NULL constraint such that

Define key constraints.

An attribute that can uniquely identify a tuple in a relation is called the key of the table. The value of the
attribute for different tuples in the relation has to be unique. Example:
In the given table, CustomerID is a key attribute of Customer Table. It is most
likely to have a single key for one customer, CustomerID =1 is only for the CustomerName =" Google".

20.
CustomerID CustomerName

1 Google

2 Amazon

3 Apple
Define referential integrity constraints.
Referential integrity constraints is base on the concept of Foreign Keys. A foreign key is an important
attribute of a relation which should be referred to in other relationships. Referential integrity constraint state
happens where relation refers to a key attribute of a different or same relation. However, that key element
must exist in the table.

Example:

21.

In the above example, we have 2 relations, Customer and Billing.

Tuple for CustomerID =1 is referenced twice in the relation Billing. So we know

CustomerName=Google has billing amount $300

List the operations which can be done on the relational model.

22. The operations are, Insert, update, delete and select.

5
 • Insert is used to insert data into the relation
• Delete is used to delete tuples from the table.
• Modify allows you to change the values of some attributes in existing tuples.
• Select allows you to choose a specific range of data.

What are the advantages of relational model.

• Simplicity: A relational data model is simpler than the hierarchical and network model.

• Structural Independence: The relational database is only concerned with data and not with a
structure. This can improve the performance of the model.

• Easy to use: The relational model is easy as tables consisting of rows and columns is quite
natural and simple to understand
23. • Query capability: It makes possible for a high-level query language like SQL to avoid complex
database navigation.

• Data independence: The structure of a database can be changed without having to change any
application.

• Scalable: Regarding a number of records, or rows, and the number of fields, a database should be
enlarged to enhance its usability.

What are the disadvantages of relational model.

• Few relational databases have limits on field lengths which can't be exceeded.
• Relational databases can sometimes become complex as the amount of data grows, and the relations
24. between pieces of data become more complicated.
• Complex relational database systems may lead to isolated databases where the information cannot be
shared from one system to another.

Define relational algebra.

25. • Intermediate language used within DBMS.
• Procedural langauge
List the relational algebraic operations.
• Basic operators: select, project, union, set difference, Cartesian product
26. • Derived operators: set intersection, division, join

Define select operation in relational algebra.

Produce table containing subset of rows of argument tablesatisfying
condition
27.

6
 Define project operator in relational algebra.
Produces table containing subset of columns of argument table
• Example:

28.

Define Cartesian product in relational algebra.

•If R and S are two relations, R S is the set of all concatenated tuples <x,y>,
where x is a tuple in R and y is a tuple inS

– (R and S need not be union compatible)

• R S is expensive to compute:

29. – Factor of two in the size of each row

– Quadratic in the number of rowExample:

7
 What is a table in relational database.
A table is set of data elements that has a horizontal dimension (rows) and a vertical
dimension (columns) in a relational database system. A table has a specified number
30. of columns but can have any number of rows. Rows stored in a table are structurally
equivalent to records from flat files. Columns are
often referred as attributes or fields.

Define an identifier.
An identifier is an attribute that is used either as a primary key or as a foreign key.
31. The integer datatype is used for identifiers. In cases where the number of records
exceed the allowed values by the integer datatype then a big integer datatype is used.

Define a primary key.

A column in a table whose values uniquely identify the rows in the table. A primary
32.
key value cannot be NULLto matching columns in other tables\

What is a Foreign key?

33. A column in a table that does not uniquely identify rows in thattable, but is used
as a link to matching columns in other tables.
What is Relationship?
A relationship is an association between two tables. For example the relationship
34. between the table "hotel" and "customer" maps the customers to the hotels they have
used.

What is an index in relational database?

An index is a data structure which enables a query to run at a sublinear-time. Instead
35. of having to go through all records one by one to identify those which match its
criteria the query uses the index to filter out those which don't and focus on those
who do.
Define view.
A view is a virtual or logical table composed of the result set of a pre-compiled query.
Unlike ordinary tables in a relational database, a view is not part of the physical
36. schema: it is a dynamic, virtual table computed or collated from data in the database.
Changing the data in a view alters the data stored in the
database

What is a Query
37. A query is a request to retrieve data from a database with the SQL SELECT
instruction or to manipulate data stored in tables.
8
 Define SQL
Structured Query Language (SQL), pronounced "sequel", is a language that
provides an interface to relational database systems. It was developed by IBM in the
38. 1970s for use in System
R. SQL is a de facto standard, as well as an ISO and ANSI standard.

List any 5 responsibilities of the DB Manager May June 2007

a) Interaction with he file manager
b) Translation of DML commands in to low level file system commands
39. c) Storing, retrieving and updating data in the database
d) Data dictionary
e) Indices
What is Data Dictionary May2003, 2004, Nov 2006& Nov 2007.
Data dictionary : which stores meta data about the structure of thedatabase, in particular
40.
schema of the database.

What is Data independence & what are the levels. APRIL MAY 2008, MAY
/JUNE 2012, Nov 2017
The ability to modify a schema definition in one level without affecting aschema definition in the
next higher level called data independence.
41.
Different levels .

Physical levelLogical level

View level

Define instance and schemas. April/May 2012

- Database change over times as information is inserted and deleted.
42. - The collection of information stored in the database at a particular moment called an instance of
the database.
- The overall design of the database is called the database schema.
What are the types of attributes. April/May 2007
o Simple
o Composite
43.
o Single-valued
o Multi-valued
o Derived
What is mapping cardinalities April/May 2009
Mapping cardinalities express the number of entities to which another entity can be
44.
associated via a relationship set.

What are the various data base languages in SQL? April/May 2018
45. Data Definition Language (DDL)
Commands that define a database, including creating, altering, and dropping

9
 tables and establishing constraints
Data Manipulation Language (DML)
Commands that maintain and query a database
Data Control Language (DCL)
Commands that control a database, including administering privileges and committing data

List the data types in SQL.

46.

What are the function of DBA? April/May 2009

- Schema definition.
- Storage structure and access –method definition.
47.
- Schema and physical-organization modification
- Granting of authorization for data access:
- Routine maintenance
What is Relational Model . April/May 2009
48.
- The relation is the only construct required to represent the associations

10
 among the attributes of an entity as well as the relationship among different entities.
- A relation may be visualized as a named table. Each column of the table
corresponds to an attribute of the relation and is named.

Define Data Model. April/May 2009

It is a collection of conceptual tools for describing data, data relationships, data semantics and
49.
consistency constraints

What the problems caused by the redundancy?

The problems caused by data redundancy are
• The first is that storing values multiple times will lead to waste spaces.
• The second problem is that when a field value changes, multiple occurrences need to be
50. updated. For example, if customer-1 moves, it needs to change the values of Street, City,
State and Zip in multiple records.
• The third problem occurs when forget to change the values in any of therecords. The database
would then have inconsistent data.

What is data definition language?

Data Definition Language:
51. A data definition language or data description language (DDL) is a syntax
for defining the data structures using imperative verbs, especially database schemas.

What is the syntax for creating a table in SQL? Syntax:

CREATE TABLE [table name] ( [column definitions] ) [table parameters]
Example:
The command to create a table named employees with a few sample columns would be:
CREATE TABLE employees ( id INTEGER
PRIMARY KEY,
first_name VARCHAR(50) NULL, last_name VARCHAR(75)
52. NOT NULL, fname VARCHAR(50) NOT NULL,
dateofbirth DATE NULL
);

What is the syntax for removing or deleting a table in SQL?

Drop - To destroy an existing database, table, index, or view. Syntax:
DROP objecttype objectname.
53. Example:
The command to drop a table named employees would be:
DROP employees;
The Drop statement would remove the entire table (employees) from the database.
How to modify or alter an existing table in SQL.
Alter - To modify an existing database object.
54. An ALTER statement in SQL changes the properties of an object inside of a relational database
management system (RDBMS).
Syntax:
11
 ALTER objecttype objectname parameters.
Example:
The command to add (then remove) a column named bubbles for an existing table named sink would be:
ALTER TABLE sink ADD bubbles INTEGER; ALTER TABLE sink
DROP COLUMN bubbles;

How to rename an existing table in SQL?

Syntax:
55. Rename - to rename the table.
Example
RENAME TABLE old_name TO new_name;
Define Data Manipulation Language.
A data manipulation language (DML) is a set of commands permitting users to manipulate data in a
56. database. This manipulation involves inserting data into database tables, retrieving existing data, deleting
data from existing tables and modifying existing data.

List the DML commands in SQL.

SELECT: This command is used to retrieve rows from a table.
The select syntax:
SELECT [column name(s)] from [table name] where [conditions].
UPDATE: This command modifies data of one or more records.
The update command syntax:
UPDATE table name SET column name = value where [condition].
57. INSERT: This command adds one or more records to a database table.
The insert command syntax:
INSERT INTO table name [column(s)] VALUES [value(s)].
DELETE: This command removes one or more records from a table according to specified conditions.
Delete command syntax:
DELETE FROM table name where [condition].

List the aggregation functions in SQL.

• COUNT returns the number of rows in a specified column.
• SUM returns the sum of the values in a specified column.
• AVG returns the average of the values in a specified column.
• MIN returns the smallest value in a specified column.
58. • MAX returns the largest value in a specified column.
Examples:
Property (PropertyNo, Street, City, postcode, Type, OwnerNo, Rooms, Rent)
Query:
How many properties cost more than 350 per month to rent?

SELECT COUNT(*) AS count FROM property WHERE rent > 350;

What is subquery.
Subquery
59. • A complete SELECT statement can be embedded(subselect) within
another SELECT statement.
• A subselect can be used in the WHERE and HAVING

12
 clauses of the outer SELECT statement (nested query).
• A subquery can be used immediately following a relational operator.
• Subquery always enclosed in parentheses.
Type of subquery:
▪ A scalar subquery returns a single column and a single row(singlevalue).
▪ A row subquery returns multiple columns, but a single row.
▪ A table subquery returns one or more columns and multiple rows.

Example:
List the staff who work in the branch at ‗163 Main St‘.

SELECT sno, fname, lname, position FROM staff WHERE bno

= (SELECT bno FROM branch WHERE street = ‗163 MainSt‘);

How to modify a data in a table in SQL?Modifying Data

in the DB (UPDATE) Syntax
UPDATE table_name
SET column_name1 = data_value1 [, column_namei =data_valuei ...]
[WHERE search_condition]
Description:
▪ table_name may be either a base table or an updatableview.

60. ▪ The SET clause specifies the names of one or morecolumns that are

updated for all rows in the table.

▪ Only rows that satisfy the search_condition are updated.

▪ data_values must be compatible with the data types for thecorresponding

columns.

What is DCL?
The Data Control Language (DCL) component of the SQL language is used to create privileges to
allow users access to, and manipulation of, the database.
61. There are two main commands:
GRANT to grant a privilege to a user
REVOKE to revoke (remove) a privilege from a user

13
 Define GRANT command in SQL.
The Syntax for the GRANT command is:
GRANT privilege_name ON object_name TO {user_name |PUBLIC
|role_name} [WITH GRANT OPTION];
Description:
privilege_name is the access right or privilege granted to the user. Some of the access rights are ALL,
EXECUTE, and SELECT.
object_name is the name of an database object like TABLE, VIEW, STORED PROC and SEQUENCE.
user_name is the name of the user to whom an access right is being granted.
PUBLIC is used to grant access rights to all users.
62. ROLES are a set of privileges grouped together.
WITH GRANT OPTION - allows a user to grant access rights to other users.

Example: GRANT SELECT ON employee TO user1;

Description:
This command grants a SELECT permission on employee table to user1.
WITH GRANT option should be used carefully because if the GRANT SELECT privilege is permitted on
employee table to user1 using the WITH GRANT option, then user1 can GRANT SELECT privilege on
employee table to another user, such
as user2 etc. Later, if you REVOKE the SELECT privilege on employee from user1, still user2 will have
SELECT privilege on employee table.

Write about REVOKE command in SQL. SQL REVOKE

Command:
The REVOKE command removes user access rights or privileges to the database objects.
The Syntax for the REVOKE command is:
REVOKE privilege_name ON object_name FROM {user_name
|PUBLIC |role_name}
Example:
63. REVOKE SELECT ON employee FROM user1;
Description:
This command will REVOKE a SELECT privilege on employee table from user1.When you REVOKE
SELECT privilege on a table from a user, the user will not be able to SELECT data from that table anymore.
However, if the user has received SELECT privileges on that table from more than one users, he/she
can
SELECT from that table until everyone who granted the permission revokes it.

Define privileges in SQL. Privileges:

Privileges defines the access rights provided to a user on a database object.
There are two types of privileges.
1) System privileges - This allows the user to CREATE, ALTER, or DROP database objects.
64. 2) Object privileges - This allows the user to EXECUTE, SELECT, INSERT, UPDATE, or
DELETE data from database objects to which the privileges apply.

What is system privileges?

65. System privileges - This allows the user to CREATE, ALTER, or DROP database objects. Few CREATE
system privileges are listed below:

14
 The above rules also apply for ALTER and DROP system privileges.
What is object privileges?
Object privileges - This allows the user to EXECUTE, SELECT, INSERT, UPDATE, or DELETE data
from database objects to which the privileges apply.

66.

Define roles in SQL.

Roles: Roles are a collection of privileges or access rights. When there are many users in a database it
becomes difficult to grant or revoke privileges to users.
67. Therefore, if you define roles, you can grant or revoke privileges to users, thereby
automatically granting or revoking privileges. You can either create Roles or use the system roles pre-
defined by oracle.
List the system privileges granted to role.

68.

Write the syntax for creating a role.

The Syntax to create a role is:
69. CREATE ROLE role_name [IDENTIFIED BY password];
Example: To create a role called "developer" with password as "pwd", CREATE ROLE
developer [IDENTIFIED BY pwd];

15
 It's easier to GRANT or REVOKE privileges to the users through a role rather than assigning a privilege
directly to every user. If a role is identified by a password, then, when you GRANT or REVOKE privileges
to the role, you
definitely have to identify it with the password.
What is the syntax for dropping a role in SQL?
The Syntax to drop a role from the database:
70. DROP ROLE role_name;
Example: To drop a role called developer, you can write:
DROP ROLE testing;
Define TCL.
TCL - Transactional Control Language. It is used to manage different transactions occurring within a
database.
Examples of TCL commands include:
71. COMMIT to apply the transaction by saving the database changes.
ROLLBACK to undo all changes of a transaction.
SAVEPOINT to divide the transaction into smaller sections. It defines
breakpoints for a transaction to allow partial rollbacks.
Define COMMIT in SQL.
SYNTAX:
COMMIT [WORK] [ COMMENT 'text' | FORCE 'text' [, integer] ]
Description:
WORK : is supported only for compliance with standard SQL. The statements COMMIT and
COMMIT WORK are equivalent.

COMMENT : specifies a comment to be associated with the current transaction. The 'text' is a quoted literal
of up to 50 characters that Oracle stores in the data dictionary view DBA_2PC_PENDING along with the
72. transaction ID if the transaction becomes in-doubt.

FORCE : manually commits an in-doubt distributed transaction. The transaction is identified by the 'text'
containing its local or global transaction ID. To find the IDs of such transactions, query the data dictionary
view DBA_2PC_PENDING. You can also use the integer to specifically assign the transaction a system
change number (SCN). If you omit the integer, the transaction is committed using the
current SCN. COMMIT statements using the FORCE clause are not supported in PL/SQL.

Define ROLLBACK statement in SQL. PURPOSE:

To undo work done in the current transaction. You can also use this command to manually und the work
done by an in-doubt distributed transaction.
SYNTAX:
ROLLBACK [WORK][ TO [SAVEPOINT] savepoint | FORCE 'text' ]
Description:
73. WORK : is optional and is provided for ANSI compatibility.

TO : rolls back the current transaction to the specified savepoint. If you omit this clause, the
ROLLBACK statement rolls back the entire transaction.

FORCE : manually rolls back an in-doubt distributed transaction. The

16
 transaction is identified by the 'text' containing its local or global transaction ID. To find the IDs of such
transactions, query the data dictionary view DBA_2PC_PENDING. ROLLBACK statements with the
FORCE clause are not supported in PL/SQ

What is embedded SQL?

Embedded SQL statements are SQL statements written inline with the program source code of the
host language. The embedded SQL statements are parsed by an embedded SQL preprocessor and replaced
74. by host-language calls to a code library. The output from the preprocessor is then compiled by the host
compiler. This allows programmers to embed SQL statements in programs written in any number of
languages such as: C/C++, COBOL and Fortran.

What is static SQL? Dec 2017 Static SQL

The source form of a static SQL statement is embedded within an application program written in a
host language such as COBOL.
The statement is prepared before the program is executed and the operational form of the statement persists
beyond the execution of the program.

Static SQL statements in a source program must be processed before the program is compiled. This
processing can be accomplished through the DB2 precompiler or the SQL statement coprocessor.

75. The DB2 precompiler or the coprocessor checks the syntax of the SQL statements, turns them into host
language comments, and generates host language statements to invoke DB2.

The preparation of an SQL application program includes precompilation, the preparation of its static
SQL statements, and compilation of the modified source program.

What is dynamic SQL?

Dynamic SQL:
Programs that contain embedded dynamic SQL statements must be precompiled like
those that contain static SQL, but unlike static SQL, the dynamic
76. statements are constructed and prepared at run time.
The source form of a dynamic statement is a character string that is passed to DB2
by the program using the static SQL statement PREPARE or EXECUTE IMMEDIATE.

17
 List and describe the features and purpose of database?
1.
List and explain the limitations of file processing system?
2.
Compare database vs file processing system?
3.
What is data model? Explain various data models with example?
4.
Explain the database system architecture with neat diagram? April/May 2017,
5. Nov/Dec 2017
List and describe the components of database management system with neat
6. diagram.
Define relational algebra. Explain various relational algebraic operations with
7. example. Nov/Dec 2016, April/May 2017
List and explain the properties of a relations with example.
8
What are the various data types in SQL? Explain them with example?
9.
List and explain various database languages with example?
10
Explain DML with example?
11

12 Explain DDL with example?

Explain DCL with example?

13
Explain TCL with example?
14.
Justify the need of embedded SQL. Consider the relation student (Reg No, name, mark and
grade). Write embedded dynamic SQL program in C language to retrieve all the students records
15
whose mark is more than
90. Nov/Dec 2016, April/May 2017.

18
 What is an entity relationship model? May/ June 2016
The entity relationship model is a collection of basic objects called entitiesand relationship
1.
among those objects. An entity is a thing or object in the
real world that is distinguishable from other objects.
Define weak and strong entity sets? April/May 2009, April/May 2018 Weak entity set: entity
set that do not have key attribute of their own arecalled weak entity sets.
2. Strong entity set: Entity set that has a primary key is termed a strong entityset.

Give the limitations of ER model? How do you overcome this? May/June 2007
The entity relationship model is a collection of basic objects called entitiesand relationship
3. among those objects. An entity is a thing or object in the
real world that is distinguishable from other objects.

Define Specialization and Aggregation.

It is the process of designating sub groupings within an entity set.It is a topdown process.
Specialization which is represented by triangle. The lable ISA stands for “is
4. a and represent, for eg that customer is a person.
Aggregation is a special kind of association that specifies a whole/part relationship between
the aggregate (whole) and a component part.

What are three characteristics of a relational database system?Nov/Dec2008

Controlling redundancy Restricting unauthorized
5. access
Providing multiple user interfaces

Give the distinction between primary key, candidate key and super key. Nov/Dec
2006,2009
Primary key – is used in a data base to avoid duplication of attributes andalso makes a relation
to the other database.
6. Candidate key - a key which is in the data base is called as candidate key, itmight be any key
attribute.
Super key – collection of keys of a database is called as super key

19
 Define functional dependency. Nov/Dec2010, Apr/ May 2015
A functional dependency is a constraint between two sets of attributes fromthe data base. A
functional dependency , denoted by
X Y
Between two sets of attributes X and Y that are subsets of R specifies aconstraint on the
7.
possible tuples that can form a relation instance r of R.

R={ A1,A2,…,An}. The constraint states that ,for any two tuples t1 and t2
in r such that t1[X]=t2[X] , we must also have t1[Y] = t2[Y].
We can also say that Y is functionally dependent on X.
Define an entity?
Entities:
Entity -a thing (animate or inanimate) of independent physical orconceptual existence and
8. distinguishable.
Example:
In the University database context, an individual student, facultymember, a class room, a
course are entities.
What is an entity set?
Entity Set or Entity Type-Collection of entities all having the sameproperties.
Example:
9.
Student entity set –collection of all student entities.Course entity set –
collection of all course entities.

What is an attribute?
Attributes:
Attributes - Each entity is described by a set of
attributes/properties.studententity
10. Example:
StudName–name of the student. RollNumber–the roll number of
the student.Sex–the gender of the student etc.
All entities in an Entity set/type have the same set of attributes.

What is derived attributes?

Derived attributes are those created by a formula or by a summary operationon other attributes
11.

20
 What is a recursive relationship?
Recursive relationships A recursive relationship is an entity is associatedwith itself.
Example:
An employee may manage many employees and each employee is managedby one employee.

12.

Define cardinality?
13. Cardinality
A business rule indicating the number of times a particular object or

21
 activity may occur.

List the properties of a relation?

All entries in a given column are of the same kind or typeThe ordering of
columns is immaterial.
14.
No two tuples are exactly the same.
There is only one value for each attribute of a tuple.The ordering of
tuples is immaterial.
Define a key?
A key is a set of attributes that uniquely identifies an entire tuple, a functional dependency allows
us to express constraints that uniquely identify the values of certain attributes.
First, keys will typically be used as links, ie. key values will appear in other relations to represent
15. their associated tuples
Second, keys form the basis for constructing indexes to speed up retrieval
of tuples from a relation. Small keys will decrease the size of indexes and the time to look up an
index.

Define a relational schema?

A Relational Database Schema comprises
1. the definition of all domains
16.
the definition of all relations, specifying for each its intension (all
attribute names), and
a primary key
List the uses of functional dependencies?
We use functional dependencies to:
test relations to see if they are legal under a given set of functional dependencies.
If a relation r is legal under a set F of functional dependencies, we saythat r satisfies F.
17. specify constraints on the set of legal relations
We say that F holds on R if all legal relations on R satisfy the set offunctional dependencies F.

Define normalization. Nov/Dec2009.April/May2010

Normalization of data is a process during which unsatisfactory relation
18. schemas are decomposed by breaking up their attributes into smallerrelation shemas that
possess desirable properties.
List the functional dependencies rules?
19.

22
 What is normalization?
Database normalization is the process of removing redundant data from the tables in to improve
storage efficiency, data integrity, and scalability.
In the relational model, methods exist for quantifying how efficient a database is. These
20. classifications are called normal forms (or NF), and there are algorithms for converting a given
database between them.
Normalization generally involves splitting existing tables into multiple ones, which must be re-
joined or linked each time a query is issued.

Define data Anomalies.Data Anomalies

Data anomalies are inconsistencies in the data stored in a database as a result of an operation such
as update, insertion, and/or deletion. Such inconsistencies may arise when have a particular record
21.
stored in multiple
locations and not all of the copies are updated.

Define 1NF.
Each table has a primary key: minimal set of attributes which can uniquelyidentify a record
The values in each column of a table are atomic (No multi-value attributes
22.
allowed). There are no repeating groups: two columns do not store similarinformation in the
same table

Define 2NF.
where a key has more than one attribute, check that each non-key attribute depends on the whole
key and not part of the key
for each subset of the key which determines an attribute or group of attributes create a new form.
23.
Move the dependant attributes to the newform.
Add the part key to new form, making it the primary key.Mark the part key as
a foreign key in the original form.

Define 3NF.
A relation R is in Third Normal Form (3NF) if and only if it is:in Second Normal
24.
Form.
Every non-key attribute is non-transitively dependent on the primary key.
23
 Define BCNF
Boyce-Codd Normal Form:
• A relation is in Boyce-Codd normal form (BCNF) if for every FD A Beither
o B is contained in A (the FD is trivial), or A contains a
candidate key of the relation,
25.
• In other words: every determinant in a non-trivial dependency is a(super) key.
The same as 3NF except in 3NF we only worry about non-key Bs
If there is only one candidate key then 3NF and BCNF are the same

List the decomposition properties. April/May 2017Decomposition

Properties
• Lossless: Data should not be lost or created when splitting relations up pendency
26.De preservation: It is desirable that FDs are preserved when splitting relations up
rmalisation to 3NF is always lossless and dependency preserving rmalisation to BCNF is
No Nolossless, but may not preserve all dependencies

Define MVD.
A multivalued dependency is a full constraint between two sets of attributes in a relation.
In contrast to the functional independency, the multivalued dependencyrequires that certain tuples
27. be present in a relation. Therefore, a multivalued dependency is also referred as a tuple-
generating dependency. The
multivalued dependency also plays a role in 4NF normalization.

Define 4NF.
4th Normal Form
A Boyce Codd normal form relation is in fourth normal form ifthere is no multi value
dependency in the relation or

there are multi value dependency but the attributes, which are multi valuedependent on a
specific attribute, are dependent between themselves.
28.
sume the following relation
a:pk1, b:pk2, c:pk3)

Recall that a relation is in BCNF if all its determinant are candidate keys, inother words each
determinant can be used as a primary key.
Because relation R has only one determinant (a, b, c), which is thecomposite primary key and
since the primary is a candidate key therefore R
is in BCNF.
Define 5NF
FIFTH NORMAL FORM
29. R is in 5NF if and only if every join dependency in R is implied by thecandidate keys of R
5NF is always achievable.

24
 a join dependency, * (A, B, …, Z), is implied by the candidate keys, K1, …,
Km of R
 the fact that K1, …, Km are candidate keys for R determine the fact that
R has the JD * (A, B, …, Z)
Show the binary relationship in diagram?

30.

List the properties of a database relation.Properties of

database relations are:
• relation name is distinct from all other relations
• each cell of relation contains exactly one atomic (single) value
31. • each attribute has a distinct name
• values of an attribute are all from the same domain
• order of attributes has no significance
• each tuple is distinct; there are no duplicate tuples
• order of tuples has no significance, theoretically.
List the various object-based logical models.
– Entity-relationship model
32. – Object-oriented model
– Semantic model
– Functional model
arious Record-based logical models
– Relational model (e.g., SQL/DS, DB2)
33.
– Network model
– Hierarchical model (e.g., IMS)

25
 What is a domain in a database.
The term domain is used to refer to a set of values of the same kind or type. For example, the
column, "Cname‟ and "Ccity‟ in the following figure, both have values of type string (ie. valid
values are any string). But they denote different domains, ie."Cname‟ denotes the domain of
customer names while "Ccity‟ denotes the domain of city names. They are different domains even
if they share common values.
34.

What is candidate Keys?

Candidate keys are those keys which is candidate for primary key of a table.Such keys will full
fill all the requirements of primary key which is not null and have unique records is a candidate
35.
for primary key. So thus type of key is known as candidate key. Every table must have at least
one candidate key
but at the same time can have several.
Define the Primary Key.
36. Unique attribute of a table will be considered as a primary key. Primary keys are used to identify
tables. There is only one primary key per table.
What is Foreign Key? April/May 2018
Foreign key are those keys which is used to define relationship between two tables. When we
want to implement relationship between two tables then weuse concept of foreign key. It is also
known as referential integrity. We can create more than one foreign key per table. foreign key is
37. generally a primary key from one table that appears as a field in another where the first table has
a relationship to the second. In other words, if we had a table A with a primary key X that linked
to a table B where X was a field in B, then
X would be a foreign key in B.

Define alternate Key.

If any table have more than one candidate key, then after choosing primary key from those
candidate key, rest of candidate keys are known as an alternate key of that table. Suppose we
38. have a table named Employee whichhas two columns EmpID and EmpMail, both have not null
attributes and
unique value. If EmpID is considered as a primary key to that table thenEmpMail is known
as alternate key.
Define Composite Key
When a key is created on more than one column then that key is known as composite key.
39. Consider a table "Student" which has two columns Sid andSrefNo and these two columns are
used as a primary key for record
extraction, then this key is known as composite key.

26
 Distinguish between key and super key? April/May 2017

40.

List the similarities between primary and candidate keys.

Both Primary and Candidate keys can uniquely identify records in a table onthe database.
Both Primary and Candidate keys have constraints UNIQUE and NOTNULL.
41. Primary key or Candidate keys can be either single column or combinationof multiple columns
in a table.

What are the characteristics of primary key? Primary key is a

special kind of index in that,
42. • there can be only one;
• it cannot be nullable
• it must be unique.
Define super key.
43. A super key is a set or one of more columns (attributes) to uniquely identifyrows in a table.

What is need for normalization. Nov/Dec 2010

To ensure that the update anomalies do not occur.
Normal forms provide a formal frame work for analyzing relation shemas based on their keys and
on the functional dependencies among their attributes.
44. A series of tests that can be carried out on individual relation schemas sothat the relation database
can be normalized to any degree. When a test fails
, the relation violating that test must be decomposed into relations that individually meet the
normalization tests

Define lossless joins (or) What is non additive property. Nov/Dec 2011
Lossless join property or non additive property ensures that nospurious tuples(tuples
45. containing wrong information) are generated when a natural join
operation is applied to the relations in the decomposition.

Explain BCNF with example(or) How to convert a relation into BCNF. Nov/dec 2007, 2008,
2009 2010, 2011,2014
Boyce-Codd Normal form: It is stricter than 3NF, meaning that every relation in BCNF is also in
46. 3NF; however a relation in 3NF is not necessarily in BCNF. A relation is in BCNF if and only if
every determinant
is a candidate key (i.e) a relatioln schema R is in BCNF if whenever a functional dependency X-
>A holds in R, then X is a superkey of R
What are pitfalls in relational database design?Nov/Dec2009 2010
47.
o Repetition of informaition
27
 o Inability to represent certain information
o Loss of information
State the anomalies of 1NF. Nov/ Dec 2015.
48. No repeating groupsRedundancy of data

Explain the desirable properties of decomposition.

Lossless-join decomposition
49.
Dependency preservationRepetition of
information
Outline the steps involved in query processing. April/May 2018.
Parsing and translation
50. OptimizationEvaluation

Explain trivial dependency? Nov/Dec 2009, 2010

51. Functional dependency of the form α ->β. is trivial if α C β. Trivial
functional dependencies are satisfied by all the relations.
Why must multivalued dependencies exist in pairs? Nov/DEC 2010, 2011
Multivalued dependencies: Multivalued dependencies are a result of 1NF which disallowed an
attribute in a tuple to have a set of values. If we have two or more multivalued independent
attributes in the same relation schema, we get into the problem of having to repeat every value of
one of the attributes with every value of the other attributes with every value of the other attribute
52.
to keep the relation instances consistent. A multivalued dependency X→>Y specified on relation
schema R where X and Y are
subsets of R specifies the following constraint on any relation r of R.

Comparison of BCNF and 3NF: Nov/Dec 2010, April/may20113NF design is

always dependency preserving and lossless. dependency preserving is difficult to
53. achieve in BCNF sometimes.BCNF strictly removes transitive dependency.
BCNF relation is in 3NF , but reverse is not possible

Why 4NF in Normal Form is more desirable than BCNF? (Nov/Dec 2014, Dec 2017)
BCNF (Boyece code normal form) has all functional dependencies A to B are trivial of
discriminator should be superkey. To get relation in BCNF, Splitting the relation schema not
necessarily preserve all functional dependency, Loss less decomposition and dependency are main
points for the normalization sometime, it is not possible to get a BCNF decomposition that is
dependency, preserving. While 4NF has very similar definition as BCNF. A relational Schema is
54. in 4NF, if all multivalued dependencies A to B are trivial and determinate A is superkey of schema.
If a relational schema is in 4nf, it is already in BCNF. and 4NF decomposition preserve the all
functional dependency. so 4NF is preferable than to have BCNF.

28
 Explain The Different Types Of Normalization Nov/Dec 2009, 2010, 2011, Nov/ Dec 2014,
1 Apr/May 2015, Nov/Dec 2016
Refer the Elmasri Navathe page no. 517
Explain In Detail About Boyce Codd Normal Form And Non LosslessJoin Dependency.
2 Nov/Dec 2009, 2010, 2011
Refer the Elmasri Navathe page no. 529
Give Detail explanation about Data Model & its types. May/ June 2009,Nov/ Dec 2014
Refer the Elmasri Navathe page no. 30
3

Explain the various components of ER diagram with examples Briefly.

4 Refer the Elmasri Navathe page no. 203
Draw ER Diagram for Difference applications ( Eg. Banking Systems . Nov/ Dec 2014,
Nov/Dec 2017, Restaurant menu ordering system Apr/ May 2015, Car Rental company Nov/
5 Dec 2015), Car Insurance Company (Nov/Dec 2016)

Discuss the correspondence between the ER model construct and the relational model
constructs. Show how each ER model construct can be mapped to the relational model.
6
Discuss the option for mapping EER
model construct. April/May 2017
Various join strategies with Example. Nov/Dec 2016Nested loop join
Block nested loop joinMerge join
7 Hash join

Differentiate between foreign key constraints and referential integrity

8 constraints with suitable example. Nov/Dec 2017
Distinguish between lossless-join decomposition and dependency
9
preserving decomposition. Nov/Dec 2017.
10 Explain FNF, SNF, TNF and DCNF with an example. Nov/Dec 2016

Give detail Explanation about Query processing / Optimization overview with example.
Nov/Dec 2014, May/ June 2016, Nov/Dec 2016, Nov/Dec 2017.
11
Elmasri Navathe page no.679

12

29
 A car rental company maintains a database for all vehicles in its current fl vehicles, it includes
the vehicle identification number, license number, m date of purchase, and color. Special data
are included for certain types of
• Trucks: cargo capacity.
• Sports cars: horsepower, renter age requirement.
• Vans: number of passengers.
• Off-road vehicles: ground clearance, drivetrain (four- or two-wheel driv Construct an ER
model for the car rental company database. (Nov/Dec 15

Construct an E-R diagram for a car insurance company whose customers cars each. Each car
has associated with it zero to any number of recorded insurance policy covers one or more
13
cars, and has one or more premium associated with it. Each payment is for a particular
period of time set of c
date when the payment was received. (Nov/Dec 16)

For the ER diagram given below explain ER to Relational mapping procedures

14

Draw E – R Diagram for the “Restaurant Menu Ordering System”, whic food items ordering
and services within a restaurant. The entire restaura detailed as follows. The Customer is
able to view the food items menu, c orders and obtain the final bill through the computer
kept in their table. their wireless tablet PC are able to initialize a table for customers, contro
to assist customers, orders, send orders to food preparation staff (chef) a customer’s bill. The
15 food preparation staffs (Chefs), with their touch-dis system, are able to view orders sent to
the kitchen by waiters. During pr able to let the waiter know the status of each item, and can
send notificat completed. The system should have full accountability and logging facili
support supervisor actions to account for exceptional circumstances, suc
refunded or walked out on. (Apr/May 17)

30
Q. No. Questions
What is transaction?Nov/Dec 2010 Nov/Dec 2014
1 Collections of operations that form a single logical unit of work are
called transactions.
What are the properties of transaction? Nov /Dec 2009, April/May2010 NOV/DEC 2014 ,
May/June 2016 (or) What are the ACID properties? APRIL/MAY-2011 , Nov/Dec 2017,
The properties of transactions are:Atomicity
ConsistencyIsolation
2
Durability

Define lock? Nov2009, Nov2010, Nov2011

Lock is the most common used to implement the requirement is to allow atransaction to access
3
a data item only if it is currently holding a lock on that
item.
What are the different modes of lock? Nov2009, Nov2011
The modes of lock are:Shared /Read
4 Exclusive /Write

Define deadlock? April 2009,April 2010, April2011

5 Neither of the transaction can ever proceed with its normal execution. This
situation is called deadlock.
Define the phases of two phase locking protocol April/May 2009 Growing phase: a
transaction may obtain locks but not release any lock. Shrinking phase: a transaction may
6
release locks but may not obtain any
new locks.
What is meant by log-based recovery? April 2009
The most widely used structures for recording databasemodifications is the
7 log.
The log is a sequence of log records, recording all the update activities inthe database. There
are several types of log records.
8 Define shadow paging. Nov/Dec 2009

31
 An alternative to log-based crash recovery technique is shadow paging. This
technique needs fewer disk accesses than do the log-based methods.
When is a transaction rolled back?
Any changes that the aborted transaction made to the database must beundone.
9 Once the changes caused by an aborted transaction have been undone, thenthe transaction has
been rolled back.

What is a recovery scheme? April/May 2009

10 An integral part of a database system is a recovery scheme that can restore
the database to the consistent state that existed before the failure.
What are two pitfalls (problem) of lock-based protocols? APRIL/MAY-2011
Deadlock
11 Starvation

What are the two statements regarding transaction?

12 The two statements regarding transaction of the form:  Begin transaction
 End transaction
What is recovery management component?
13 Ensuring durability is the responsibility of a software component of the base system called the
recovery management component.
When is a transaction rolled back?
Any changes that the aborted transaction made to the database must be undone. Once the changes
14
caused by an aborted transaction have been undone, then the transaction has been rolled back.

What is a shadow copy scheme?

It is simple, but efficient, scheme called the shadow copy schemes. It isbased on making
15 copies of the database called shadow copies that one
transaction is active at a time. The scheme also assumes that the database issimply a file on disk.

Give the reasons for allowing concurrency? Nov/Dec 2017

The reasons for allowing concurrency is if the transactions run serially, a short transaction may
have to wait for a preceding long transaction to complete, which can lead to unpredictable delays
16
in running a transaction.
So concurrent execution reduces the unpredictable delays in running transactions.

What is average response time?

17 The average response time is that the average time for a transaction to be
completed after it has been submitted.
What is serializability? Explain its types? NOV/DEC 2014, Nov/Dec2016, April/May 2018
A (possibly concurrent) schedule is serializable if it is equivalent to a serialschedule. Different
forms of schedule equivalence give rise to the notions of:
18 • conflict serializability
• view serializability

32
 Define upgrade and downgrade?
It provides a mechanism for conversion from shared lock to exclusive lockis known as upgrade.
19
It provides a mechanism for conversion from
exclusive lock to shared lock is known as downgrade.
What is a database graph?
20 The partial ordering implies that the set D may now be viewed as a directedacyclic graph, called
a database graph.
What are the two methods for dealing deadlock problem?
The two methods for dealing deadlock problem isdeadlock detection
21
deadlock recovery.

What is a recovery scheme?

22 An integral part of a database system is a recovery scheme that can restore
the database to the consistent state that existed before the failure.
Define garbage collection. May/June 2016
Garbage may be created also as a side effect of crashes. Periodically, it isnecessary to find all
23
the garbage pages and to add them to the list of free
pages. This process is called garbage collection.
Differentiate strict two phase locking protocol and rigorous two phase locking protocol.
May/June 2016
In strict two phase locking protocol all exclusive mode locks taken by a transaction is held until
24
that transaction commits. Rigorous two phase locking protocol requires that all locks be held
until the transaction
commits.
How the time stamps are implemented
Use the value of the system clock as the time stamp. That is a transaction‟s time stamp is equal to
the value of the clock when the transaction enters the system. • Use a logical counter that is
25
incremented after a new timestamp has been assigned; that is the time stamp is equal to the value
of the counter.

What are the time stamps associated with each data item?
W-timestamp (Q) denotes the largest time stamp if any transaction that
26
executed WRITE (Q) successfully. • R-timestamp (Q) denotes the largest time stamp if any
transaction that executed READ (Q) successfully.
Define blocks? What are its types?
The database system resides permanently on nonvolatile storage, and ispartitioned into
fixedlength storage units called blocks.
Physical blocks
27 The input and output operations are done in block units. The blocks residingon the disk are
referred to as physical blocks.
Buffer blocks
The blocks residing temporarily in main memory are referred to as buffer
blocks
What is meant by concurrency control? Nov/Dec 2015
28
Process of managing simultaneous operations on the database without
33
 having them interfere with one another.
Prevents interference when two or more users are accessing databasesimultaneously and at least
one is updating data.
Give an example of Two phase commit protocol. Nov/Dec 2015
In distributed databases, "single phase" commit is what is used. All the necessary information for
the transaction to be undone or completed are written to persistent storage (typically called a
"transaction log") in an atomic step. The transaction is committed as soon as this information is
29 permanently recorded. This is not possible in a distributed system, as there's no guarantee that the
commit record is written on all participating systems. With distributed databases, Two Phase
Commit solves this problem.

List the four conditions for deadlock. Nov/Dec 2016

1. mutual exclusion: at least one process must be held in a non-sharable mode.
2. hold and wait: there must be a process holding one resource andwaiting for another.
3. No preemption: resources cannot be preempted.
30 4. circular wait: there must exist a set of processes
[p1, p2, ..., pn] such that p1 is waiting for p2, p2 for p3, andso on upto pn.

What is serializible schedule? April/May 2017

To process transactions concurrently, the database server must execute some component statements
of one transaction, then some from other transactions, before continuing to process further
31
operations from the first.
The order in which the component operations of the various transactions are interleaved is called
the schedule
What type of locking needed for insert and delete operations? April/May 2017
Share/Exclusive (for Read/Write) Locks
We should allow several transactions to access the same item A if they all access A' for reading
purposes only. However, if a transaction is to write an item A, it must have exclusive access to A.
32
For this purpose, a different type
of lock called a multiple-mode lock is used. In this scheme there are shared/exclusive or read/write
locks are used.

State the difference between a shared lock and an exclusive lock.April/May 2018.
Shared lock:
Shared locks are placed on resources whenever a read operation (select) isperformed.
Multiple shared locks can be simultaneously set on a resource.
Exclusive lock:
33
Exclusive locks are placed on resources whenever a write operation(INSERT, UPDATE And
DELETE) are performed.
Only one exclusive lock can be placed on a resource at a time.

34
 i.e. the first user who acquires an exclusive lock will continue to have the
sole ownership of the resource, and no other user can acquire an exclusivelock on that resource

What is query execution plan? April/May 2017

34 The Query Execution Plans describe the steps and the order used to access
or modify data in the database.
What are the costs involved in query execution? April/May 2017
i. Access cost to secondary storage.
ii. Disk storage cost.
35
iii. Computation cost
iv. Memory usage cost and
v. Communication cost
Define atomicity?
36 Either all operations of the transaction are refl ected properly in the database or none are.

Define Durability?
37 A transaction completes successfully then changes It has made to the
database persist even if there are system failure.
What is transaction-management component?
Ensuring atomicity is the responsibility of the database system itselfspecifically, it
38
is handled by a component called the transaction-
management component.
What are the two operation for accessing data in transaction?
39 Read(x)- transfer data item x from database. Write(x)- transfer data
item x from the local buffer.
What do you mean by read only transaction?
40 The data base operation in a transaction do not update the database but onlyretrieve data, the
transaction is called a read-only transaction.
What are the steps followed in Executing read(x)command intransaction?
1. Find the address of the disk block that contains item x.
41 2. Copy that disk block in to a buffer in main memory.
3. Copy item x from the buffer to the program variable named x.

What are the steps followed in executing write(x) command intransaction?

1. find the address of disk block that contain item x.
2. Copy that disk block into buffer in main memory.
42 3. Copy item x from the program variable named x into its correct location in the buffer
4. Store the update block from the buffer back to disk.

List out the transaction states?

43
i) active ii) Partially Committed iii) Failed iv) Abort v) committed.
What are the need for concurrency?
44 i) Improved throughput and resource utilization
ii) Reduced waiting time.
35
 Define Schedule.
45 The chromosomal order in which instructions are executed in the system.
When the schedule is called serial?
Each serial schedule consists of a sequence of instruction from various transaction where the
46
instruction belonging to one single transaction appear
together in that schedule.
When two operation in schedule are said to be conflict?
i) Two operation belong to different transaction
47
ii) Two operation access the same item x
iii) At least one of the operation is write-item (x)
Define cascading rollback?
48 An uncommitted transaction has to be roll back because it read an itemfrom a transaction that
failure.
When the schedule is said to cascade less?
A schedule is said to be cascadeless or avoid cascading roll back if every
49
transaction in the schedule reads only items that were written by committedtransactions.

Define lock table?

50 System maintain record for the items that are currently locked in lock table
that which could be organized as a hash file.
What you mean by lock conversion?
51 A transaction that already holds a lock on item xis allowed under certaincondition to voncery the
Locke from one locked state to another.

Describe Log Based Recovery May/june 2008

1 Refer Elmasri Navathe page no.612
What is Serializability? Explain Its Types? April2009, 2011 Nov/Dec2014 , April/May
2 2018
Write Short Notes On Transaction Concept & Transaction State? April 2011 Nov/Dec
3 2014, April/May 2018
Refer Elmasri Navathe page no.559, 562
Briefly Describe Concurrency control execution? Illustrate with asuitable example. Nov/
4 Dec 2015, April/May 2018
Refer Elmasri Navathe page no.583
Explain in terms of Locking mechanism and Two Phase Commit
5 Protocol Nov/Dec 2014, April / May 2015, May/June 2016, Nov/Dec 2017

36
 Refer the Elmasri Navathe page no 584
Explain about locking protocols. May/June 2016 Refer the Elmasri
6
Navathe page no 584
Discuss about conflict and view serializability. April/ May 2015. Nov/ Dec 2015
7 Refer the Elmasri Navathe page no 570

Explain Deadlock in detail with an example. . Nov/Dec 2014 , Nov/ Dec2015, Nov/Dec 2017
8 Refer the Elmasri Navathe page no 591

Briefly describe two phase locking in concurrency control techniques.(Nov/Dec 2014)

9 Refer the Elmasri Navathe page no 584

Explain the concepts of concurrent execution in Transactionprocessing system.

10 (Nov/Dec 2014)
Refer Elmasri Navathe page no.583
Give detail explanation about ACID Properties Nov/Dec 2009,April 2011
11 Refer Elmasri Navathe page no.562

State and explain the lock based concurrency control with suitableexamples? Nov/Dec 2017
12
Discuss the violations caused by each of the following: dirty read, non-repeatable read and
13
phantoms with suitable example. April/May 2017.
Explain why timestamp-based concurrency control allows schedulesthat are not
14 recoverable. Describe how it can be modified through
buffering to disallow such schedules. April/May 2017.
How can you implement atomicity in transactions? Explain.
15

37
 What is B-Tree?
1
A B-tree eliminates the redundant storage of search-key values.It allows search key values to appear
only once.

What is a B+-Tree index?

2 A B+-Tree index takes the form of a balanced tree in which every path from the root of
the root of the root of the tree to a leaf of thetree is of the same length

What is a hash index?

3
A hash index organizes the search keys, with their associated pointers, into a hash
file structure

Define seek time.

4
The time for repositioning the arm is called the seek time and it increases with the
distance that the arm is called the seek time.

Define rotational latency time.

5
The time spent waiting for the sector to be accessed to appear under the head is called the
rotational latency time.

What is called mirroring?

6
The simplest approach to introducing redundancy is to duplicate
every disk. This technique is called mirroring or shadowing.

What are the two main goals of parallelism?

Load –balance multiple small accesses, so that the throughput ofsuch accesses
7 increases.
Parallelize large accesses so that the response time of largeaccesses is reduced

What is an index?
8
An index is a structure that helps to locate desired records of arelation quickly,
without examining all records

What are the factors to be taken into account when choosing aRAID level?
Monetary cost of extra disk storage requirements.
Performance requirements in terms of number of I/O operations Performance when a
9
disk has failed and Performances during
rebuild.

What are the types of storage devices?

10
Primary storage, Secondary storage, Tertiary storage, Volatilestorage, Nonvolatile
storage

38
11 What is called remapping of bad sectors?
If the controller detects that a sector is damaged when the disk is initially formatted, or
when an attempt is made to write the sector, it can logically map the sector to a different
physical location.

Define software and hardware RAID systems?(May/June 16) RAID can be

implemented with no change at the hardware level, using only software modification.
12
Such RAID implementations arecalled software RAID systems and the systems with
special
hardware support are called hardware RAID systems.
Define hot swapping?
Hot swapping permits the removal of faulty disks and replaces it by new ones without
13
turning power off. Hot swapping reduces the mean time to repair.

What are the ways in which the variable-length records arise indatabase systems?
Storage of multiple record types in a file, Record types that allowvariable lengths for
14
one or more fields, Record types that allow
repeating fields.

What are the two types of blocks in the fixed –lengthrepresentation?

Define them.

15
Anchor block: Contains the first record of a chain.

Overflow block: Contains the records other than those that are thefirst record of a
chain.

What is hashing file organization?

16 In the hashing file organization, a hash function is computed on
some attribute of each record. The result of the hash function specifies in which
block of the file the record should be placed.

What are called index-sequential files?

17
The files that are ordered sequentially with a primary index on the
search key are called index-sequential files.

Define Primary index and Secondary Index

It is in a sequentially ordered file, the index whose search key specifies the sequential
order of the file. Also called clustering index. The search key of a primary index is usually
18
but not necessarily the primary key. It is an index whose search key specifies an order
different from the sequential order of the file. Also
called non clustering index.

39
 Give an example of a join that is not a simple equi-join for whichpartitioned parallelism can be
19 used. (Nov/Dec 15)

Differentiate static and dynamic hashing. (Apr/May 15) (Nov/Dec14,15)

Static Hashing Dynamic Hashing
In static hashing, when a Hash function, in dynamic hashing, search-key value is
provided, is made to produce a large number the hash function
always of values and only a few are used computes the same
address. initially.
The number of buckets Dynamic hashing provides a provided remains
20
unchanged mechanism in which data buckets
at all times i.e. fixed are added and removed dynamically
and on-demand .i.e. no. of buckets not fixed.
Space and overhead is more Minimum space and less overhead As file grows
performance Performance do not degrade as filedecreases grows

List out the mechanisms to avoid collision during hashing.(Nov/Dec

16)
In overflow chaining, the overflow buckets of a given bucket arechained together in a
21 linked list.
Above scheme is called closed hashing. An alternative, called open hashing, which
does not use overflow buckets, is not suitablefor database applications.

What are the disadvantages of B-Tree over B+ Tree? (Nov/Dec 16)

Only small fraction of all search-key values are found early Non-leaf nodes are
larger. Thus, B-Trees typically have greater
depth than corresponding B+-Tree
22
Insertion and deletion more complicated than in B+-Trees Implementation is
harder than B+-Trees.

What is called query processing?

23
Query processing refers to the range of activities involved in
extracting data from a database.

24 What is called a query evaluation plan?

A sequence of primitive operations that can be used to evaluate be

40
 query is a query evaluation plan or a query execution plan.

Explain “Query optimization”?(May/June 16)

25
Query optimization refers to the process of finding the lowest cost method of evaluating
a given query.

State the need for Query Optimization. (Apr/May 15)

26
The query optimizer attempts to determine the most efficient way toexecute a given query
by considering the possible query plans.
What is meant by software and hardware RAID systems? May/June 2016 RAID can be implemented
with no change at the hardware level, using only software modification. Such RAID implementations are
27 called software RAID systems and the systems with special hardware support are called hardware RAID
systems.

What is the use of RAID? April/May2009, Nov/Dec2010

A variety of disk-organization techniques, collectively called redundant arrays of independent
28 disks are used to improve the performance and reliability

What is known as heap file organization? Nov/Dec 2009

In the heap file organization, any record can be placed anywhere in the file where there is space for
the record. There is no ordering of records. There is a single file for each relation.
29
What is known as sequential file organization? April/May2009
In the sequential file organization, the records are stored in sequential
30 order, according to the value of a “search key” of each record.

What are the types of indices?

Ordered indices Hash indices
31
What are the advantages and disadvantages of indexed sequential file? APRIL/MAY- 2011
The advantage of ordering records in a sequential file according to a key is that you can then search the file
more quickly. If you know the key value that you want, you can use one of the relatively fast searches. The
disadvantage is that when you insert, you need to rewrite at least everything after the insertion point, which
makes inserts very expensive unless they are done at the end of the file. An indexed file approach keeps a
32 (hopefully) small part of each row, and some kind of "pointer" to the row's location within the data file.
This allows a search to use the index, which
is ordered by the index and (again hopefully) much smaller and therefore much

41
 faster than scanning the entire data file for the indexed data.

Compare sequential access devices versus random access devices with an example
sequential access devices random access devices Must be accessed from the beginning It is possible to read
data from any location Eg:- tape storage Eg:-disk storage Access to data is much slower Access to data is
faster Cheaper than disk Expensive when compared with disk
33
Explain how reliability can be improved through redundancy?
The simplest approach to introducing redundancy is to duplicate every disk. This technique is called
mirroring or shadowing. A logical disk then consists of two physical disks, and write is carried out on both
the disk. If one of the disks fails the data can be read from the other. Data will be lost if the second disk
34
fails before the first fail ed disk is repaired.
What is database tuning? APRIL/MAY-2011
Database tuning describes a group of activities used to optimize and homogenize the performance of a
database. It usually overlaps with query tuning, but refers to design of the database files, selection of the
database management system (DBMS), operating system and CPU the DBMS runs on.
35
What are a block and a block number?
A block is a contiguous sequence of sectors from a single track of one platter. Each request specifies
36 the address on the disk to be referenced. That address is in the form of a block number.

What are the benefits of RAID

Data loss can be very dangerous for an organization RAID technology
37 prevents data loss due to disk failure
RAID technology can be implemented in hardware or software Servers make use of
RAID Technology

Define Bit-Interleaved Parity

38 A single parity bit is enough for error correction, not just detection, since we know which disk has
failed

42
 – When writing data, corresponding parity bits must also be computed and written to a parity bit disk
– To recover data in a damaged disk, compute XOR of bits from other disks (including parity bit disk)
I/O operation addresses all the drives at the same time, RAID 3 cannot overlap I/O. For this reason,
RAID 3 is best for single-user systems with long record applications

What is Block-Interleaved Parity

When writing data block, corresponding block of parity bits must also be computed and written to
parity disk
39 To find value of a damaged block, compute XOR of bits from corresponding blocks (including
parity block) from other disks

What are the Types of Ordered Indices

Dense index Sparse index
40

What is Multilevel Index

If primary index does not fit in memory, access becomes expensive.
To reduce number of disk accesses to index records, treat primary index kept on disk as a sequential file
and construct a sparse index on it.
41 – outer index – a sparse index of primary index
– inner index – the primary index file
If even outer index is too large to fit in main memory, yet another level of index can be created, and so
on

Define Primary and Secondary Indices

Secondary indices have to be dense.
Indices offer substantial benefits when searching for records.
When a file is modified, every index on the file must be updated, Updating indices imposes
42 overhead on database modification.
Sequential scan using primary index is efficient, but a sequential scan using a secondary index is
expensive
– each record access may fetch a new block from disk

Draw the structure of B+-Tree Node .

Typical node

– Ki are the search-key values

43 – Pi are pointers to children (for non-leaf nodes) or pointers to records or buckets of records (for leaf
nodes).
The search-keys in a node are ordered

K1 < K2 < K3 < . . . < Kn–1

What are the Algorithms for Executing Relational Query Operations
An RDBMS must include one or more alternative algorithms that implement
44 each relational algebra operation (SELECT, JOIN,…) and, in many cases, that implement each
combination of these operations.
43
 Each algorithm may apply only to particular storage structures and access paths
(such index,…).
Only execution strategies that can be implemented by the RDBMS algorithms and that apply to the
particular query and particular database design can be considered by the query optimization module.

What are the Advantages and disadvantages of extendable hashing?

Advantages of extendable hashing:

– Hash performance does not degrade with growth of file
45 – Minimal space overhead
Disadvantages of extendable hashing
– Extra level of indirection to find desired record

Bucket address table may itself become very big.

What are the Cost functions for SELECT Operation Linear Search:
– [nBlocks(R)/2], if the record is found.
– [nBlocks(R)], if no record satisfied the condition.
Binary Search :
46
o [log2(nBlocks(R))], if equality condition is on key attribute, because SCA(R) = 1 in this case.
o[log2(nBlocks(R))] + [SCA(R)/bFactor(R)] – 1, otherwise.

Write the Cost functions for JOIN Operation

Join operation is the most time consuming operation to process.
An estimate for the size (number of tuples) of the file that results after the JOIN operation is required to
develop reasonably accurate cost functions for JOIN operations.
47 The JOIN operations define the relation containing tuples that satisfy a specific predicate F from the
Cartesian product of two relations R and S.

Define Cost Estimation in Query Optimization

The main aim of query optimization is to choose the most efficient way of implementing the relational
48 algebra operations at the lowest possible cost.

What is External Sorting ?

It refers to sorting algorithms that are suitable for large files of records on disk that do not fit entirely in
49 main memory, such as most database files..

What are Cost Components of Query Execution ?

The cost of executing the query includes the following components:
– Access cost to secondary storage.
50 – Storage cost.
– Computation cost.
– Memory uses cost.
– Communication cost.

44
 Q. NO. QUESTIONS

1 Describe File Organization.

2 Define RAID and Briefly Explain RAID techniques.

3
Explain Secondary storage devices.

4 Explain about static and dynamic hashing with anexample

5 Explain about Multidimensional and parallel with anexample

6
Explain about ordered indices with an example

7 Explain about B + trees indexing concepts with an example

8 Explain about B trees indexing concepts with anexample

9 Illustrate indexing and hashing techniques with suitable examples.

10 Explain about Query optimization with neat Diagram.

Give a detailed description about Query processing and

Optimization.Explain the cost estimation of Query Optimization (Nov/Dec
11
14). , Nov/ Dec 2016

Discuss about join order optimization and heuristicoptimization

12 algorithm. (Apr/May 15)

13 Briefly explain about Query Processingreview(May/June 16)

Write Short Notes On Index Structure Of Files? Nov/Dec 2014

14
Give detail Explanation about Hashing & Types of Hashing.
15

45
 What is homogeneous distributed database and heterogeneousdistributed database
A homogeneous distributed database has identical software and hardware running all
databases instances, and may appear through a single interface as if it were a single
1 database. A heterogeneous distributed database may have different hardware, operating
systems,database management systems, and even data models for different
databases

Define Distributed Database Systems. (Nov/Dec 16)

2 Database spread over multiple machines (also referred to as sites or nodes).Network interconnects the
machines. Database shared by users
on multiple machines is called Distributed Database Systems

What are the types of Distributed Database

3
Homogeneous Distributed DBHetrogneous
Distributed DB

Define fragmentation in Distributed Database

The system partitions the relation into several fragment and stores each fragment at
4
different sites
Two approaches : Horizontal Fragmentation, Vertical Fragmentation

46
 Define Database replication.
Database replication can be used on many database management systems, usually with a
master/slave relationship between the original and the copies. The master logs the updates,
which then ripple through to the slaves. The slave outputs a message stating that it has
received the update successfully, thus allowing the sending of subsequent
updates.

What is the advantage of OODB?

6
An integrated repository of information that is shared by multiple
users, multiple products, multiple applications on multiple platforms.

What is Object database System?

An object database is a database management system in which information is represented
7
in the form of objects as used in object- oriented programming. Object-relational databases
are a hybrid of
both approaches.

What are the advantages of OODB?

An integrated repository of information that is shared by multiple users, multiple products,
multiple applications on multiple platforms.It also solves the following problems: 1. The
semantic gap: The real world and the Conceptual model is very similar. 2. Impedance
mismatch: Programming languages and database systems must be interfaced to solve
8 application problems. But the language style, data structures, of a programming language
(such as C) and the DBMS (such as Oracle) are different. The OODB supports general
purpose programming in the OODB framework. 3. New application
requirements: Especially in OA, CAD, CAM, CASE, object-orientation is the
most natural and most convenient.

How do you define types in object relational feature in oracle? Oracle allows us to
9 define types similar to the types of SQL. The syntax is
CREATE TYPE t AS OBJECT ( list of attributes and methods );

Define ODMG Object model?

10 The ODMG object model is the data model upon which the object definition langauge
(ODL) and object query language (OQL) are based.

Define ODL.
ODL langauge is used to create object specifications: classes and interfaces
- Using the specific langauge bindings to specify how ODL constructs can be mapped to
11
constructs in specific programming
language, such as C++, SMALLTALK, and JAVA

47
 Define Information Retrieval.
12
It is an activity of obtaining information resources relevant to an
information need from a collection of information resources

Define Relevance Ranking. (Nov/Dec 14)

13
A system in which the search engine tries to determine the theme of asite that a link is
coming from.

Can we have more than one constructor in a class? If yes, explain the need for such a
14
situation. (Nov/Dec 15)
Yes, default constructor and constructor with parameter

Define XML Database.

An XML database is a data persistence software system that allows data to be stored in
15 XML format. These data can then be queried, exported and serialized into the desired
format. XML databases are
usually associated with document-oriented databases.

Define OQL with syntax.

Entry point to the database: needed for each query which canbe any named
persistent object:
class Person
( extent persons
key ssn)
16
{ ... ... }
class Faculty extends Person ENTRY POINTS( extent faculy )
{ ... ... }
class Department
( extent departmet key dname){....... }

Define Crawling and indexing the web. (Nov/Dec 14)

Web Crawling is the process of search engines combing through web pages in order to
properly index them. These “web crawlers” systematically crawl pages and look at the
keywords contained on the page, the kind of content, all the links on the page, and then
returns that information to the search engine’s server for indexing. Then they follow all the
17
hyperlinks on the website to get to other websites. When a search engine user enters a query,
the search engine will go to its index and return the most relevant search results based on the
keywords in the search term. Web crawling is an automated process
and provides quick, up to date data.

48
 How does the concept of an object in the object-oriented modeldiffer from the
concept of an entity in the entity-relationship model?(Nov/Dec 16)
An entity is simply a collection of variables or data items. An object is an encapsulation of
data as well as the methods (code) to operate on the data. The data members of an object are
18
directly visible only to its methods. The outside world can gain access to the object’s data
only by passing pre-defined messages to it and these messages are
implemented by the methods.

Is XML Hierarchical?
XML documents have a hierarchical structure and can conceptually beinterpreted as a tree
19 structure, called an XML tree. XML documents must contain a root element (one that is the
parent of all other elements). All elements in an XML document can contain sub
elements, text and attributes.

What is DTD?
A document type definition (DTD) contains a set of rules that can be used to validate an
20 XML file. After you have created a DTD, you can edit it manually, adding declarations that
define elements, attributes, entities, and notations, and how they can be used for any XML
files
that reference the DTD file.

What is the use of XML Schema?

XML Schema is commonly known as XML Schema Definition (XSD). It is used to describe
21
and validate the structure and the content of XML data. XML schema defines the elements,
attributes and data
types. Schema element supports Namespaces.

What is Xpath and Xquery?

XPath can be used to navigate through elements and attributes in an XML document. XPath
22 is a syntax for defining parts of an XML document. XPath uses path expressions to navigate
in XML documents. XPath contains a library of standard functions. XPath is a
major element in XSLT and in XQuery.

Define Keyword Queries.

23 Keyword-based queries are the simplest and most commonly used forms of IR queries:
the user just enters keyword combinations to
retrieve documents.

What are the Types of Queries in IR Systems

24 Keyword Queries. Boolean Queries Phrase Queries
Proximity Queries

49
 Wildcard Queries
Natural Language Queries

State the steps to create DTD.

Create a new DTD, complete the following steps:
1. Create a project to contain the DTD if needed.
2. In the workbench, click File > New > Other and select XML >DTD. Click Next.
3. Select the project or folder that will contain the DTD.
4. In the File name field, type the name of the DTD, for example MyDTD.dtd. The name of
your DTD file must end with the extension
25
.dtd
5. Click Next.
6. Optional: You can use a DTD template as the basis for your newDTD file. To do so,
click the Use DTD Template check box, and select the template you want to use.
7. Click Finish.

What is the difference between Information Retrieval and DBMS. ?

S.No Information Retrieval DBMS 1 Imprecise semantics Precise semantics 2 Keyword search SQL 3
Unstructured data format Structured data 4 Reads mostly. Adds document occasionally. Expects reasonable
26
number of updates. 5 Displays page through top k results. Generates full answer.

What are Goals of Distributed Database system ?

Reliability: In distributed database system, if one system fails down or stops working for some
time another system can complete the task.
27 Availability: In distributed database system reliability can be achieved even if sever fails down.
Another system is available to serve the client request. Performance: Performance can be
achieved by distributing
database over different locations. So the databases are available to every location which is easy
to maintain.
Distributed DBMS Architectures
DDBMS architectures are generally developed depending on three parameters − Distribution − It states
the physical distribution of data across the different sites. Autonomy − It indicates the distribution of
28 control of the database system and the degree to which each constituent DBMS can operate independently.
Heterogeneity − It refers to the uniformity or dissimilarity of the data models, system components and
databases.

What are Architectural Models of DDBMS.

Some of the common architectural models are –
29
Client - Server Architecture for DDBMS Peer - to - Peer
Architecture for DDBMS

50
 Multi - DBMS Architecture

What is Client - Server Architecture for DDBMS

This is a two-level architecture where the functionality is divided into servers and clients. The server
functions primarily encompass data management, query processing, optimization and transaction
management. Client functions include mainly user interface. However, they have some functions like
consistency checking and transaction management.
30 The two different client - server architecture are −
Single Server Multiple Client Multiple Server Multiple
Client (

Write short notes on Peer- to-Peer Architecture for DDBMS

In these systems, each peer acts both as a client and a server for imparting database services. The peers share
their resource with other peers and co-ordinate their activities.
This architecture generally has four levels of schemas −
31 Global Conceptual Schema − Depicts the global logical view of data. Local Conceptual Schema
− Depicts logical data organization at each site. Local Internal Schema − Depicts physical data
organization at each site.
External Schema − Depicts user view of data

Write short notes on Multi - DBMS Architectures

This is an integrated database system formed by a collection of two or more autonomous database
systems.
Multi-DBMS can be expressed through six levels of schemas −
Multi-database View Level − Depicts multiple user views comprising of subsets
of the integrated distributed database.
Multi-database Conceptual Level − Depicts integrated multi-database that comprises of global logical
multi-database structure definitions.
32 Multi-database Internal Level − Depicts the data distribution across different
sites and multi-database to local data mapping.
Local database View Level − Depicts public view of local data.
Local database Conceptual Level − Depicts local data organization at each site. Local database
Internal Level − Depicts physical data organization at each site. There are two design alternatives for
multi-DBMS −
Model with multi-database conceptual level. Model without multi-
database conceptual level.

Define Replication and Fragmentation.

Replication. The system maintains several identical replicas of the relation, and stores each replica at a
different site. The alternative to replication is to store only one copy of relation r.
33 Fragmentation. The system partitions the relation into several fragments, and stores each fragment at a
different site.

What are the advantages and disadvantages to replication.

Availability If one of the sites containing relation r fails, then the relation r can be found in another site.
34 Thus, the system can continue to process queries involving r, despite the failure of one site.
Increased parallelism. In the case where the majority of accesses to the relation r

51
 result in only the reading of the relation, then several sites can process queries involving r in parallel. The
more replicas of r there are, the greater the chance that the needed data will be found in the site where the
transaction is executing. Hence, data replication minimizes movement of data between sites. Increased
overhead on update. The system must ensure that all replicas of a relation r are consistent; otherwise,
erroneous computations may result. Thus, whenever is updated, the update must be propagated to all sites
containing replicas. The result is increased overhead. For example, in a banking system, where account
information is replicated in various sites, it is necessary to ensure that the balance in a particular
account agrees in all sites.
Define Transparency
The user of a distributed database system should not be required to know where the data are physically
35 located nor how the data can be accessed at the specific local
site. This characteristic, called data transparency, can take several forms:
What are the DISTRIBUTED TRANSACTIONS
There are two types of transaction that we need to consider.
Local transactions are those that access and update data in only one local database;
36 Global transactions are those that access and update data in several local databases
Write the System Failure Modes
Failure of a site. Loss of messages.
Failure of a communication link. Network partition
37
Define Complex Data Types .,
38 Traditional database applications have conceptually simple datatypes. The basic
data items are records that are fairly small and whose fields are atomic.
What is Structured Type?
Structured types allow composite attributes of E-R designs to be represented directly. For instance, we
39 can define the following structured type to represent a
composite attribute name with component attribute firstname and lastname:
Write the Object-Identity and Reference Types in SQL
Object-oriented languages provide the ability to refer to objects. An attribute of a type can be a reference to
an object of a specified type. For example, in SQL we can define a type Department with a field name and
a field head that is a reference to the type Person, and a table departments of type Department, as follows:
create type Department ( name varchar(20),
40 head ref(Person) scope people);
create table departments of Department;
Here, the reference is restricted to tuples of the table people.

What are the Object-relational Features ?

Object-relational database systems are basically extensions of existing relational database systems. Changes
41 are clearly required at many levels of the database system. However, to minimize changes to the
storage-system code (relation
storage, indices, etc.), the complex datatypes supported by object-relational

52
 systems can be translated to the simpler type system of relational databases. Sub tables can be stored
in an efficient manner
Define Objects and Literals .
Objects and literals are the basic building blocks of the object model. The main difference between the two
is that an object has both an object identifier and a state (or current value), whereas a literal has a value
42 (state) but no object identifier. In either case, the value can have a complex structure. The object state
can change over time by modifying the object value. A literal is basically a constant value, possibly having
a complex structure, but it does not change.

What re the aspects of an object?

43 An object has five aspects: identifier, name, lifetime, structure, and creation.

What rae the types of literals?

There are three types of literals: atomic, structured, and collection.
44
What are the notation of ODMG??
45 The notation of ODMG uses three concepts: interface, literal, and clas

Define ODL: OBJECT DEFINITION LANGUAGE

Object Definition Language (ODL) is the specification language defining the interface to object types
46 conforming to the ODMG Object Model. Often abbreviated by the acronym ODL.This language's purpose
is to define the structure
of an Entity-relationship diagram.
How to declare the class and element.?
Class Declarations
interface < name > {elements = attributes, relationships, methods }
47 Element Declarations
attribute < type > < name > ;
relationship < rangetype > < name > ;
Write the Similarities between E/R and ODL both support all
multiplicities of relationships both support inheritance
48
Define XML SCHEMA
XML Schema defines a number of built-in types such as string, integer, decimal date, and boolean. In
49 addition, it allows user-defined types; these may be simple types with added restrictions, or complex types
constructed using constructors such
as complex Type and sequence.
What are the RETRIEVAL MODELS
50 There are the three main statistical models—Boolean, vector space, and probabilistic—and the semantic
model.

Explain about Object Oriented Databases and XM Databases.

1

2 Explain in detail (i) Information Retrieval (iii) Transaction processing

53
3
Write short notes on Distributed Transactions.
4
Explain in detail the Client - Server Architecture for DDBMS

Suppose an Object Oriented database had an object A, which references object B, which in
turn references object C. Assume all objects are on disk initially? Suppose a program first
5 dereferences A,then dereferences B by following the reference from A, and then finally
dereferences C. Show the objects that are represented in
memory after each dereference, along with their state.

Suppose that you have been hired as a consultant to choose a databasesystem for your
client’s application. For each of the following applications, state what type of database
system (relational, persistent programming language–based OODB, object relational; do not
specify a commercial product) you would recommend. Justify your recommendation.
(i)A computer-aided design system for a manufacturer of airplanes.(ii)A system to track
6
contributions made to candidates for public office.
(iii)An information system to support the making of movies.

Give the DTD for an XML representation of the following nested-relational schema
Emp = (ename, ChildrenSet setof(Children), SkillsSet setof(Skills)) Children = (name,
Birthday)
7
Birthday = (day, month, year)
Skills = (type, ExamsSet setof(Exams)). Exams = (year, city)
(Nov/Dec 16)
8
Explain XML Schema with an example.
Explain various queries in IR Systems with an example.
9

54
10 Explain ODL and OQL with an example.
11
Explain ODMG – Object Model in detail
Explain XML Databases.
12
Exaplain the object relational database features.
13
Explain Information Retrieval process in detail
14
Give the DTD or XML Schema for an XML representation of the nested relational schema .
15

55