CS8492 –DATABASE MANAGEMENT SYSTEMS

UNIT I – RELATIONAL DATABASE

PART - A(2 MARKS)

1. Define database management system.

A database-management system (DBMS) is a collection of interrelated data and a set of programs

to access those data. The collection of data, usually referred to as the database, contains information
relevant to an enterprise. The primary goal of a DBMS is to provide a way to store and retrieve
database information that is both convenient and efficient.
2. List the applications of DBMS.

The applications of DBMS are:

1. Banking
2. Airlines
3. Universities
4. Credit card transactions
5. Tele communication
6. Finance
7. Sales
8. Manufacturing
9. Human resources

3. What are the disadvantages of file processing system?

The disadvantages of file processing systems are:

1. Data redundancy and inconsistency
2. Difficulty in accessing data
3. Data isolation
4. Integrity problems
5. Atomicity problems
6. Concurrent access anomalies

4. What are the characteristics of Data Base Systems?

The main purpose of going for database approach is to overcome problems faced in traditional file-
processing approach. The important characteristics of the database approach are the following:
1. Self-Describing Nature of a Database System
2. Insulation between Programs and Data, and Data Abstraction
3. Support of Multiple Views of the Data
4. Sharing of Data and Multiuser Transaction Processing

5. What are the advantages of using a DBMS?

The advantages of using a DBMS are
1. Controlling redundancy
2. Restricting unauthorized access
3. Providing multiple user interfaces
4. Enforcing integrity constraints.
5. Providing back up and recovery

2
6. List the components of DBMS.

The components of DBMS are:

1. Query processor
2. Run time database manager
3. Authorization control
4. Command processor
5. Integrity checker
6. Query optimizer
7. Transaction manager
8. Scheduler
9. Data Manager
7. List the Codd’s Rules on Relational Databases.

Dr Edgar F. Codd, after his extensive research on the Relational Model of database systems came
up with twelve rules of his own, which according to him, a database must obey in order to be regarded as a
true relational database.
These rules can be applied on any database system that manages stored data using only its
relational capabilities. This is a foundation rule, which acts as a base for all the other rules.

Rule 1: The information rule

Rule 2: Guaranteed access rule
Rule 3: Systematic treatment of null values
Rule 4: Dynamic online catalog based on the relational model
Rule 5: Comprehensive data sublanguage rule
Rule 6: View updating rule
Rule 7: High-level insert, update, and delete
Rule 8: Physical data independence
Rule 9: Logical data independence
Rule 10: Integrity independence
Rule 11: Distribution independence
Rule 12: Non-subversion rule

8. List thee levels of data abstraction.

1. Physical level
2. Logical level
3. View level

9. Define instance and schema.

Instance: Collection of data stored in the data base at a particular moment is called
an Instance of the database.
Schema: The overall design of the data base is called the data base schema.

3
10. Define the terms Physical Schema and Logical Schema.

Physical schema: The physical schema describes the database design at the physical level, which
is the lowest level of abstraction describing how the data are actually stored.
Logical schema: The logical schema describes the database design at the logical level, which
describes what data are stored in the database and what relationship exists among the data.

11. What is conceptual schema?

The schemas at the view level are called subschema‟s that describe different views of the database.

12. Define data model.

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

13. What is a data dictionary?

A data dictionary is a data structure which stores meta data about the structure of the database ie.
The schema of the database.

14. What is an entity relationship model?

The entity relationship model is a collection of basic objects called entities and relationship
among those objects. An entity is a thing or object in the real world that is distinguishable
from other objects.
15. What are attributes? Give examples.
An entity is represented by a set of attributes. Attributes are descriptive properties possessed
by each member of an entity set.
Example: possible attributes of customer entity are customer name, customer id,
Customer Street, customer city.
16. What is relationship? Give examples
A relationship is an association among several entities.
Example: A depositor relationship associates a customer with each account that he/she has.

17. Define the terms i) Entity set ii) Relationship set

Entity set: The set of all entities of the same type is termed as an entity set.
Relationship set : The set of all relationships of the same type is termed as a relationship set.

18. Define single valued and multivalued attributes.

Single valued attributes: attributes with a single value for a particular entity are called
single valued attributes.
Multivalued attributes : Attributes with a set of value for a particular entity are called
multivalued attributes.
19. What are composite attributes?
Composite attributes can be divided in to sub parts. Composite attributes are made of more than one
simple attribute. For example, a student's complete name may have first_name and last_name.

