Stucor CS3492-DJ

CS3492
DOWNLOADED FROM STUCOR APP

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 C212.1 BTL 2
14. interested in and hides the rest of the database from that user group. Represented
using the representational data model.
List the components of DBMS.

The major components of database management system are:
 Software
 Hardware C212.1 BTL 1
15.
 Data
P
 Procedures
 Database Access Language
AP
 Users
What is relational model.
The relational model represents the database as a collection of relations. A
C212.1 BTL 2
16. relation is nothing but a table 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.
R
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
CO
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. C212.1 BTL 1
17.
U
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.
ST
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 C212.1 BTL1
18.
2. Key constraints
3. Referential integrity constraints
Define domain constraints.
C212.1 BTL2
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.
10

Domain constraints specify that within each tuple, and the value of each attribute
must be unique. This is specified as data types which include standard data types
integers, real numbers, characters, Booleans, variable length strings, etc.
Example:
Create DOMAIN CustomerName
CHECK (value not NULL)
The example shown demonstrates creating a domain constraint such that
CustomerName is not NULL
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.
P
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
AP
CustomerName =" Google". C212.1 BTL2
20.
CustomerID CustomerName Status
1 Google Active
2 Amazon Active
3
R Apple Inactive
Define referential integrity constraints.
CO
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:
U
C212.1 BTL3
ST
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. C212.1 BTL1
22. The operations are, Insert, update, delete and select.
11

 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 C212.1 BTL1
P
23.
 Query capability: It makes possible for a high-level query language like
SQL to avoid complex database navigation.
AP
 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.
R
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
C212.1 BTL1
CO
24. grows, and the relations 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.

C212.1 BTL1
25.  Intermediate language used within DBMS.
U
 Procedural langauge
List the relational algebraic operations.
• Basic operators: select, project, union, set difference, Cartesian product C212.1 BTL1
26. •
ST
Derived operators: set intersection, division, join
Define select operation in relational algebra.

Produce table containing subset of rows of argument table
satisfying condition
C212.1 BTL1
27.
12

Define project operator in relational algebra.

Produces table containing subset of columns of argument table
• Example:
P
AP
C212.1 BTL1
28.
R
CO
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)

U
• R S is expensive to compute:
ST
29. – Factor of two in the size of each row C212.1 BTL1
– Quadratic in the number of row

Example:
13

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
C212.1 BTL1
30. database system. A table has a specified number 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
C212.1 BTL1
31. or as a foreign key. The integer datatype is used for identifiers. In
cases where the number of records exceed the allowed values by
P
the integer datatype then a big integer datatype is used.
Define a primary key.
AP
A column in a table whose values uniquely identify the rows in C212.1 BTL1
32.
the table. A primary key value cannot be NULLto matching
columns in other tables\
What is a Foreign key?
C212.1 BTL1
33. A column in a table that does not uniquely identify rows in that
R
table, 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
CO
C212.1 BTL1
34. the relationship 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
U
C212.1 BTL1
35. sublinear-time. Instead of having to go through all records one by
one to identify those which match its criteria the query uses the
ST
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
C212.1 BTL1
36. database, a view is not part of the physical 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
C212.1 BTL1
37. A query is a request to retrieve data from a database with the
SQL SELECT instruction or to manipulate data stored in tables.
14

Define SQL
Structured Query Language (SQL), pronounced "sequel", is a
language that provides an interface to relational database
C212.1 BTL1
38. systems. It was developed by IBM in the 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 C212.1 BTL1
39.
c) Storing, retrieving and updating data in the database
d) Data dictionary
P
e) Indices
What is Data Dictionary May2003, 2004, Nov 2006& Nov 2007.
AP
Data dictionary : which stores meta data about the structure of the C212.1 BTL1
40.
database, in particular 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 a
R
schema definition in the next higher level called data independence.
C212.1 BTL1
41.
Different levels .
CO
Physical level
Logical level
View level
Define instance and schemas. April/May 2012
- Database change over times as information is inserted and deleted.
C212.1 BTL1
U
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.
ST
What are the types of attributes. April/May 2007

o Simple
o Composite C212.1 BTL1
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 C212.1 BTL1
44.
entity can be associated via a relationship set.
What are the various data base languages in SQL? April/May 2018
C212.1 BTL1
45. Data Definition Language (DDL)
Commands that define a database, including creating, altering, and dropping
15

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
P
AP
List the data types in SQL.
R
CO
C212.1 BTL1
46.
U
ST
What are the function of DBA? April/May 2009

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

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 C212.1 BTL1
49.
semantics and 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
C212.1 BTL1
50. occurrences need to be updated. For example, if customer-1 moves, it
P
needs to change the values of Street, City, State and Zip in multiple
records.
AP
 The third problem occurs when forget to change the values in any of the
records. The database would then have inconsistent data.
What is data definition language?
Data Definition Language:
C212.1 BTL1
51. A data definition language or data description language (DDL) is a syntax
for defining the data structures using imperative verbs, especially database
schemas.
R
What is the syntax for creating a table in SQL?
Syntax:
CREATE TABLE [table name] ( [column definitions] ) [table parameters]
CO
Example:
The command to create a table named employees with a few sample columns
would be:
CREATE TABLE employees ( C212.1 BTL2
52. id INTEGER PRIMARY KEY,
first_name VARCHAR(50) NULL,
U
last_name VARCHAR(75) NOT NULL,

fname VARCHAR(50) NOT NULL,
dateofbirth DATE NULL
ST
);
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.
C212.1 BTL2
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.
C212.1 BTL2
54. An ALTER statement in SQL changes the properties of an object inside of
a relational database management system (RDBMS).
Syntax:
17

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:
C212.1 BTL2
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
C212.1 BTL1
56.
P
manipulate data in a database. This manipulation involves inserting data into
database tables, retrieving existing data, deleting data from existing tables and
modifying existing data.
AP
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]. C212.1 BTL1
57.
R
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)].
CO
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.
U
 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.
ST
58.  MAX returns the largest value in a specified column. C212.1 BTL1
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
C212.1 BTL1
59.  A complete SELECT statement can be embedded
(subselect) within another SELECT statement.
 A subselect can be used in the WHERE and HAVING
18

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.
P
Example:
List the staff who work in the branch at ‗163 Main St‘.
AP
SELECT sno, fname, lname, position FROM staff WHERE bno
= (SELECT bno FROM branch WHERE street = ‗163 Main
St‘);
How to modify a data in a table in SQL?
R
Modifying Data in the DB (UPDATE)
Syntax
UPDATE table_name
CO
SET column_name1 = data_value1 [, column_namei =

data_valuei ...]
[WHERE search_condition]
C212.1 BTL3
60. Description:
 table_name may be either a base table or an updatable
