STUPIDSID
1
Consider following global schema of a company database who keep track of company's employees, department and projects
i) Perform Primary Horizontal Fragmentation (PHF) of relation PROJ with pname and budget of projects given their number issued at three sites and access project information according to budget one site accesses ≤ 200000 other accesses>200000.
ii) Explain how the above resulting PHF fulfill the correctness rule of fragmentation.
iii) Perform Derive Horizontal Fragmentation (DHF) or relation EMP with respect to PAY (p1:sal>30000 and p2:sal≤30000).
iv) Explain how the above resulting DHF fulfill the correctness rules of fragmentation.
|
EMP
|
ASG
|
|||||||||||||||
|
PROJ
|
PAY
|
i) Perform Primary Horizontal Fragmentation (PHF) of relation PROJ with pname and budget of projects given their number issued at three sites and access project information according to budget one site accesses ≤ 200000 other accesses>200000.
ii) Explain how the above resulting PHF fulfill the correctness rule of fragmentation.
iii) Perform Derive Horizontal Fragmentation (DHF) or relation EMP with respect to PAY (p1:sal>30000 and p2:sal≤30000).
iv) Explain how the above resulting DHF fulfill the correctness rules of fragmentation.
20 M
2 (a)
Draw and explain model of transaction management inDDB.
10 M
2 (b)
Explain Following transparency for distributed database.
10 M
3 (a)
Draw and explain Layers of Query Processing in distributed database.
10 M
3 (b)
What is query optimization? List distributed query optimization algorithms and explain any one from that.
10 M
4 (a)
University database contains information about the course and the Professors who teach the courses in each semester. Each course must also have information about the number of student enrolled, room no. data and time (when and where the course is coupled)
i) Write DTD rules for above XML documents.
ii) Create an XML schema for above XML documents.
i) Write DTD rules for above XML documents.
ii) Create an XML schema for above XML documents.
10 M
4 (b)
Describe any two method for deadlock detection in distributed database?
10 M
5 (a)
Explain Timestamp-based concurrency control mechanisms in DDB.
10 M
5 (b)
State the purpose of 2PC protocol. Explain 2PC in detail.
10 M
Write short notes on (any two):
6 (a)
Architecture of Heterogeneous database.
10 M
6 (b)
Affinity Matrix
10 M
6 (c)
Design issue of Distributed Database.
10 M
6 (d)
Distributed Database Architecture.
10 M
More question papers from Distributed Databases