4
20. Define null values.
In some cases a particular entity may not have an applicable value for an attribute or if we
do not know the value of an attribute for a particular entity. In these cases null value is used.
21. Define the terms i) Entity type ii) Entity set
a. Entity type: An entity type defines a collection of entities that have the same attributes.
b. Entity set: The set of all entities of the same type is termed as an entity set.

22. What is meant by the degree of relationship set?

The degree of relationship type is the number of participating entity types.

23. Define the terms

i) Key attribute
ii) Value set

Key attribute: An entity type usually has an attribute whose values are distinct from
each individual entity in the collection. Such an attribute is called a key attribute.
Value set: Each simple attribute of an entity type is associated with a value set that specifies the
set of values that may be assigned to that attribute for each individual entity.

24. Define weak and strong entity sets.

Weak entity set: entity set that do not have key attribute of their own are called weak entity sets.
Strong entity set: Entity set that has a primary key is termed a strong entity set.
25. What does the cardinality ratio specify?
Mapping cardinalities or cardinality ratios express the number of entities to which another entity can
be associated. Mapping cardinalities must be one of the following:
• One to one
• One to many
• Many to one
• Many to many

26. Define the terms i) DDL ii) DML

DDL: Data base schema is specified by a set of definitions expressed by a special language
called a data definition language.
DML:
A data manipulation language is a language that enables users to access or manipulate data
as organized by the appropriate data model.
27. Define tuple and attribute.
Attributes: column
headers Tuple : Row

28. Define the term relation.

Relation is a subset of a Cartesian product of list domains.
29. Define tuple variable.
Tuple variable is a variable whose domain is the set of all tuples.
30. Define the term Domain.
For each attribute there is a set of permitted values called the domain of that attribute.

5
31. What is a candidate key?
Minimal super keys are called candidate keys.

32. What is a primary key?

Primary key is chosen by the database designer as the principal means of identifying
an entity in the entity set.
33. What is a super key?
A super key is a set of one or more attributes that collectively allows us to
identify uniquely an entity in the entity set.
34. Define relational algebra.
The relational algebra is a procedural query language. It consists of a set of
operations that take one or two relation as input and produce a new relation as
output.
35. What is a SELECT operation?
The select operation selects tuples that satisfy a given predicate. We use the
lowercase letter ss to denote selection. ss
36. What is a PROJECT operation?
The project operation is a unary operation that returns its argument relation with
certain attributes left out. Projection is denoted by pie ( pp pp ).

37. List the different levels of data abstraction.

Physical level. The lowest level of abstraction describeshowthe data are actually stored.
Logical level. The next-higher level of abstraction describes what data are stored in
the database, and what relationships exist among those data.
View level. The highest level of abstraction describes only part of the entire database.
The system may provide many views for the same database.

Fig. Three level data abstraction

38. What are the basic operations of relational algebra?

The relational algebra is a procedural query language. It consists of a set of operations that take
one or two relations as input and produce a new relation as their result. The fundamental
operations in the relational algebra are select, project, union, Set difference, Cartesian product
and rename.

6
39. What is functional dependency?

Functional dependency is a relationship that exists when one attribute uniquely determines
another attribute.

If R is a relation with attributes X and Y, a functional dependency between the attributes

is represented as X->Y, which specifies Y is functionally dependent on X.

Here X is termed as a determinant set and Y as a dependant attribute. Each value of X is associated
precisely with one Y value.

Functional dependency in a database serves as a constraint between two sets of attributes.

40. What are the desirable properties of decomposition?

There are three desirable properties:

a. Lossless.
b. Dependency preservation.
c. Minimal redundancy.

7
 PART – B (BIQ QUESTIONS)

1. Explain about views of data in detail.

2. Write short notes on Data models and its type.

3. Explain the overall architecture of database system in detail.

4. Explain the basic architecture of a database management system with neat block diagram.

5. Explain select, projection, Cartesian product and join operations in relational algebra with an
example.

6. Explain aggregate functions in SQL with example.

7. Explain the different clauses of SQL Query.

8. Explain embedded SQL with an example.

9. Consider the relation student (reg.no., name, mark and grade). Write embedded dynamic SQL
program in C language to retrieve all the students records whose mark is more than 90.

8
 UNIT II – DATABASE DESIGN

PART - A (2 MARKS)

1. What is an entity relationship model?

The entity relationship model is a collection of basic objects called entities and relationship among
those objects. An entity is a thing or object in the real world that is distinguishable from other objects.

2. What are attributes? Give example.