U
view.
 The SET clause specifies the names of one or more
ST
columns 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 the
corresponding columns.
What is DCL? BTL1
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.
C212.1
61. There are two main commands:
GRANT to grant a privilege to a user
REVOKE to revoke (remove) a privilege from a user
19

Define GRANT command in SQL. BTL1

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.
C212.1
62. PUBLIC is used to grant access rights to all users.
ROLES are a set of privileges grouped together.
WITH GRANT OPTION - allows a user to grant access rights to other users.
P
Example: GRANT SELECT ON employee TO user1;
Description:
AP
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:
R
The REVOKE command removes user access rights or privileges to the database
objects.
CO
The Syntax for the REVOKE command is:
REVOKE privilege_name ON object_name FROM {user_name
|PUBLIC |role_name}
C212.1 BTL1
63. Example:
REVOKE SELECT ON employee FROM user1;
Description:
U
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
ST
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.
C212.1 BTL1
64. 1) System privileges - This allows the user to CREATE, ALTER, or DROP
database objects.
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?

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

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.
P
AP
C212.1 BTL1
66.
R
CO
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. C212.1 BTL1
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.
U
ST
C212.1 BTL1
68.
Write the syntax for creating a role.

The Syntax to create a role is:
C212.1 BTL1
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];
21

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:
C212.1 BTL1
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: C212.1 BTL1
71. COMMIT to apply the transaction by saving the database changes.
P
ROLLBACK to undo all changes of a transaction.
SAVEPOINT to divide the transaction into smaller sections. It defines
AP
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.
R
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
CO
C212.1 BTL1
72. dictionary view DBA_2PC_PENDING along with the 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
U
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
ST
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' ]
C212.1 BTL1
73. Description:
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

22

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
C212.1 BTL1
74. parsed by an embedded SQL preprocessor and replaced 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
P
Static SQL
The source form of a static SQL statement is embedded within an application
program written in a host language such as COBOL.
AP
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
C212.1 BTL1
75. the SQL statement coprocessor.
R
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.
CO
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?

U
Dynamic SQL:
Programs that contain embedded dynamic SQL statements must be
precompiled like those that contain static SQL, but unlike static
C212.1 BTL1
76. SQL, the dynamic statements are constructed and prepared at run
ST
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.
PART-B
Q. No. Questions CO Bloom’s

Level
23

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

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

ST
UNIT II
Entity-Relationship model – E-R Di gr ms – Enh nced-ER Model – ER-to-Relational Mapping –
Functional Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms,

Dependency Preservation – Boyce/Codd Norm l Form – Multi-valued Dependencies and Fourth
Normal Form – Join De endencies and Fifth Normal Form
Bloo
Q. m’s
Questions CO
No. Leve
l
24

What is an entity relationship model? May/ June 2016 C212.2

The entity relationship model is a collection of basic objects called entities
1. BTL1
and relationship 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 C212.2
Weak entity set: entity set that do not have key attribute of their own are
2. called weak entity sets. BTL1
Strong entity set: Entity set that has a primary key is termed a strong entity
set.
Give the limitations of ER model? How do you overcome this? May/
June 2007
3. The entity relationship model is a collection of basic objects called entities C212.2 BTL1
P
and relationship among those objects. An entity is a thing or object in the
real world that is distinguishable from other objects.
Define Specialization and Aggregation. C212.2
AP
It is the process of designating sub groupings within an entity set.It is a top
down process.
4. Specialization which is represented by triangle. The lable ISA stands for “is BTL1
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.
R
What are three characteristics of a relational database system?Nov/Dec C212.2
2008
5.o Controlling redundancy BTL1
CO
o Restricting unauthorized access
o Providing multiple user interfaces
Give the distinction between primary key, candidate key and super key. C212.2
Nov/Dec
2006,2009
o Primary key – is used in a data base to avoid duplication of attributes and
U
6. also makes a relation to the other database. BTL1

o Candidate key - a key which is in the data base is called as candidate key, it
might be any key attribute.
ST
o Super key – collection of keys of a database is called as super key
Define functional dependency. Nov/Dec2010, Apr/ May 2015 C212.2

o A functional dependency is a constraint between two sets of attributes from
the data base. A functional dependency , denoted by
X Y
o Between two sets of attributes X and Y that are subsets of R specifies a
7. BTL1
constraint on the possible tuples that can form a relation instance r of R.
o 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.
25

Define an entity? C212.2

Entities:
Entity -a thing (animate or inanimate) of independent physical or
8. conceptual existence and distinguishable. BTL1
Example:
In the University database context, an individual student, faculty
member, a class room, a course are entities.
What is an entity set? C212.2
Entity Set or Entity Type-Collection of entities all having the same
properties.
9. BTL2
Example:
Student entity set –collection of all student entities.
Course entity set –collection of all course entities.
P
What is an attribute? C212.2
Attributes:
AP
Attributes - Each entity is described by a set of
attributes/properties.studententity
10. Example: BTL2
StudName–name of the student.
RollNumber–the roll number of the student.
Sex–the gender of the student etc.
R
All entities in an Entity set/type have the same set of attributes.
What is derived attributes? C212.2
Derived attributes are those created by a formula or by a summary operation
CO
11. BTL2
on other attributes
What is a recursive relationship? C212.2

Recursive relationships A recursive relationship is an entity is associated
with itself.
Example:
U
An employee may manage many employees and each employee is managed

by one employee.
ST
12. BTL2
Define cardinality? C212.2

13. Cardinality BTL1
A business rule indicating the number of times a particular object or
26

activity may occur.
List the properties of a relation? C212.2

1. All entries in a given column are of the same kind or type
2. The ordering of columns is immaterial.
14. BTL1
3. No two tuples are exactly the same.
4. There is only one value for each attribute of a tuple.
5. The ordering of tuples is immaterial.
Define a key? C212.2
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.
P
15. First, keys will typically be used as links, ie. key values will appear in other BTL2
relations to represent their associated tuples
Second, keys form the basis for constructing indexes to speed up retrieval
AP
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? C212.2
A Relational Database Schema comprises
1. the definition of all domains
16. BTL1
2. the definition of all relations, specifying for each
a)
R
its intension (all attribute names), and
b) a primary key
List the uses of functional dependencies? C212.2
CO
We use functional dependencies to:
 test relations to see if they are legal under a given set of functional
dependencies.

17. If a relation r is legal under a set F of functional dependencies, we say BTL1
that r satisfies F.

U
specify constraints on the set of legal relations

 We say that F holds on R if all legal relations on R satisfy the set of
functional dependencies F.
ST
Define normalization. Nov/Dec2009.April/May2010 C212.2

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

