07A80506 Distributed Databases B.Tech Question Paper : scce.ac.in

Name of the College : SREE CHAITANYA COLLEGE OF ENGINEERING
University : JNTUH
Department : Computer Science And Engineering
Subject Code/Name : 07A80506/DISTRIBUTED DATABASES
Year/Sem : IV/II
Website : scce.ac.in
Document Type : Model Question Paper

Download Model/Sample Question Paper : https://www.pdfquestion.in/uploads/scce.ac.in/4957-07A80506-DISTRIBUTEDDATABASES.pdf

SCCE Distributed Databases Question Paper

Code No: 07A80506
R07
IV B.Tech II Semester Examinations

Related : Sree Chaitanya College Of Engineering 07A80507 Virtual Reality B.Tech Question Paper : www.pdfquestion.in/4956.html

Computer Science And Engineering
Time: 3 hours
Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks :
1. (a) Explain the following:
i. Crash recovery
ii. Transaction recovery
iii. Database recovery.
(b) Write about the concurrency control based on locking in distributed databases. [8+8]

2. Discuss about deadlock detection using centralized and hierarchical controllers.[16]

3. Discuss the following for distributed databases:
(a) Operator tree construction
(b) Fragmented queries
(c) Semi-joins with example
(d) Relational algebra rules. [16]

4. (a) Write about horizontal and vertical fragmentation.
(b) Given a global relation
EMP(EMPNUM,NAME,SAL,TAX,MGRNUM,DEPTNUM)
Write the mixed fragmentation definition and fragmentation tree of relation EMP. [8+8]

5. Explain the following in detail:
(a) Semistructured data
(b) Client cache management
(c) OLAP servers. [4+6+6]

6. Explain briefly about the following:
(a) Distributed garbage collection
(b) Pointer swizzling. [10+6]
7. Explain in detail about Object Naming and Catalog Management with Site Autonomy. [16]

8. (a) Explain about semi-join reduction in DDB.
(b) Discuss about the distribution of access strategy to different sites. Explain the issues involved and how they are tackled. [8+8]

April/May 2013

Code No: 07A80506
R07
1. (a) Explain about semi-join reduction DDB.
(b) Discuss the problems in query optimization. [8+8]
2. (a) Write about transaction management in DDB.
(b) Write about the concurrency control based on locking in distributed databases. [8+8]

3. Explain about OLAP severs in detail. [16]
4. Write in brief about the following:
(a) Security issues in distributed databases
(b) Privacy issues in distributed databases.
(c) Redundancy problem in distributed databases. [3+3+10]

5. Explain the following approaches:
(a) Write-locks-all
(b) Weighted majority locking. [8+8]
6. (a) Classify 2- phase locking, time stamps and optimistic methods.
(b) Explain Validation using only transaction time stamps. [8+8]

7. (a) Discuss parametric queries in detail.
(b) Prove that the following two queries have the same semantics
PJNAME,DEPTNUMSLDEPTNUM=15EMP
SLDEPTNUM=15PJNAME,DEPTNUMEMP [8+8]
8. Why do client-server object DBMSs primarily employ data shipping architecture while relational DBMSs employ function shipping? [16]

April/May 2012

IV B.Tech II Semester Examinations  :
Distributed Databases :
1. Explain the following :
(a) Multidatabase Concurrency Control.
(b) World Wide Web Architecture and Protocols. [12+4]

2. Write about the following :
(a) Heterogeneous databases
(b) Homogeneous databases
(c) Conceptual schema
(d) Physical schema. [4+4+4+4]

3. Explain the following Authorization and Protection problems :
(a) Site-to-site Protection
(b) User Identication. [8+8]

4. (a) Write about the recovery methods of distributed transactions.
(b) Explain the following:
i. Multiple copies of the data
ii. Granularity of locking. [8+8]

5. Write a short note on the following:
(a) Path Expressions
(b) Rewriting and Algebraic optimization
(c) Path indexes. [5+8+3]

6. (a) What are the eects of computing Joins and Unions? Explain.
(b) Discuss the problems in query optimization. [8+8]

7. (a) Consider the data item x. Let RTM(x)=25 and WTM(x)=20. Let the pair(Ri(x), TS) (Wi (x), TS) denote the read(write) request of transaction Ti on the item x with timestamp TS. Indicate the behaviour of the basic timestamp method with the following sequence of requests.
i. (R1(x), 19), (R2(x), 22), (w3(x), 21)
ii. (W)4(x), 23), (R5(x), 28), (W6(x), 27)
(b) Explain the conservative timestamp method. [10+6]

8. (a) For given EMP and DEPT relations, assuming the necessary attributes a query to give 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 given below. Simplify the query explaining the steps involved.

PJEMP.NAME((EMP JNDEPTNUM=DEPTNUM SLMGRNUM=373DEPT ) DF (SLSAL> 100000 EMP JNDEPTNUM=DEPTNUMSLMGRNUM=373DEPT )
(b) Discuss query processing in detail with an example. [8+8]

April/May 2011

IV B.Tech II Semester Examinations,:
Distributed Databases :
1. (a) Discuss how query optimization is useful in distributed databases.
(b) Discuss the role of optimization graphs in DDB. [8+8]

2. (a) Write about concurrency control based on locking in centralised databases.
(b) Write about the concurrency control based on locking in distributed databases. [8+8]

3. (a) What is Schedule and Concurrency Control, Discuss briefly?
(b) Give the conditions to analyze the serializability of a schedule and the cor-
rectness of a concurrency control mechanism and explain.