GKM COLLEGE OF ENGINEERING AND TECHNOLOGY

CHENNAI 63
Department of Computer Science & Engineering
CS2029 ADVANCED DATABASE TECHNOLOGY
INTERNAL TEST 1
PART A ( 2 MARKS)
UNIT-1
1. Define Database Management System?
2. Define Data Model?
3. What is an entity relationship model?
4. Brief about single valued and multivalued attributes.
5. Distinguish between primary key with superkey.
6. Define Data base Recovery?
7. What is meant by normalization of data?
8. What is transaction and their properties
9. What is query optimization?
10.
What are tunable parameters?
UNIT-2
11.
What is Fragmentation?
12.
Name some Partitioning techniques and write short note about
it?
13.
Difference between Inter and Intra query parallelism?
14.
List the basic failure types of a distributed System`
15.
Mention the types and uses of commit protocols.
16.
Short notes on types of fragmentation.
17.
What is a global and local transaction.
18.
What are the failures types of a transaction.
19.
How you will manage deadlocks in a DDBMS.
20.
List the components of DDBMS architecture.

PART B ( 12 MARKS)

1.
2.
3.
4.
5.
6.
7.

UNIT-1
Discuss two phase locking protocol technique for concurrency in
detail
What is query optimization? Explain any two optimization
techniques in detail with suitable example.
Write short notes on transaction processing.
Discuss briefly on data base tuning.
Illustrate the steps involved in processing a query with neat
diagram.
Compare and contrast between BCNF & 2NF.
Develop cost function for the PROJECT UNION, INTERSECTION, SET
DIFFERENCE and CARTESIAN PRODUCT algorithm.
UNIT-2

8. Discuss in detail how parallelism could be used in query processing

and relational operation executions.
9. Illustrate the several architecture models for parallel database.
10. Explain the 2PC protocol and discuss how it handles the various
types of failures?
11. Describe in detail about how to partition the database into
fragments and explain where to locate those fragments and
replicas.
12. Explain the architecture of distributed database in detail.
13. Explain about deadlock handling. Define deadlocks, deadlock
characterization, local global weight of graph.
==============================8888888=====
===========================