Jawaharlal Nehru Technological University Kakinada 2008 B.Tech Information Technology DISTRIBUTED DATA BASES - Question Paper

Code No: R05411204 Set No. 1
IV B.Tech I Semester Regular Examinations, November 2008
DISTRIBUTED DATA BASES
( Common to info Technology and Computer Science & Systems
Engineering)
Time: three hours Max Marks: 80
ans any 5 ques.
All ques. carry equal marks

1. discuss the following:
(a) Heterogeneous databases
(b) Data independence
(c) Data dictionary
(d) Centralised control. [Marks:4+4+4+4]

2. (a) Draw an operator tree and show the simplification for the subsequent query. For
provided EMP and DEPT relations, assuming the necessary attributes, a query
to provide the names of employees who work in a department whose manager has
number 373 but who do not earn more than Rs.100000/- is as provided beneath.
PJEMP.NAME((EMP JNDEPTNUM=DEPTNUM SLMGRNUM=373DEPT )
DF
(SLSAL>100000 EMP JNDEPTNUM=DEPTNUMSLMGRNUM=373DEPT )
(b) discuss parametric queries in detail. [Marks:8+8]

3. (a) explain Non-distributed Join and Distributed Join.
(b) explain how an optimization graph can be drawn for a provided query. [Marks:8+8]
4. discuss the following:
(a) Communication failures
(b) Check points and recovery. [Marks:8+8]

5. discuss concurrency control based on timestamps. [Marks:16]

6. Write the termination algorithm for 3-phase-commitment assuming that the co-
ordinator site has failed, that no network partition has occurred, and that the
operational sites have a consistent view of the network. [Marks:16]

7. discuss briefly about the following:
(a) Distributed garbage collection
(b) Pointer swizzling. [10+6]
8. discuss about OLAP severs in detail. [Marks:16]

Earning:   Approval pending.