An entity is represented by a set of attributes. Attributes are descriptive properties possessed by each
member of an entity set.
Example: Possible attributes of customer entity are customer name, customer id, customer Street and
customer city.
3. What is an entity?
An entity is an object that exists and is distinguishable from other objects.
Example: specific person, company, event, plant
4. Define the terms:
i) Entity set
ii) Relationship set
Entity set : The set of all entities of the same type is termed as an entity set.
Relationship set : The set of all relationships of the same type is termed as a relationship set.

5. Define single valued and multivalued attributes.

Single valued attributes: Attributes with a single value for a particular entity are called single valued
attributes.
Multivalued attributes : Attributes with a set of value for a particular entity are called
multivalued attributes.
6. What are stored and derived attributes?
Stored attributes: The attributes stored in a data base are called stored attributes.
Derived attributes: The attributes that are derived from the stored attributes are called
derived attributes.
7. Define null value.
In some cases a particular entity may not have an applicable value for an attribute or if we do not
know the value of an attribute for a particular entity. In these cases null value is used.
8. What does the cardinality ratio specify?
Mapping cardinalities or cardinality ratios express the number of entities to which another entity can
be associated. Mapping cardinalities must be one of the following:..

a) One to one
b) One to many
c) Many to one
d) Many to many
9
9. Define the terms:
i) Key attribute
ii) Value set
Key attribute: An entity type usually has an attribute whose values are distinct from each individual
entity in the collection. Such an attribute is called a key attribute.
Value set: Each simple attribute of an entity type is associated with a value set that specifies the set of
values that may be assigned to that attribute for each individual entity.

10. Define weak and strong entity sets.

Weak entity set : entity set that do not have key attribute of their own are called weak entity sets.
Strong entity set : Entity set that has a primary key is termed a strong entity set.

11. Define the two types of participation constraint.

Total : The participation of an entity set E in a relationship set R is said to be total if every entity in
E participates in at least one relationship in R.
Partial : If only some entities in E participate in relationships in R, the participation of
entity set E in relationship R is said to be partial
12. Define the terms Generalization and Aggregation.
Generalization is a containment relationship that exists between a high-level Entity set and one or
more low-level entity set.
Aggregation is an abstraction through which relationships are treated as higher-level entities.
13. What is ER diagram?
An entity-relationship diagram is a data modeling technique that creates a graphical representation of
the entities, and the relationships between entities, within an infor- mation system.
14. What are the steps involved in creating in ER diagram?
a) Identify the entities.
b) Find the relationships
c) Identify key attributes for every entity
d) Draw the ERD.
15. Define tuple and attribute. Attributes:
Name of Columns or fields Tuple :
Name of Rows or records
16. Define the term Domain.
For each attribute there is a set of permitted values called the domain of that attribute.
17. What are referential integrity constraints?
A value that appears in one relation for a given set of attributes also appears for a cer- tain set of
attributes in another relation.
18. What is the use of integrity constraints?
Integrity constraints ensure that changes made to the database by authorized users do not result in a loss
of data consistency. Thus integrity constraints guard against accidental damage to the database.

10
19. What is normalization?
Database normalization is the process of organizing the fields and tables of a relational database to
minimize redundancy and eliminate dependency. Normalization usually involves dividing large tables
into smaller (and less redundant) tables and defining relationships between them.

20. What are the needs of normalization?

1. To reduce redundancy
2. To eliminate dependency
3. To solve insert, delete, update anomalies.
21. Define 1NF.
A relation said to be first normal form if and if only all attributes are atomic in nature.
22. Define 2NF.
A relation said to be second normal form if and if only relation should be in first nor- mal form and to
eliminate partial dependency.
23. Define 3NF.
A relation said to be third normal form if and if only relation should be in second nor- mal form and
to eliminate transitive dependency.
24. Define BCNF.
A relational schema R is in Boyce–Codd normal form if and only if for every one of
its dependencies X → Y, at least one of the following conditions hold
1. X → Y is a trivial functional dependency (Y X)
2. X is a superkey for schema R
25. Define 4NF.
A Table is in 4NF if and only if, for every one of its non-trivial multivalued dependencies X Y, X
is a superkey that is, X is either a candidate key or a superset
26. Define 5NF.
A table is said to be in the 5NF if and only if every non-trivial join dependency in it is implied by
the candidate keys.

11
 PART – B (BIQ QUESTIONS)

1. Explain about Entity Relationship Model with ER diagrams and example.

2. Explain Extended ER Model.
3. Draw an E-R diagram for
i. Banking system
ii. Airline Reservation system
iii. Payroll system