What is normalization? C212.2
P
Database normalization is the process of removing redundant data from
the tables in to improve storage efficiency, data integrity, and scalability.
AP
In the relational model, methods exist for quantifying how efficient a
20. database is. These classifications are called normal forms (or NF), and BTL1
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.
R
Define data Anomalies. C212.2
Data Anomalies
Data anomalies are inconsistencies in the data stored in a database as a
21. BTL1
CO
result of an operation such as update, insertion, and/or deletion. Such
inconsistencies may arise when have a particular record stored in multiple
locations and not all of the copies are updated.
Define 1NF. C212.2
o Each table has a primary key: minimal set of attributes which can uniquely
identify a record
U
22. BTL1
o The values in each column of a table are atomic (No multi-value attributes
allowed). There are no repeating groups: two columns do not store similar
information in the same table
ST
Define 2NF. C212.2

 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
23. BTL1
attributes create a new form. Move the dependant attributes to the new
form.
 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. C212.2
A relation R is in Third Normal Form (3NF) if and only if it is:
24. BTL1
 in Second Normal Form.
 Every non-key attribute is non-transitively dependent on the primary key.
28

Define BCNF C212.2

Boyce-Codd Normal Form:
• A relation is in Boyce-Codd normal form (BCNF) if for every FD A B
either
o B is contained in A (the FD is trivial), or
25. BTL1
o A contains a candidate key of the relation,
• 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 2017 C212.2
Decomposition Properties
• Lossless: Data should not be lost or created when splitting relations up
P
• Dependency preservation: It is desirable that FDs are preserved when
26. BTL1
splitting relations up
AP
• Normalisation to 3NF is always lossless and dependency preserving
• Normalisation to BCNF is lossless, but may not preserve all dependencies
Define MVD. C212.2
A multivalued dependency is a full constraint between two sets of attributes
in a relation.
27. In contrast to the functional independency, the multivalued dependency BTL1
R
requires that certain tuples 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.
CO
Define 4NF. C212.2
4th Normal Form
A Boyce Codd normal form relation is in fourth normal form if
 there is no multi value dependency in the relation or
 there are multi value dependency but the attributes, which are multi value
U
dependent on a specific attribute, are dependent between themselves.

28. BTL1
Assume the following relation
ST
R(a:pk1, b:pk2, c:pk3)
Ø Recall that a relation is in BCNF if all its determinant are candidate keys, in
other words each determinant can be used as a primary key.
Ø Because relation R has only one determinant (a, b, c), which is the
composite 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 the C212.2 BTL1
candidate keys of R
 5NF is always achievable.
29

 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?
P
AP
30. C212.2 BTL2
R
CO
List the properties of a database relation.

Properties of database relations are:
• relation name is distinct from all other relations
U
• each cell of relation contains exactly one atomic (single) value

31. • each attribute has a distinct name C212.2 BTL1
• values of an attribute are all from the same domain
ST
• 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 C212.2 BTL1
– Semantic model
– Functional model
List the various Record-based logical models
– Relational model (e.g., SQL/DS, DB2)
33. C212.2 BTL1
– Network model
– Hierarchical model (e.g., IMS)
30

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. C212.2 BTL1
P
What is candidate Keys?
AP
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
35. C212.2 BTL1
and have unique records is a candidate 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.
R
Unique attribute of a table will be considered as a primary key. Primary C212.2 BTL1
keys are used to identify tables. There is only one primary key per table.
What is Foreign Key? April/May 2018
CO
Foreign key are those keys which is used to define relationship between two
tables. When we want to implement relationship between two tables then we
use concept of foreign key. It is also known as referential integrity. We can
37. create more than one foreign key per table. foreign key is generally a C212.2 BTL1
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
U
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.
ST
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
38. alternate key of that table. Suppose we have a table named Employee which C212.2 BTL1
has two columns EmpID and EmpMail, both have not null attributes and
unique value. If EmpID is considered as a primary key to that table then
EmpMail is known as alternate key.
Define Composite Key
When a key is created on more than one column then that key is known as
39. composite key. Consider a table "Student" which has two columns Sid and C212.2 BTL1
SrefNo and these two columns are used as a primary key for record
extraction, then this key is known as composite key.
31

Distinguish between key and super key? April/May 2017
40. C212.2
List the similarities between primary and candidate keys.

 Both Primary and Candidate keys can uniquely identify records in a table on
the database.

41. Both Primary and Candidate keys have constraints UNIQUE and NOT C212.2 BTL1
NULL.
P
 Primary key or Candidate keys can be either single column or combination
of multiple columns in a table.
What are the characteristics of primary key?
AP
Primary key is a special kind of index in that,
42.  there can be only one; C212.2 BTL1
 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 identify C212.2 BTL1
rows in a table.
R
What is need for normalization. Nov/Dec 2010
To ensure that the update anomalies do not occur.
CO
Normal forms provide a formal frame work for analyzing relation shemas
based on their keys and on the functional dependencies among their
44. attributes. C212.2 BTL1
A series of tests that can be carried out on individual relation schemas so
that the relation database can be normalized to any degree. When a test fails
U
, 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
ST
Lossless join property or non additive property ensures that no

45. spurious tuples(tuples C212.2 BTL1
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
46. relation in BCNF is also in 3NF; however a relation in 3NF is not C212.2 BTL1
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. C212.2 BTL1
o Repetition of informaition
32

o Inability to represent certain information

o Loss of information
State the anomalies of 1NF. Nov/ Dec 2015.
o
48. No repeating groups C212.2 BTL1
o Redundancy of data
Explain the desirable properties of decomposition.
Lossless-join decomposition
49. C212.2 BTL1
Dependency preservation
Repetition of information
Outline the steps involved in query processing. April/May 2018.
1. Parsing and translation
50. C212.2 BTL1
2. Optimization
P
3. Evaluation
Explain trivial dependency? Nov/Dec 2009, 2010
51. Functional dependency of the form α ->β. is trivial if α C β. Trivial C212.2 BTL1
AP
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,
52. C212.2 BTL1
R
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 to keep the relation instances consistent. A multivalued
CO
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/may2011
3NF design is always dependency preserving and lossless.
53. dependency preserving is difficult to achieve in BCNF sometimes. C212.2 BTL1
BCNF strictly removes transitive dependency.
U
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)
ST
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
54. the normalization sometime, it is not possible to get a BCNF decomposition C212.2 BTL1
that is dependency, preserving. While 4NF has very similar definition as
BCNF. A relational Schema is 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.
33

