Distributed Databases - May 2017

MU Computer Engineering (Semester 6)

Total marks: --
Total time: -- INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary 1(a) Differntiate between homogenous distributed database management systems with example. 10 marks

1(b) Discuss the phases of distributed query processing with neat diagram. 10 marks

2(a) Consider the following relations: BOOKS(Book#, Primary_author, Topic, Total_stock, $ price )
BOOKSTORE(Store#, City, State, Zip, Inventory_ value)
STOCK(Store#, Book#, Qty) Total_stock is the total number of books in stock and Inventory_value is the total inventory value for the store in dollars.
Design a global schema for above database. Give an example of two simple predicates that would be meaningful for the BOOKSTORE relation for horizontal partitioning 10 marks

2(b) How would a derived horizontal partitioning of STOCK be defined based on the partioning of BOOKSTORE? 10 marks

2(c) Show predicates by which BOOKS may be horizontally partioned by topic 10 marks

2(d) Show how the STOCK may be further partitioned from the partitions in (b) by adding the predicates in (c). 10 marks

3(a) What is distributed data independence? Explain how distributed data independence is provided by the architecture of DDBMS. 10 marks

3(b) Discuss the algorithms used for distributed Deadlock preventions. 10 marks

4(a) Compare various locking based concurrency control protocols. 10 marks

4(b) XML document of Restaurant Menu Card' has food items, categorized into Starters, Drinks, Chinese, South and Punjabi. Each food item element cotains name, cost, calories, and veg/non-veg flag.
i) Write DTD rules for above XML document
ii) Write XML Schema for above XML document. 10 marks

5(a) Discuss the different communication structures for 2PC. 10 marks

5(b) Describe the distributed R* query optimization algorithm. 10 marks

Write short note any two question from Q.6(a, b, c, d)

6(b) Multi-version TO algorithm 10 marks

6(c) Transparency in Distributed Database Design 10 marks

6(d) Schema architecture of federated MDBS 10 marks