4. Construct an ER diagram for a car-insurance company whose customers own one or more cars
each. Each car has associated with its zero to any number of record accidents. State any
assumptions you make.
5. What is normalization? Explain normalization techniques using functional dependencies
with relevant examples.
6. Compare and contrast 3NF and BCNF.
7. Explain the multi-valued dependency and fourth normal form with example.
8. Explain the Join dependency and fifth normal form with example.
9. Draw an ER diagram for Hospital management system.
10. What is Functional Dependency? Explain types and properties of FD‟s.
11. Construct an ER diagram for university registrar‟s office. The office maintains data about each
class, including the instructor, the enrollment and the time and place of the class meetings. For each
student class pair a grade is recorded. Determine the entities and relationships.
12. Define generalization and aggregation. Demonstrate generalization and aggregation using E-R
diagram.

12
 UNIT III – TRANSACTIONS

PART - A (2 MARKS)

1. What are the ACID properties?

(Atomicity, Consistency, Isolation, Durability) is a set of properties that guarantee database transactions
are processed reliably. In the context of databases, a single logical operation on the data is called a
transaction. For example, a transfer of funds from one bank account to another, even though that might
involve multiple changes (such as debiting one account and crediting another), is a single transaction.
2. What is transaction?
Collections of operations that form a single logical unit of work are called transactions.
3. What are the two statements regarding transaction?
The two statements regarding transaction of the form:
 
 Begin transaction
 
 End transaction

4. What is recovery management component?

Ensuring durability is the responsibility of a software component of the base system
called the recovery management component.
5. When is a transaction roll back?
Any changes that the aborted transaction made to the database must be undone. Once the changes
caused by an aborted transaction have been undone, then the transaction has been rolled back.
6. List out the statements associated with a database transaction.
 
 Commit work
 
 Rollback work

7. What are the two types of serializability?

A (possibly concurrent) schedule is serializable if it is equivalent to a serial schedule. Different
forms of schedule equivalence gives rise to the notions of:
1. Conflict serializability
2. View serializability
8. List the SQL statements used for transaction control.

Commit : Saves all transactions
 
 Rollback : Used to undo transactions
 
 Savepoint : Establishes a point back to which you may roll
 
 Set Transaction : Establishes properties for current transaction.

9. What are the three types of intent Lock?

 
 Intent Shared(IS)
 
 Intent Exclusive (IX)
 
Shared Intent Exclusive(SIX)

13
 10. Draw the states of Transaction.

11. What is Conflict-Serializability?

Conflict-Serializability is defined by equivalence to a serial schedule (no overlapping transactions) with
the same transactions, such that both schedules have the same sets of respective chronologically ordered
pairs of conflicting operations (same precedence relations of respective conflicting operations).
12. What is View-Serializability?
View-Serializability of a schedule is defined by equivalence to a serial schedule (no overlapping
transactions) with the same transactions, such that respective transactions in the two schedules read
and write the same data values ("view" the same data values)
13. What are two pitfalls (problem) of lock-based protocols?
Shared Lock : If a Transaction Ti has obtained a shared mode lock on data item Q, then Ti can
read, but cannot write Q.
Exclusive Lock : If the transaction Ti has obtained a shared mode Lock on item Q, then Ti can read
and also write Q.
14. What is recovery management component?
Ensuring durability is the responsibility of a software component of the base system called the
recovery management component.
15. What are the reasons for allowing concurrency?
The reasons for allowing concurrency is if the transactions run serially, a short transaction may have to
wait for a preceding long transaction to complete, which can lead to unpredictable delays in running a
transaction. So concurrent execution reduces the unpredictable delays in running transactions.
16. Define lock.
Lock is the most common used to implement the requirement is to allow a to access a data
transaction item only if it is currently holding a lock on that item.
17. What are the different modes of lock?
The modes of lock are:
 
 Shared Lock
 
 Exclusive Lock

18. What is meant by deadlock?

A system is in a deadlock state if there exists a set of transaction such that every transaction in the
set is waiting for another transaction in the set.

14
19. Define the phases of two phase locking protocol
Growing phase: a transaction may obtain locks but not release any lock.
Shrinking phase: a transaction may release locks but may not obtain any new locks.

20. What is the time stamp associated with each data item?

W-timestamp (Q) denotes the largest time stamp if any transaction that executed WRITE (Q)
 successfully.

R-timestamp (Q) denotes the largest time stamp if any transaction that executed READ (Q)
 successfully.

21. What are the three types of intent Lock?
 
 Intent Shared(IS)
 
 Intent Exclusive (IX)
 
 Shared Intent Exclusive(SIX)