PART-B
BLO
Q. OM’S
QUESTIONS CO
NO. LEVE
L
Explain The Different Types Of Normalization Nov/Dec 2009, 2010,
BTL5
1 2011, Nov/ Dec 2014, Apr/May 2015, Nov/Dec 2016 C212.2
Refer the Elmasri Navathe page no. 517
Explain In Detail About Boyce Codd Normal Form And Non Lossless
BTL5
2 Join Dependency. Nov/Dec 2009, 2010, 2011 C212.2
P
Give Detail explanation about Data Model & its types. May/ June 2009,
Nov/ Dec 2014 BTL5
3 C212.2
AP
Explain the various components of ER diagram with examples Briefly. BTL5
4 C212.2
Draw ER Diagram for Difference applications ( Eg. Banking Systems .
Nov/ Dec 2014, Nov/Dec 2017, Restaurant menu ordering system Apr/
BTL5
5 May 2015, Car Rental company Nov/ Dec 2015), Car Insurance C212.2
R
Company (Nov/Dec 2016)
Discuss the correspondence between the ER model construct and the

CO
relational model constructs. Show how each ER model construct can be BTL5
6 C212.2
mapped to the relational model. Discuss the option for mapping EER
model construct. April/May 2017
Various join strategies with Example. Nov/Dec 2016
i. Nested loop join
C213.2 BTL6
7ii. Block nested loop join
U
iii. Merge join

iv. Hash join
Differentiate between foreign key constraints and referential integrity C213.2 BTL5
ST
8
constraints with suitable example. Nov/Dec 2017
Distinguish between lossless-join decomposition and dependency C213.2 BTL5
9
preserving decomposition. Nov/Dec 2017.
C213.2 BTL1
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, C213.2 BTL1
11
Nov/Dec 2017.
Elmasri Navathe page no.679
C213.2 BTL5
12
34

A car rental company maintains a database for all vehicles in its current fleet. For all
vehicles, it includes the vehicle identification number, license number, manufacturer, model,
date of purchase, and color. Special data are included for certain types of vehicles.
• Trucks: cargo capacity.
• Sports cars: horsepower, renter age requirement.
• Vans: number of passengers.
• Off-road vehicles: ground clearance, drivetrain (four- or two-wheel drive).
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 own one or more
cars each. Each car has associated with it zero to any number of recorded accidents.
C213.2 EachBTL5
13
insurance policy covers one or more cars, and has one or more premium payments
P
associated with it. Each payment is for a particular period of time set of customers, and the
date when the payment was received. (Nov/Dec 16)
AP
For the ER diagram given below explain ER to Relational mapping
procedures
C213.2 BTL1
14
R
CO
Draw E – R Diagram for the “Restaurant Menu Ordering System”, which will facilitate the
food items ordering and services within a restaurant. The entire restaurant scenario is
detailed as follows. The Customer is able to view the food items menu, call the waiter, place
U
orders and obtain the final bill through the computer kept in their table. The waiters through
their wireless tablet PC are able to initialize a table for customers, control the table functions
C213.2 BTL1
15 to assist customers, orders, send orders to food preparation staff (chef) and finalize the
ST
customer’s bill. The food preparation staffs (Chefs), with their touch-display interface to the
system, are able to view orders sent to the kitchen by waiters. During preparation, they are
able to let the waiter know the status of each item, and can send notification when items are
completed. The system should have full accountability and logging facilities, and should
support supervisor actions to account for exceptional circumstances, such as a meal being
refunded or walked out on. (Apr/May 17)
35

UNIT III
TRANSACTIONS
Transaction Concepts – ACID Properties – Schedules – Serializability – Concurrency Control –

Need for Concurrency – Locking Protocols – Two Phase Locking – Deadlock – Transaction
Recovery - Save Points – Isolation Levels – SQL Facilities for Concurrency and Recovery
Bloom’
Q. No. Questions CO
s Level
What is transaction?Nov/Dec 2010 Nov/Dec 2014
P
1 Collections of operations that form a single logical unit of work are C212.3 BTL1
called transactions.
AP
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:
2 C212.3 BTL1
Atomicity
Consistency
Isolation
R
Durability
Define lock? Nov2009, Nov2010, Nov2011
CO
Lock is the most common used to implement the requirement is to allow a
3 C212.3 BTL1
transaction to access 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:
4- Shared /Read C212.3 BTL1
U
- Exclusive /Write
Define deadlock? April 2009,April 2010, April2011

ST
5 Neither of the transaction can ever proceed with its normal execution. This C212.3 BTL1
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.
6 C212.3 BTL1
Shrinking phase: a transaction may 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 database
7 modifications is the log. C212.3 BTL1
The log is a sequence of log records, recording all the update activities in
the database. There are several types of log records.
8 Define shadow paging. Nov/Dec 2009 C212.3 BTL1
36

a. An alternative to log-based crash recovery technique is shadow paging. This

b. technique needs fewer disk accesses than do the log-based methods.
When is a transaction rolled back?
c. Any changes that the aborted transaction made to the database must be
9 undone. C212.3 BTL1
d. Once the changes caused by an aborted transaction have been undone, then
the transaction has been rolled back.
What is a recovery scheme? April/May 2009
10e. An integral part of a database system is a recovery scheme that can restore C212.3 BTL1
the database to the consistent state that existed before the failure.
What are two pitfalls (problem) of lock-based protocols? APRIL/MAY-
2011
C212.3 BTL2
P
11 Deadlock
Starvation
What are the two statements regarding transaction?
AP
12 The two statements regarding transaction of the form:  Begin transaction C212.3 BTL1
 End transaction
What is recovery management component?
13 Ensuring durability is the responsibility of a software component of the base C212.3 BTL1
system called the recovery management component.
When is a transaction rolled back?
R
Any changes that the aborted transaction made to the database must be
14 C212.3 BTL3
undone. Once the changes caused by an aborted transaction have been
undone, then the transaction has been rolled back.
CO
What is a shadow copy scheme?

It is simple, but efficient, scheme called the shadow copy schemes. It is
15 based on making copies of the database called shadow copies that one C212.3 BTL1
transaction is active at a time. The scheme also assumes that the database is
simply a file on disk.
U
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
16 C212.3 BTL1
ST
complete, which can lead to unpredictable delays 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 C212.3 BTL1
completed after it has been submitted.
What is serializability? Explain its types? NOV/DEC 2014, Nov/Dec
2016, April/May 2018
A (possibly concurrent) schedule is serializable if it is equivalent to a serial
18 schedule. Different forms of schedule equivalence give rise to the notions C212.3 BTL2
of:
 conflict serializability
 view serializability
37

Define upgrade and downgrade?

