Scribd
Upload
26 views

CS 704a

The document discusses topics related to distributed databases including fragmentation transparency, location transparency, rules for defining fragments, reference architecture, simplification of joins between horizontally fragmented relations, qualified relations, idempotency rules, two-phase commit protocol, reasons for moving from a centralized to distributed database, false deadlocks, weighted majority locking, primary copy locking, write-locks-all, JDBC connectivity, loosely and tightly coupled systems, distributed data dictionary management.

Uploaded by

Dr. Soumadip Ghosh
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
26 views

CS 704a

The document discusses topics related to distributed databases including fragmentation transparency, location transparency, rules for defining fragments, reference architecture, simplification of joins between horizontally fragmented relations, qualified relations, idempotency rules, two-phase commit protocol, reasons for moving from a centralized to distributed database, false deadlocks, weighted majority locking, primary copy locking, write-locks-all, JDBC connectivity, loosely and tightly coupled systems, distributed data dictionary management.

Uploaded by

Dr. Soumadip Ghosh
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

CSE 4th Year 7th Semester

DISTRIBUTED DATABASE
Code: CS 704A (Elective-I)

Time: 3 Hour Full Marks – 70

Group-A [Attempt All] 10 × 1

1) PJA [R : qR] implies


(i) [PJA R : qR] (ii) [PJA R : A AND qR] (iii) [PJA R : A OR qR] (iv) None of the above

2) Which of the following refers to the operation of copying and maintaining


database objects in multiple databases belonging to a distributed system?
a) Backup b) Recovery c) Replication d) None of these

3) Distributed database is basically placement of


a) Data and function b) program and control c) data and program
d) data and control

4) Granularity means
a) size of memory b) size of data c) locks d) transaction

5) Which of the following rules must be followed when defining fragments


i) Completeness condition
ii) Reconstruction condition
iii) Disjointness condition
iv) All of the above

6) Top-down approach to the design of data distribution is applicable when


i) We are developing a system from scratch
ii) As the aggregation of existing databases
iii) All of the above
iv) None of the above

7) Which one of the following operations is costly in distributed database


i) Selection
ii) Projection
iii) Join
iv) None of the above

8) Processing locality conflicts with


i) Availability and reliability of distributed data
ii) Workload distribution
iii) Storage cost and availability
iv) None of the above
9) Location transparency can be compared with
i) Fragmentation transparency
ii) Local mapping transparency
iii) Replication transparency
iv) None of the above

10) Local mapping schema depends on the


i) Global relations
ii) Fragments
iii) The type of the local DBMS
iv) None of the above

11) Derived horizontal fragmentation is derived from which combinations of


operations
i) Vertical fragmentation and Semi-join
ii) Horizontal fragmentation and Semi-join
iii) Selection and Union
iv) Projection and Join

Group-B [Attempt any three] 5×3

1) Explain 3-phase commitment protocol. Why is it called non-blocking? (5)

2) Explain quorum-based protocol. (5)

3) What are the pre-emptive and non- pre-emptive methods of


Distributed deadlock detection? (5)

4) Discuss data replication and its advantages and disadvantages. (5)

5) Comment on Network portioning (5)

6) Discuss centralized and distributed deadlock detectors. (5)

7) Comment on Distributed Database Administrator. (5)

8) Discuss Catalog management in Distributed Database Systems. (5)

Group-C [Attempt any three] 15 × 3


1. (a) What do you mean by fragmentation transparency & location transparency?
(b) Describe the reference architecture for distributed databases.
(c) Write the rules to follow when defining fragments.
(d) Describe the objectives of the design of data distribution. 2+6+3+4=15

2. (a) What do you mean by simplification of joins between horizontally fragmented


relations? Explain with an example.
(b) Define the term “Qualified Relation”.
(c) Prove that R IN S = S IN R using R IN S = R DF (R DF S).
(d) Describe the simplification of horizontally fragmented relations using an example.
6 + 2 + 3 + 4 = 15
3. Simplify the following query using the idempotency rules:
a) SELECT ENO
FROM ASG
WHERE (NOT (TITLE = ‘PROGRAMMER’)
AND (TITLE = ‘PROGRAMMER’ OR
TITLE = ‘ELECT.ENG’)
AND NOT (TITLE =’ELECT.ENG’)
OR NAME = ‘J.DAS’
b) Describe the two-phase commit protocol. What are the demerits of this
protocol? 6+6+3=15

4. Justify the following statements: 3 X 5 = 15


a) In DDBMS replication of fragments creates more problems in deadlock detection.
b) Total ordering of schedules is necessary to ensure serializability.
c) Both of local DBA and global DBA are required in DDBMS
d) Semi join reduces network traffic.
e) Top-down approach of distributed database design is applicable for system starting
from scratch

5. (a) Discuss the reasons why an organization with a centralized database system might like to
move to a distributed database environment. Outline the advantages and disadvantages of such a
decision. 6

(b) What is false deadlock? 3


(c) Write notes on any two of the following: 3×2
(i) weighted majority locking
(ii) primary copy locking
(iii) write-locks-all

6. Write short notes on any three of the following: 3 × 5 = 15


a) JDBC connectivity
b) Loosely and tightly coupled system
c) Distributed data dictionary management
d) Two phase commit protocol

You might also like