Question Paper: Distributed Databases : Question Paper May 2015 - Computer Engineering (Semester 6) | Mumbai University (MU)
0

Distributed Databases - May 2015

Computer Engineering (Semester 6)

TOTAL MARKS: 80
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks.
1 Consider following global schema of a company database who keep track of company's employees, department and projects

EMP

FNO ENAME TITLE

E1

E2

E3

E4

E5

E6

E7

E8

JOHN

SAM

TOM

SMITH

DAVID

GAYLE

JACK

HARRY

Elect Engg

Syst. Anal

Mech Engg

Programmer

Syst. Anal

Elect Engg

Mech Engg

Syst. Anal

 

ASG

ENO PNO RESP DUR

E1

E2

E2

E3

E3

E4

E5

E6

E7

E8

P1

P1

P2

P3

P4

P2

P2

P4

P3

P3

Manage

Analyst

Analyst

Cosultant

Engineer

Programmer

Manager

Manager

Engineer

Manager

12

24

6

10

48

18

24

48

36

40

PROJ

PNO PNAME BUDGET LOC

P1

P2

P3

P4

E-Commerce

Database

ERP

CAD/CAM

150000

135000

250000

310000

Delhi
 

Mumbai

Mumbai

Pune

      

PAY

TITLE SAL

Elect Engg

Syst. Anal

Mech Engg

Programmer

40000

34000

27000

24000


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 marks) 2 (a) Draw and explain model of transaction management inDDB.(10 marks) 2 (b) Explain Following transparency for distributed database.(10 marks) 3 (a) Draw and explain Layers of Query Processing in distributed database.(10 marks) 3 (b) What is query optimization? List distributed query optimization algorithms and explain any one from that.(10 marks) 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.
(10 marks)
4 (b) Describe any two method for deadlock detection in distributed database?(10 marks) 5 (a) Explain Timestamp-based concurrency control mechanisms in DDB.(10 marks) 5 (b) State the purpose of 2PC protocol. Explain 2PC in detail.(10 marks)


Write short notes on (any two):

6 (a) Architecture of Heterogeneous database.(10 marks) 6 (b) Affinity Matrix(10 marks) 6 (c) Design issue of Distributed Database.(10 marks) 6 (d) Distributed Database Architecture.(10 marks)

ADD COMMENTlink
modified 24 months ago  • written 2.8 years ago by gravatar for Team Ques10 Team Ques10 ♦♦ 400
Please log in to add an answer.