It provides a mechanism for conversion from shared lock to exclusive lock
19 C212.3 BTL1
is known as upgrade. 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 directed C212.3 BTL1
acyclic graph, called a database graph.
What are the two methods for dealing deadlock problem?
The two methods for dealing deadlock problem is
21 C212.3 BTL1
- deadlock detection
- deadlock recovery.
What is a recovery scheme?
P
22 An integral part of a database system is a recovery scheme that can restore C212.3 BTL1
the database to the consistent state that existed before the failure.
Define garbage collection. May/June 2016
AP
Garbage may be created also as a side effect of crashes. Periodically, it is
23 C212.3 BTL1
necessary to find all 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
24 C212.3 BTL1
R
transaction is held until that transaction commits. Rigorous two phase
locking protocol requires that all locks be held until the transaction
commits.
CO
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
25 C212.3 BTL1
system. • Use a logical counter that is incremented after a new timestamp
has been assigned; that is the time stamp is equal to the value of the counter.
U
What are the time stamps associated with each data item?
W-timestamp (Q) denotes the largest time stamp if any transaction that
26 C212.3 BTL1
executed WRITE (Q) successfully. • R-timestamp (Q) denotes the largest
ST
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 is
partitioned into fixedlength storage units called blocks.
Physical blocks
27 The input and output operations are done in block units. The blocks residing C212.3 BTL1
on 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 C212.3 BTL1
Process of managing simultaneous operations on the database without
38

having them interfere with one another.

Prevents interference when two or more users are accessing database
simultaneously 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
29 atomic step. The transaction is committed as soon as this information is C212.3 BTL2
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.
P
List the four conditions for deadlock. Nov/Dec 2016
1. mutual exclusion: at least one process must be held in a non-
sharable mode.
AP
2. hold and wait: there must be a process holding one resource and
30 waiting for another. C212.3 BTL1
3. No preemption: resources cannot be preempted.
4. circular wait: there must exist a set of processes
[p1, p2, ..., pn] such that p1 is waiting for p2, p2 for p3, and
so on upto pn.
R
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
CO
31 C212.3 BTL1
transactions, before continuing to process further 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
U
We should allow several transactions to access the same item A if they all
32 C212.3 BTL1
access A' for reading purposes only. However, if a transaction is to write an
item A, it must have exclusive access to A. For this purpose, a different type
ST
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) is
performed.
33 C212.3 BTL1
Multiple shared locks can be simultaneously set on a resource.
Exclusive lock:
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.
39

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 exclusive
lock 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 C212.3 BTL1
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 C212.3 BTL1
iii. Computation cost
iv. Memory usage cost and
v. Communication cost
P
Define atomicity?
36 Either all operations of the transaction are refl ected properly in the database C212.3 BTL1
or none are.
AP
Define Durability?
37 A transaction completes successfully then changes It has made to the C212.3 BTL1
database persist even if there are system failure.
What is transaction-management component?
Ensuring atomicity is the responsibility of the database system itself
38 C212.3 BTL1
specifically, it is handled by a component called the transaction-
R
management component.
What are the two operation for accessing data in transaction?
39 Read(x)- transfer data item x from database. C212.3 BTL1
CO
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 only C212.3 BTL1
retrieve data, the transaction is called a read-only transaction.
What are the steps followed in Executing read(x)command in
U
transaction?
41 1. Find the address of the disk block that contains item x. C212.3 BTL1
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.
ST
What are the steps followed in executing write(x) command in

transaction?
1. find the address of disk block that contain item x.
42 2. Copy that disk block into buffer in main memory. C212.3 BTL1
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 C212.3 BTL1
i) active ii) Partially Committed iii) Failed iv) Abort v) committed.
What are the need for concurrency?
44 i) Improved throughput and resource utilization C212.3 BTL1
ii) Reduced waiting time.
40

Define Schedule.
45 C212.3 BTL1
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
46 C212.3 BTL1
transaction where the 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 C212.3 BTL1
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 item C212.3 BTL1
P
from 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
AP
49 C212.3 BTL1
transaction in the schedule reads only items that were written by committed
transactions.
Define lock table?
50 System maintain record for the items that are currently locked in lock table C212.3 BTL1
that which could be organized as a hash file.
What you mean by lock conversion?
51
R
A transaction that already holds a lock on item xis allowed under certain C212.3
condition to voncery the Locke from one locked state to another.
CO
PART-B
BLOO
M’S
Q. NO. QUESTIONS CO
U
LEVE
L
ST
Describe Log Based Recovery May/june 2008 BTL4

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

Refer the Elmasri Navathe page no 584

Explain about locking protocols. May/June 2016 Refer the Elmasri BTL2
6 C212.3
Navathe page no 584
Discuss about conflict and view serializability. April/ May 2015. Nov/
BTL5
7 Dec 2015 C212.3
Explain Deadlock in detail with an example. . Nov/Dec 2014 , Nov/ Dec
BTL2
8 2015, Nov/Dec 2017 C212.3
Briefly describe two phase locking in concurrency control techniques.
BTL1
9 (Nov/Dec 2014) C212.3
P
Explain the concepts of concurrent execution in Transaction
BTL2
10 processing system. (Nov/Dec 2014) C212.3
AP
Give detail explanation about ACID Properties Nov/Dec 2009,April
BTL4
11 2011 C212.3
State and explain the lock based concurrency control with suitable BTL4
12 C212.3
examples? Nov/Dec 2017
Discuss the violations caused by each of the following: dirty read, non- BTL5
13
R
repeatable read and phantoms with suitable example. April/May 2017.
C212.3
Explain why timestamp-based concurrency control allows schedules
BTL1
14 that are not recoverable. Describe how it can be modified through C212.3
CO
buffering to disallow such schedules. April/May 2017.
How can you implement atomicity in transactions? Explain. BTL6
15 C212.3
UNIT IV
U
IMPLEMENTATION TECHNIQUES
RAID – File Organization – Organization of Records in Files – Indexing and Hashing –Ordered
Indices – B+ tree Index Files – B tree Index Files – Static Hashing – Dynamic Hashing – Query
ST
Processing Overview – Algorithms for SELECT and JOIN operations – Query optimization
using Heuristics and Cost Estimation
PART – A
Question Bloom’s
Q. No. CO Level
What is B-Tree? C213.4 BTL1

1
A B-tree eliminates the redundant storage of search-key values.
It allows search key values to appear only once.
42

What is a B+-Tree index?

C213.4 BTL4
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 the
tree is of the same length
What is a hash index? C213.4 BTL1

3
A hash index organizes the search keys, with their associated
pointers, into a hash file structure
Define seek time. C213.4 BTL1

4
P
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.
AP
Define rotational latency time. C213.4 BTL1
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? C213.4 BTL1

6
The simplest approach to introducing redundancy is to duplicate
R
every disk. This technique is called mirroring or shadowing.
What are the two main goals of parallelism?

CO
Load –balance multiple small accesses, so that the throughput of
C213.4 BTL1
7 such accesses increases.
Parallelize large accesses so that the response time of large
accesses is reduced
U
What is an index? C213.4 BTL1