22. What is Time-stamp based protocol?



Timestamp based protocol ensures Serializability. It selects an ordering among transactions in advance
 using time stamps.

With each Transaction in the system, a unique fixed timestamp is associated. It is denoted by
TS(Ti). This timestamp is assigned by the database system before the transaction Ti status

execution. If a transaction Ti has been assigned time- stamp TS(Ti) and new transaction Tj
 enters the system, then TS(Ti)<TS(Tj).

23. What is meant by Two phase commit protocol.

The commit process proceeds as follows:

Phase 1
Each participating resource manager coordinates local operations and forces all log records out:
(i) If successful, respond "OK"
(ii) If unsuccessful, either allow a time-out or respond "OOPS"
Phase 2
If all participants respond "OK":
(i) Coordinator instructs participating resource managers to "COMMIT"
(ii) Participants complete operation writing the log record for the commit
Otherwise :
(i) Coordinator instructs participating resource managers to "ROLLBACK"
(ii) Participants complete their respective local undos
(iii)
24. Difference between deadlock prevention and deadlock avoidance.
Deadlock Prevention:

 how requests for resources can be made in the system and how
Preventing deadlocks by constraining
they are handled (system design).

15
  
The goal is to ensure that at least one of the necessary conditions for deadlock can never hold.

Deadlock Avoidance:
 
 The system dynamically considers every request and decides whether it is safe to grant it at this point,


  apriori information regarding the overall poten- tial use of each
The system requires additional
resource for each process.
 
 Allows more concurrency.
25. What is Concurrency Control?
Process of managing simultaneous execution of transactions in a shared database, to ensure the
Serializability of transactions, is known as concurrency control.

16
 PART – B (BIQ QUESTIONS)

1. Explain about ACID properties with suitable example.

2. Illustrate the different state of transaction processing.
3. Describe briefly about Serializability and its types with relevant example.
4. Explain the conflict serializability and view serializability.
5. Discuss the following transaction with relevant example:
a) Read Only Transaction
b) Read Write Transaction
c) Aborted Transaction
6. Draw transaction state diagram and describe each state that a transaction goes through during
its execution.
7. Explain read-only, write-only and read-before-write protocols in serializability.
8. How concurrency is performed. Explain the protocol which used in concurrency con- cept.
9. Discuss in detail about two phase commit protocol.
10. Explain the concepts of Concurrency control mechanism.
11. Describe briefly about deadlock handling.
12. Discuss in detail about Lock based Protocol and Time Stamp based protocol.
13. Discuss about two phase locking techniques for concurrency control.
14. Explain Two Phase- Locking protocol. What benefit does strict two-phase locking
protocol provides? Discuss its disadvantages.
15. How the use of 2PL would prevent interference between two transactions.

16. Why concurrency control is needed? Explain the problems that would arise when concurrency
control is not provided by the database system.

17
 UNIT IV –IMPLEMENTATION TECHNIQUES

PART - A (2 MARKS)

1. List the merits and demerits of B+ tree index structure.

Mertis
Insertion in B+tree is easy.
Deletion in B+ tree is simple than B tree.

Demeris :

Requires redundant storage for search-key values every search key appears in some leaf node.
Several are repeated in non-leaf node.
Lookup on B+-tree requires traversal of a path from root of tree to some leaf node.

2. Differentiate Static hashing and Dynamic hashing.

S.
Static hashing Dynamic hashing
No
1. Numbers of buckets are fixed Numbers of buckets are not fixed
2. As the file grows, performance de- As the file grows, performances do
creases. not
3. degrade.
Space overhead is more
4. Space overhead is less
Do not use bucket address table
5. Open hashing and closed hashing are Bucket address table is
forms of it. used
6.
Implementation is simple Extendable hashing and linear
7.
It is less attractive techniques hashing are forms of it.
8.
Implementation is complex
Overflow chaining is used
It is more attractive techniques
Overflow chaining is not used

3. What are the two types of ordered indices?

 
 Primary index
 
 Secondary index

4. What are different types of file organization?

 
 Sequential file organization
 
 Heap file organization
 
Hashing file organization

18
5. Difference between dense index and parse index.

S.No Dense index Parse index

Index entry for every search key value Index entries for only some of the
1. (and hence every record) in the data file. search values.

2. Dense indices are faster than sparse Sparse indices are slower than dense

Require less space and impose less

Require more space and impose more
3. maintenance for insertion and
maintenance for insertion and deletion
dele tion

6. Difference between Primary index and secondary index.

