Anna University Chennai 2011-6th Sem B.E Computer Science and Engineering Anna university in chennai for held on -university question paper

B.E/B.TECH DEGREE EXAMINATION, APRIL/MAY 2011
Six Semester
COMPUTER SCIENCE AND ENGINEERING

CS 2029- ADVANCED DATABASE TECHNOLOFY
(Regulation 2008)

Time:Three hours maximum: 100 marks


ans ALL ques.
PART-A(10*2=20 marks)

1. elaborate 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 createiterator() method used in ODMG c++ language.
7. what is the difference ranging from XML schema and XML DTD?
8. Define: Snowflake schema and fact constellation.
9. mention the kind of spatial queries.
10. what is a horn clause?


PART-B(5*16=80 marks)

11. (a)(1) explain 1st normal form, 2nd normal form and 3rd normal forms.(10)
(2) Normalize the provide relations as needed.
i. customer(customer-ID,customer name,telephone numbers,credit cards) to 1st normal form
[note : telephone numbers, credit cards are multivalued Attributes]
ii. Student(rollno,name,courseno,course max,marks,yearofstudy, Address)to 3rd normal form
iii. vendor order(vendorno,orderno, vendorname,qty supplied, price/unit)to 2nd normal form

(b) Discuss:
(i) conflict serializability
(ii) view serializability
(iii) 2 phase commit protocol
(iv) validation based concurrency control protocol.

12. (a) explain 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)
presume that the employee relation is fragmented horizontally by plant-number and that every fragment is stored locally at the corresponding plant site. presume that the machine relation is stored its entirety at the Armonk site. define a good strategy for processing every of the subsequent queries.

* obtain all employees at the plant that contains machine number 1130.
* obtain all employees at plant that contain machine whose kind is "milling machine".
* obtain all machines at the almaden plant.
* calculate join of obtain employee and machine relations.

(ii) discuss how 3pc responds to different kinds of failure.(6)

13. (a) (i) explain 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) define the steps of the algorithm for object database design for EER to OO mapping.(8)
(ii) explain in detail the OQL concepts. (8)

14. (a) explain the problems and steps involved in building a data warehouse. how the concept of relational view is related to data warehouse and data marts?(16)

(b) explain Apriori and frequent trend tree algorithm(16)

15. (a) explain the database management problems involved in designing mobile, genomic and multimedia databases.(16)

or

(b) (i) explain the design and implementation problems for active databases.(8)
(ii) explain the programming aspects of Datalog with example(8)

Earning:   Approval pending.