8
An index is a structure that helps to locate desired records of a
relation quickly, without examining all records
ST
What are the factors to be taken into account when choosing a

RAID level?
Monetary cost of extra disk storage requirements. C213.4 BTL1
9
Performance requirements in terms of number of I/O operations
Performance when a disk has failed and Performances during
rebuild.
What are the types of storage devices? C213.4 BTL1

10
Primary storage, Secondary storage, Tertiary storage, Volatile
storage, Nonvolatile storage
C213.4 BTL1
43

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, C213.4 BTL1
12
using only software modification. Such RAID implementations are
called 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 C213.4 BTL1
13
new ones without turning power off. Hot swapping reduces the mean
P
time to repair.
AP
What are the ways in which the variable-length records arise in
database systems? C213.4 BTL1
14
Storage of multiple record types in a file, Record types that allow
variable lengths for one or more fields, Record types that allow
repeating fields.
What are the two types of blocks in the fixed –length

R
representation? Define them.
C213.4 BTL1
CO
15
Anchor block: Contains the first record of a chain.
Overflow block: Contains the records other than those that are the
first record of a chain.
U
What is hashing file organization?

C213.4 BTL2
16 In the hashing file organization, a hash function is computed on
some attribute of each record. The result of the hash function
ST
specifies in which block of the file the record should be placed.
What are called index-sequential files? C213.4 BTL2

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 C213.4 BTL1
18
index. The search key of a primary index is usually 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.
44

Give an example of a join that is not a simple equi-join for which

partitioned parallelism can be used. (Nov/Dec 15) C213.4 BTL2
19
Differentiate static and dynamic hashing. (Apr/May 15) (Nov/Dec

14,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. C213.4 BTL1
P
20
The number of buckets Dynamic hashing provides a
provided remains unchanged mechanism in which data buckets
AP
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 file
decreases grows
R
List out the mechanisms to avoid collision during
hashing.(Nov/Dec 16)
In overflow chaining, the overflow buckets of a given bucket are
CO
C213.4 BTL1
21 chained together in a linked list.
Above scheme is called closed hashing. An alternative, called
open hashing, which does not use overflow buckets, is not suitable
for database applications.
U
What are the disadvantages of B-Tree over B+ Tree? (Nov/Dec

16)
Only small fraction of all search-key values are found early
ST
Non-leaf nodes are larger. Thus, B-Trees typically have greater C213.4 BTL1
22
depth than corresponding B +-Tree
Insertion and deletion more complicated than in B +-Trees
Implementation is harder than B+-Trees.
What is called query processing? C213.4 BTL1

23
Query processing refers to the range of activities involved in
extracting data from a database.
C213.4 BTL1
24 What is called a query evaluation plan?
A sequence of primitive operations that can be used to evaluate be
45

query is a query evaluation plan or a query execution plan.
Explain “Query optimization”?(May/June 16) C213.4 BTL1

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) C213.4 BTL1
26
The query optimizer attempts to determine the most efficient way to
execute 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
C213.4 BTL1
27 software modification. Such RAID implementations are called software RAID
P
systems and the systems with special hardware support are called hardware RAID
systems.
What is the use of RAID? April/May2009, Nov/Dec2010
AP
A variety of disk-organization techniques, collectively called redundant
C213.4 BTL1
28 arrays of independent 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
29
R
where there is space for the record. There is no ordering of records. There C213.4 BTL1
is a single file for each relation.
CO
What is known as sequential file organization? April/May2009

In the sequential file organization, the records are stored in sequential
C213.4 BTL2
30 order, according to the value of a “search key” of each record.
U
What are the types of indices?

Ordered indices
C213.4 BTL1
31 Hash indices
ST
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 C213.4 BTL1
32 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 (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
46

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 C213.4 BTL1
33
storage Access to data is much slower Access to data is faster Cheaper than disk
Expensive when compared with disk
Explain how reliability can be improved through redundancy?

The simplest approach to introducing redundancy is to duplicate every disk. This
P
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 C213.4 BTL1
34
AP
data can be read from the other. Data will be lost if the second disk 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
R
design of the database files, selection of the database management system
(DBMS), operating system and CPU the DBMS runs on. C213.4 BTL1
35
CO
What are a block and a block number?

A block is a contiguous sequence of sectors from a single track of one
U
platter. Each request specifies the address on the disk to be referenced.

That address is in the form of a block number. C213.4 BTL1
36
ST
What are the benefits of RAID

Data loss can be very dangerous for an organization
C213.4 BTL1
37 RAID technology 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

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

– 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 C213.4 BTL1
39 To find value of a damaged block, compute XOR of bits from corresponding
blocks (including parity block) from other disks
P
What are the Types of Ordered Indices
Dense index C213.4 BTL1
40
AP
Sparse index
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. BTL1
– outer index – a sparse index of primary index C213.4
41
R
– 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
CO
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 BTL1
indices imposes overhead on database modification. C213.4
42
U
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
ST
Draw the structure of B+-Tree Node .

Typical node
BTL1
– Ki are the search-key values
– Pi are pointers to children (for non-leaf nodes) or pointers to records or buckets of
C213.4
43
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 BTL1
An RDBMS must include one or more alternative algorithms that implement C213.4
44 each relational algebra operation (SELECT, JOIN,…) and, in many cases, that
implement each combination of these operations.
48

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:

BTL1
– Hash performance does not degrade with growth of file
C213.4
45 – Minimal space overhead
Disadvantages of extendable hashing
– Extra level of indirection to find desired record
P
Bucket address table may itself become very big.
What are the Cost functions for SELECT Operation
AP
Linear Search:
– [nBlocks(R)/2], if the record is found. BTL1
– [nBlocks(R)], if no record satisfied the condition. C213.4
46
Binary Search :
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.
R
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 BTL1
CO
operation is required to develop reasonably accurate cost functions for JOIN C213.4
47 operations.
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 BTL1

U
The main aim of query optimization is to choose the most efficient way of C213.4
48 implementing the relational algebra operations at the lowest possible cost.
ST
What is External Sorting ? BTL1

It refers to sorting algorithms that are suitable for large files of records on disk that C213.4
49 do not fit entirely in main memory, such as most database files..
What are Cost Components of Query Execution ?

The cost of executing the query includes the following components:
BTL1
– Access cost to secondary storage.
– Storage cost.
C213.4
50
– Computation cost.
– Memory uses cost.
– Communication cost.
PART – B
49

BLOOM’S
Q. NO. QUESTIONS CO
LEVEL
C213.4 BTL5
1 Describe File Organization.
April/May2009, 2011
C213.4 BTL5
2 Define RAID and Briefly Explain RAID
techniques.(Nov/Dec 14, 15, 16) (Apr/May 15,16)
C213.4 BTL2
3
Explain Secondary storage devices.
C213.4 BTL5
4 Explain about static and dynamic hashing with an
P
example
C213.4 BTL3
5 Explain about Multidimensional and parallel with an
AP
example
C213.4 BTL5
6
Explain about ordered indices with an example
C213.4 BTL5
7 Explain about B+ trees indexing concepts with an
example (Nov/Dec 14)(May/June 16)
R
Explain about B trees indexing concepts with an C213.4 BTL5
8
example (Nov/Dec 14)
CO
Illustrate indexing and hashing techniques with C213.4 BTL1

9
suitable examples. (Nov/Dec 15)
Explain about Query optimization with neat C213.4 BTL1

10
U
Diagram. (Nov/Dec 14,16)
Give a detailed description about Query processing

ST
and Optimization.Explain the cost estimation of C213.4 BTL1

11
Query Optimization (Nov/Dec 14). , Nov/ Dec 2016
Discuss about join order optimization and heuristic C213.4 BTL1

12 optimization algorithm. (Apr/May 15)
Briefly explain about Query Processing C213.4 BTL2

13
review(May/June 16)
50

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

C213.4 BTL1
14
Give detail Explanation about Hashing & Types of Hashing. Nov/Dec 2015
C213.4 BTL1
15
UNIT V
ADVANCED TOPICS
Distributed Databases: Architecture, Data Storage, Transaction Processing – Object-based Databases:
Object Database Concepts, Object-Relational features, ODMG Object Model, ODL, OQL – XML
P
Databases: XML Hierarchical Model, DTD, XML Schema, XQuery – Information Retrieval: IR
Concepts, Retrieval Models, Queries in IR systems.
AP
Bloo
Q. m’s
Questions CO
No. Leve
l
What is homogeneous distributed database and heterogeneous

distributed database
R
A homogeneous distributed database has identical software and
C213.5 BTL1
1 hardware running all databases instances, and may appear through a
single interface as if it were a single database. A heterogeneous
CO
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)