s. No Primary index Secondary index

An index on a set of fields that includes An index that is not a primary key
1. the unique primary key for the field

Guaranteed not to contain duplicates May have duplicates

2.
Also Called a Clustered index. Also Called a Non-Clustered index.
3.
Eg: Employee ID Eg: Employee name
4.

7. What are the factors to evaluate the indexing technique?

 
 Access types
 
 Access time
 
 Insertion time
 
 Deletion time
 
 Space overhead

8. What are the two main goals of parallelism?

 
 Load –balance multiple small accesses, so that the throughput of such accesses increases.
 
 Parallelize large accesses so that the response time of large accesses is reduced

9. What are the two types of blocks in the fixed-length representation?

 
 Anchor block: Contains the first record of a chain.

 block: Contains the records other than those that are the first record o f a
Overflow
 chain.
10. What is B+ tree?
A B+ tree is an n-ary tree with a variable but often large number of children per node. The root may be either a
leaf or a node with two or more children.A B+ tree can be viewed as a B-tree in which each node contains only
keys (not key-value pairs), and to which an additional level is added at the bottom with linked leaves.
19
11. Draw the physical storage media.

12. List out the levels of Raid.

 
 RAID level 0 –Block striping non-redundant
 
 RAID level 1 –Mirroring
 
 RAID level 2 –Memory style Error correcting code
 
 RAID level 3 –Bit interleaved parity
 
 RAID level 4 –Block interleaved parity
 
 RAID level 5 – Block interleaved distributed parity
 
 RAID level 6 – P+Q redundancy disk

13. Difference between B+ tree and B tree.

S.
B+ tree B- tree
No
1. B+ tree leaf node data are ordered B tree the leaf node cannot store
in a sequential linked list. using linked list.
2. B +tree store redundant search key B tree store non-redundant search
key
3. B+-tree data store only leaf nodes. B tree search keys and data stored in
internal or leaf nodes
4. Insertion of a B+ tree is not Insertion of a B tree is more compli-
compli- cated cated

20
 PART – B (BIQ QUESTIONS)

1. What are the various ways of organizing records in files and explain any one file organization in detail.
2. Explain how the RAID system improves performance and reliability.
3. Describe the structure of B+ tree and list the characteristics of B+ tree.
4. What is RAID? Briefly explain different level of RAID.
5. Construct B+ tree to insert the following (order of tree is 3) 26, 27, 28, 3, 4, 7, 9, 46, 48, 51, 2, 6.
6. Describe briefly about indexing and hashing.
7. With neat diagram, describe about magnetic disks.
8. Give brief notes on overviews of physical storage media.
9. Explain in detail about internal hashing Techniques.
10. Discuss in detail about cluster and multilevel indexes.
11. By considering an example, show how to reduce access time with primary index.
12. When does a collision occur in hashing? Illustrate various collision resolution techniques.
13. Illustrate with an example for insertion and deletion operations on a B- Tree.

21
 UNIT V – ADVANCED TOPICS

PART - A (2 MARKS)

1. What are the two approaches to store a relation in the distributed database?
Replication: System maintains several identical replicas (copies) of the relation and stores each
replica at a different site.
Fragmentation: System Partitions the relation into several fragments and stores each fragment at a
different site.
2. Define Distribute Database.
The computers in a distributed system communicate with one another through various com- munication
media, such as high-speed networks or telephone lines. They do not share main memory or disk. The
computers in distributed system are referred by names such as sites or nodes.
3. What are the types of Transactions?
Distributed database system supports two types of transactions.


Local transaction : It is one that accesses data only from site where that transac- tion was
 initiated.

 than the site where that
Global transaction : It is one that either accesses data from a site other
transaction was initiated or accesses data from several different sites.
4. Difference between homogeneous and heterogeneous database.

S.
Homogeneous Database Heterogeneous Database
No

Different nodes may have same Database application used at each location must be
1.
hardware & software same or compatible.

2. Much easier to design and manage Tough to design and manage

Database application used at each Database application used at each location must be
3.
location must be same or compatible. incompatible.

5. What are the advantages & disadvantages of distributed

databases? Advantages :
 
 Sharing data
 
 Autonomy
 
Availability

Disadvantages :
 
 Software development cost
 
 Greater potential for bugs
 
Increased processing overhead

22
6. List out the reasons for the development of distributed database.


In Centralized system data is stored on a single computer. If that computer fails, complete system
fails.
 
 In client server system also the data is stored on server. If server fails, complete system fails.
