CS2029 Advanced Database Technology question paper - May/June 2011 / Anna University Previous Year 2011 Exam Questions for Advanced Database Technology / Anna University Previous Year 2011 Computer Science and Information Technology Question Papers / CS 606 Advanced Database Technology Question Paper
Question Paper
Code : 11247
B.E./B.Tech.
DEGREE EXAMINATION, MAY/JUNE-2011
Sixth
Semester
Computer
Science and Engineering
CS
2029 — ADVANCED DATABASE TECHNOLOGY
(Regulations
2008)
Time
: Three Hours Maximum
: 100 marks
Answer
ALL Questions
PART
A – (10 X 2 = 20 marks)
1. What are Armstrong
axioms?
2. What is cascade
less schedule?
3. What is location
transparency and fragmentation transparency?
4. When are elections
and voting used in distributed database?
5. Mention the
approaches used for making objects persistent.
6. Mention the use of
create_iterator() method used in ODMG C++ language.
7. What is the
difference between XML schema and XML DTD?
8. Define Snowflake
schema and fact constellation schema.
9. Mention the type
of spatial queries.
10. What is a Horn
clause?
PART
B – (5 X 16 = 80 marks)
11. (a) (i) Discuss
first normal form, second normal form and third normal forms.(10)
(ii) Normalize the
given relations as required. (6)
·
Customer(Customer_ID, customer_name,
telephone_numbers, credit_cards) to first normal form [note : telephone_numbers
and credit_cards are multivalued Attributes]
·
Student(Rollno, name, courseno, course
max ,marks, yearofstudy, Address) to third normal form
·
Vendor_order(vendorno, orderno,
vendorname, qty_supplied, price_per_unit) to second normal form
Or
(b) Discuss: (16)
(i)
Conflict serializability
(ii)
View serializability
(iii)
Two phase commit protocol
(iv)
Validation based concurrency control protocol.
12. (a) Discuss in
detail how parallelism could be used in query processing and relational
operation executions.(16)
Or
(b) (i) Consider the
relations:(10)
Employee(Name,
address, salary, plant_number)
Machine(Machine_number,
type, plant_number)
Assume that the Employee relation is fragmented
horizontally by plant_number and that each fragment is stored locally at the
corresponding plant site. Assume that the Machine
relation is stored its entirety at the ‘Armonk’ site. Describe a good strategy
for processing each of the following queries.
* Find all employees
at the plant that contains machine number 1130.
* Find all employees
at plant that contain machine whose type is "milling machine".
* Find all machines
at the ‘almaden’ plant.
* Compute join of
find employee and machine relations.
(ii) Explain how 3PC
responds to various types of failure. (6)
13. (a) (i) Discuss
the basic built in interfaces of the ODMG model. (12)
(ii)
Differentiate:(4)
* Multiple
inheritance and selective inheritance
* Structured and
unstructured complex object
Or
(b) (i) Describe the
steps of the algorithm for object database design for EER to OO mapping. (8)
(ii) Discuss in
detail the OQL concepts. (8)
14. (a) Discuss the
issues and steps involved in building a data warehouse. How the concept of
relational view is related to data warehouse and data marts? (16)
Or
(b) Discuss Apriori
and frequent pattern tree algorithm. (16)
15. (a) Discuss the
database management issues involved in designing mobile, genomic and multimedia
databases.(16)
Or
(b) (i) Discuss the
design and implementation issues for active databases. (8)
(ii) Discuss the programming
aspects of Datalog with example. (8)
________________________