C213.5 BTL1
U
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
ST
What are the types of Distributed Database

C213.5 BTL2
3
Homogeneous Distributed DB
Hetrogneous Distributed DB
Define fragmentation in Distributed Database

The system partitions the relation into several fragment and stores C213.5 BTL4
4
each fragment at different sites
Two approaches : Horizontal Fragmentation, Vertical Fragmentation
C213.5 BTL2
5
51

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? C213.5 BTL2

6
An integrated repository of information that is shared by multiple
users, multiple products, multiple applications on multiple platforms.
What is Object database System?
P
An object database is a database management system in which C213.5 BTL1
7
information is represented in the form of objects as used in object-
AP
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
R
world and the Conceptual model is very similar. 2. Impedance
C213.5 BTL1
8 mismatch: Programming languages and database systems must be
interfaced to solve application problems. But the language style, data
CO
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.
U
How do you define types in object relational feature in oracle?

C213.5 BTL1
9 Oracle allows us to define types similar to the types of SQL. The
syntax is
ST
CREATE TYPE t AS OBJECT ( list of attributes and methods );
Define ODMG Object model?

C213.5 BTL1
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:
C213.5 BTL1
classes and interfaces
11
- Using the specific langauge bindings to specify how ODL
constructs can be mapped to constructs in specific programming
language, such as C++, SMALLTALK, and JAVA
52

Define Information Retrieval. C213.5 BTL1

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) C213.5 BTL1

13
A system in which the search engine tries to determine the theme of a
site that a link is coming from.
P
Can we have more than one constructor in a class? If yes, explain C213.5 BTL1
14
the need for such a situation. (Nov/Dec 15)
Yes, default constructor and constructor with parameter
AP
Define XML Database.
An XML database is a data persistence software system that allows C213.5 BTL4
15 data to be stored in XML format. These data can then be queried,
exported and serialized into the desired format. XML databases are
usually associated with document-oriented databases.
R
Define OQL with syntax.
Entry point to the database: needed for each query which can
be any named persistent object:
CO
class Person
( extent persons
key ssn) C213.5 BTL1
16
{ ... ... }
class Faculty extends Person ENTRY POINTS
U
( extent faculy )
{ ... ... }
class Department
( extent departmet key dname){ ... ... }
ST
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 C213.5 BTL1
17
that information to the search engine’s server for indexing. Then they
follow all the 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.
53

How does the concept of an object in the object-oriented model