7. Define Transparency.
The user of a distributed database system should not be required to know either where the data are physically
located or how the data can be accessed at the specific local site. This characteristic called data transparency.
8. Define Vertical Fragmentation.
Vertical fragmentation splits the relation by decomposing the schema R of relation „r‟. Vertical fragmentation of
r(R) involves the definition of several subsets of attributes R1, R2, ..., Rn of the relation R so that

R = R1 U R2 U R3, U ..., U Rn
9. Define Horizontal Fragmentation.
In horizontal fragmentation, a relation „r‟ is partitioned into a number of subsets r1, r2, ..., rn. Each
tuple of relation „r‟ must belong to at least one of the fragments, so that the original rela- tion can be
reconstructed, if needed.
In general, a horizontal fragment can be defined as a select on the global relation „r‟. The predi- cate Pi
is used to construct fragment ri.
r = P (r)
10. What is Object Oriented Database?
An object-oriented database is a database that subscribes to a model with information rep- resented
by objects. Object-oriented databases are a niche offering in the relational database management
system (RDBMS) field and are not as successful or well-known as mainstream database engines.
11. Draw the representation Object Oriented Database.

12. List out the features of OODB.

 
 Complexity
 
 Inheritance
 
 Encapsulation
 
Persistency

23
13. What is Object?
Object consists of entity and attributes which can describe the state of real world object and action
associated with that object.
14. List out the Characteristics of Object. Some
important characteristics of an object are:
 
 Object name
 
 Object identifier
 
 Structure of object
 
 Transient object
 
Persistent objects


15. What is Persistent Object?

An object which exists even after the program is completely executed (or terminated), is called as
persistent objects. Object-oriented databases can store objects in secondary memory.
16. What are the three types of attributes in OODB?
 
 Simple Attributes
 
 Complex Attributes
 
 Reference Attribute

17. Define Simple attributes.

Attributes can be of primitive data type such as, integer, string, real etc. which can take literal
value. Example: 'ID' is simple attribute and value is 07.
18. Define Complex attributes.
Attributes which consist of collections or reference of other multiple objects are called as com- plex
attributes. Example: Collection of Employees consists of many employee names.
19. Define Reference attributes.
Attributes that represent a relationship between objects and consist of value or collection of values are
called as reference attributes.
Example: Manager is reference of staff object
20. What is ODMG?
The Object Database Management Group (ODMG) is made up of the leading Object Database vendors
plus a large number of companies that are interested in an ODBMS standard. The ODMG has
produced a standard for object databases. The ODMG Standard is an interoper- ability standard which
allows applications written to the standard to run on any com pliant system .
21. List out the standard in ODMG.
 
 Object Model
 
 Object Definition Language (ODL)
 
 Object Query Language (OQL)
 
 C++ Language Binding
 
Java Language Binding

24
22. What is XML Database?
XML Database is used to store huge amount of information in the XML format. As the use of XML is
increasing in every field, it is required to have a secured place to store the XML docu- ments. The data
stored in the database can be queried using XQuery, serialized, and exported into a desired format.
23. What are the types of XML databases?
There are two types of XML databases.
1. XML-enabled database
2. Native XML database (NXD)
23. What are the attributes of XML?

 XML elements can have attributes. By the use of attributes, we can add the in- formation about
the element.
 
 XML attributes enhance the properties of the elements.
24. Difference between HTML and XML.

No. HTML XML

1) HTML is used to display data and fo- XML is a software and hardware indepen-
cuses on how data looks. dent tool used to transport and store data.
It focuses on what data is.
2) HTML is a markup language itself. XML provides a framework to define
markup languages.
3) HTML is not case sensitive. XML is case sensitive.
4) HTML is a presentation language. XML is neither a presentation language
nor a programming language.
5) HTML has its own predefined tags. You can define tags according to your
need.
6) In HTML, it is not necessary to use a XML makes it mandatory to use a closing
closing tag. tag.
7) HTML is static because it is used to XML is dynamic because it is used to
display data. transport data.
8) HTML does not preserve whitespaces. XML preserve whitespaces.

25. Define DTD.

DTD stands for Document Type Definition. It defines the legal building blocks of an XML
document. It is used to define document structure with a list of legal elements and attributes.
26. What is XML schema?

XML schema is a language which is used for expressing constraint about XML documents. There
 which are used now a days for example Relax- NG and XSD
are so many schema languages
 (XML schema definition).

 of an XML document. It is like DTD but
An XML schema is used to define the structure
 provides more control on XML structure.
27. What are the data types of XML Schema? There
are two types of data types in XML schema.
1. Simple Type
2. Complex Type

25
 Simple Type
The simple Type allows you to have text-based elements. It contains less attributes, child ele-
ments, and cannot be left empty.
Complex Type
The complex Type allows you to hold multiple attributes and elements. It can contain additional sub
elements and can be left empty.
28. Difference between DTD and XSD.

No. DTD XSD

DTD stands for Document Type XSD stands for XML Schema Defi-
1)
Definition. nition.

DTDs are derived from SGML

2) XSDs are written in XML.
syntax.

XSD supports datatypes for elements and

3) DTD doesn't support datatypes.
attributes.
4) DTD doesn't support namespace. XSD supports namespace.

DTD doesn't define order for child

5) XSD defines order for child ele- ments.
elements.
6) DTD is not extensible. XSD is extensible.

XSD is simple to learn because you don't

7) DTD is not simple to learn.
need to learn new language.

DTD provides less control on XML XSD provides more control on XML
8)
structure. structure.

29. What is XQuery?

XQuery is a standardized language for combining documents, databases, Web pages and al- most
anything else. It is very widely implemented. It is powerful and easy to learn. XQuery is replacing
proprietary middleware languages and Web Application development languages.
XQuery is replacing complex Java or C++ programs with a few lines of code. XQuery is sim- pler to
work with and easier to maintain than many other alternatives.
30. What are the features of XQuery?
 
 XQuery is a functional language. It is used to retrieve and query XML based data.
 
 XQuery is expression-oriented programming language with a simple type sys- tem.


XQuery is analogous to SQL. For example: As SQL is query language for data- bases, same as
XQuery is query language for XML.
 
 XQuery is XPath based and uses XPath expressions to navigate through XML documents.
 
XQuery is a W3C standard and universally supported by all major databases.

26
31. Difference between XQuery and XPath.

Index XQuery XPath

1) XQuery is a functional programming XPath is a xml path language that is
and query language that is used to used to select nodes from an xml
query a group of XML data. docu- ment using queries.
2) XQuery is used to extract and XPath is used to compute values like
manipu- late data from either xml strings, numbers and boolean types
documents or relational databases and from another xml documents.
ms office docu- ments that support an
xml data source.
3) xquery is represented in the form of a xpath is represented as tree struc-
tree model with seven nodes, namely ture, navigate it by selecting different
processing instructions, elements, doc- nodes.
ument nodes, attributes, namespaces,
text nodes, and comments.
4) xquery supports xpath and extended xpath is still a component of query
re- lational models. lan-
guage.
5) xquery language helps to create syntax xpath was created to define a
for new xml documents. common syntax and behavior model
for xpoint- er and xslt.

32. What is XQuery FLWOR?

FLWOR is an acronym which stands for "For, Let, Where, Order by, Return".
 
 For - It is used to select a sequence of nodes.
 
 Let - It is used to bind a sequence to a variable.
 
Where - It is used to filter the nodes.

 
 Return - It is used to specify what to return (gets evaluated once for every node).
33. What is Information Retrieval (IR)?
 
 Information retrieval (IR) systems use a simpler data model than database sys- tems
 
 Information organized as a collection of documents
 
 Documents are unstructured, no schema

Information retrievallocates relevant documents, on the basis of user input such as keywords or
 example documents
34. What is Web Crawling?
 
 Crawling is done by multiple processes on multiple machines, running in parallel
 
 Set of links to be crawled stored in a database
  
New links found in crawled pages added to this set, to be crawled later
 
 Indexing process also runs on multiple machines
 
 Creates a new copy of index instead of modifying old index
 
 Old index is used to answer queries
 
After a crawl is “completed” new index becomes “old” index

27
 PART – B (BIQ QUESTIONS)

1. Explain in detail about distributed databases.

2. Discuss in detail about the various types of distributed database with suitable examples.
3. Compare and contrast Homogenous and Heterogeneous Database.
4. Explain in detail about Transactional Architecture with neat diagram.
5. Describe briefly on Transaction processing in distributed database.
6. Explain about Object Oriented Databases with suitable example.
7. Describe brief notes on ODMG.
8. Discuss in detail about the OODB with relevant examples.
9. Explain the importance of complex datatype with real-time example.
10. Discuss in detail about XML Database with relevant examples.
11. Compare and contrast XQuery, XSLT and XPath.
12. Explain the DTD with suitable example.
13. Write the XML Schema for the Hospital Management System.
14. Describe briefly on Information Retrieval (IR) with suitable example.
15. How Relevance Ranking will be performed in Information Retrieval?

28