differ 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 C213.5 BTL1
18
an encapsulation of data as well as the methods (code) to operate on
the data. The data members of an object are 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 be
P
C213.5 BTL1
19 interpreted as a tree structure, called an XML tree. XML documents
must contain a root element (one that is the parent of all other
AP
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
C213.5 BTL1
20 used to validate an XML file. After you have created a DTD, you can
edit it manually, adding declarations that define elements, attributes,
R
entities, and notations, and how they can be used for any XML files
that reference the DTD file.
CO
What is the use of XML Schema?
XML Schema is commonly known as XML Schema Definition C213.5 BTL4
21
(XSD). It is used to describe and validate the structure and the content
of XML data. XML schema defines the elements, attributes and data
types. Schema element supports Namespaces.
U
What is Xpath and Xquery?

XPath can be used to navigate through elements and attributes in an
C213.5 BTL2
22 XML document. XPath is a syntax for defining parts of an XML
ST
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.

C213.5 BTL1
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

C213.5 BTL1
24 Keyword Queries. Boolean Queries
Phrase Queries
Proximity Queries
54

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 C213.5 BTL1
25
MyDTD.dtd. The name of your DTD file must end with the extension
.dtd
P
5. Click Next.
6. Optional: You can use a DTD template as the basis for your new
AP
DTD 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

R
Keyword search SQL 3 Unstructured data format Structured data 4 Reads mostly. C213.5 BTL1
26
Adds document occasionally. Expects reasonable number of updates. 5 Displays
CO
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
U
stops working for some time another system can complete the task. C213.5 BTL2
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
ST
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.
C213.5 BTL1
28 Autonomy − It indicates the distribution of 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 – C213.5 BTL2
29 Client - Server Architecture for DDBMS
Peer - to - Peer Architecture for DDBMS
55

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 C213.5 BTL2
30 checking and transaction management.
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
P
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.
C213.5 BTL2
AP
31 This architecture generally has four levels of schemas −
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
R
autonomous database systems.
Multi-DBMS can be expressed through six levels of schemas −
Multi-database View Level − Depicts multiple user views comprising of subsets
CO
of the integrated distributed database.
Multi-database Conceptual Level − Depicts integrated multi-database that
comprises of global logical multi-database structure definitions.
Multi-database Internal Level − Depicts the data distribution across different C213.5 BTL1
32
sites and multi-database to local data mapping.
Local database View Level − Depicts public view of local data.
U
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.
ST
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 C213.5 BTL1
33 one copy of relation r.
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
C213.5 BTL1
34 found in another site. 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
56

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 C213.5 BTL1
35 data are physically located nor how the data can be accessed at the specific local
site. This characteristic, called data transparency, can take several forms:
P
What are the DISTRIBUTED TRANSACTIONS
There are two types of transaction that we need to consider.
AP
Local transactions are those that access and update data in only one local
database; C213.5 BTL1
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.
R C213.5 BTL1
37 Failure of a communication link.
Network partition
CO
Define Complex Data Types .,

C213.5 BTL1
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 C213.5 BTL1
39
U
directly. For instance, we 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
ST
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: C213.5 BTL1
40 create type Department (
name varchar(20),
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
C213.5 BTL1
41 database systems. Changes 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
57

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
C213.5 BTL1
42 state (or current value), whereas a literal has a value (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?
An object has five aspects: identifier, name, lifetime, structure, and creation. C213.5 BTL1
43
What rae the types of literals?
P
There are three types of literals: atomic, structured, and collection. C213.5 BTL1
44
AP
What are the notation of ODMG??
The notation of ODMG uses three concepts: interface, literal, and clas C213.5 BTL1
45
Define ODL: OBJECT DEFINITION LANGUAGE

Object Definition Language (ODL) is the specification language defining the
C213.5 BTL1
46 interface to object types conforming to the ODMG Object Model. Often
abbreviated by the acronym ODL.This language's purpose is to define the structure
R
of an Entity-relationship diagram.
How to declare the class and element.?
Class Declarations
CO
interface < name > {elements = attributes, relationships, methods }
C213.5 BTL1
47 Element Declarations
attribute < type > < name > ;
relationship < rangetype > < name > ;
U
Write the Similarities between E/R and ODL

both support all multiplicities of relationships C213.5 BTL1
48 both support inheritance
ST
Define XML SCHEMA

XML Schema defines a number of built-in types such as string, integer, decimal
C213.5 BTL1
49 date, and boolean. In 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 C213.5 BTL1
50 There are the three main statistical models—Boolean, vector space, and
probabilistic—and the semantic model.
58

PART – B
BLOOM’S
Q. NO. QUESTIONS CO
LEVEL
Explain about Object Oriented Databases and XM Databases. C213.5 BTL5

1
C213.5 BTL5
2 Explain in detail (i) Information Retrieval (iii) Transaction processing
(Nov/Dec 14)
C213.5 BTL6
P
3
Write short notes on Distributed Transactions. (Nov/Dec 14)
C213.5 BTL5
4
AP
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
C213.5 BTL3
5 objects are on disk initially? Suppose a program first dereferences A,
then dereferences B by following the reference from A, and then
finally dereferences C. Show the objects that are represented in
R
memory after each dereference, along with their state. (Nov/Dec 15)
Suppose that you have been hired as a consultant to choose a database

CO
system 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 C213.5 BTL3
6
recommendation.
U
(i)A computer-aided design system for a manufacturer of airplanes.

(ii)A system to track contributions made to candidates for public
office.
(iii)An information system to support the making of movies.
ST
(Nov/Dec 16)
Give the DTD for an XML representation of the following nested-

relational schema
Emp = (ename, ChildrenSet setof(Children), SkillsSet setof(Skills)) C213.5 BTL3
7
Children = (name, Birthday)
Birthday = (day, month, year)
Skills = (type, ExamsSet setof(Exams)).
Exams = (year, city) (Nov/Dec 16)
C213.5 BTL5
8
Explain XML Schema with an example.
Explain various queries in IR Systems with an example. C213.5 BTL5
9
59

C213.5 BTL5
10
Explain ODL and OQL with an example.
C213.5 BTL5
11
Explain ODMG – Object Model in detail
Explain XML Databases. C213.5 BTL5
12
Exaplain the object relational database features. C213.5 BTL5
13
Explain Information Retrieval process in detail C213.5 BTL5
14
Give the DTD or XML Schema for an XML representation of the nested relational
schema . Nov/ Dec 2016 C213.5 BTL5
15
P
AP
R
CO
U
ST
60

Stucor CS3492-DJ

Uploaded by

Copyright:

Available Formats

Stucor CS3492-DJ

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Stucor CS3492-DJ

Uploaded by

Copyright:

Available Formats

CS3492

DOWNLOADED FROM STUCOR APP

concentrates on describing entities, data types, relationships, user operations and

List the components of DBMS.

DOWNLOADED FROM STUCOR APP

Define key constraints.

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

DOWNLOADED FROM STUCOR APP

 Insert is used to insert data into the relation

What are the advantages of relational model.

 Structural Independence: The relational database is only concerned with

 Scalable: Regarding a number of records, or rows, and the number of fields,

Define relational algebra.

Derived operators: set intersection, division, join

Define select operation in relational algebra.

DOWNLOADED FROM STUCOR APP

Define project operator in relational algebra.

Define Cartesian product in relational algebra.

– (R and S need not be union compatible)

29. – Factor of two in the size of each row C212.1 BTL1

– Quadratic in the number of row

DOWNLOADED FROM STUCOR APP

What is a table in relational database.

What is an index in relational database?

DOWNLOADED FROM STUCOR APP

List any 5 responsibilities of the DB Manager May June 2007

42. - The collection of information stored in the database at a particular moment

What are the types of attributes. April/May 2007

DOWNLOADED FROM STUCOR APP

tables and establishing constraints

What are the function of DBA? April/May 2009

DOWNLOADED FROM STUCOR APP

among the attributes of an entity as well as the relationship among different

What the problems caused by the redundancy?

last_name VARCHAR(75) NOT NULL,

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

DOWNLOADED FROM STUCOR APP

ALTER objecttype objectname parameters.

 SUM returns the sum of the values in a specified column.

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

DOWNLOADED FROM STUCOR APP

clauses of the outer SELECT statement (nested query).

SET column_name1 = data_value1 [, column_namei =

columns that are updated for all rows in the table.

 data_values must be compatible with the data types for the

DOWNLOADED FROM STUCOR APP

Define GRANT command in SQL. BTL1

This command will REVOKE a SELECT privilege on employee table from

What is system privileges?

DOWNLOADED FROM STUCOR APP

Write the syntax for creating a role.

DOWNLOADED FROM STUCOR APP

FORCE : manually commits an in-doubt distributed transaction. The transaction is

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

DOWNLOADED FROM STUCOR APP

What is embedded SQL?

The preparation of an SQL application program includes precompilation, the

What is dynamic SQL?