Printed pages: 2 Sub Code: MTCS041

Paper Id: 210207 Roll No.                    

M. TECH.
(SEM-II) THEORY EXAMINATION 2017-18
DISTRIBUTED DATA BASE

Time: 3 Hours Total Marks: 70

Note: Attempt all Sections. If you require any missing data; then choose suitably.

SECTION – A
1. You are required to answer all the parts of this question. (2×7=14 marks)
(a) Define data replication.
(b) Explain the concept of transaction.
(c) Explain R* Algorithm.
(d) List the types of Distributed DBMS Architecture.
(e) What is query decomposition?
(f) Define atomicity in distributed database.
(g) Define Granularity of locks.
SECTION – B
2. Attempt any three parts of the following: (7×3=21 marks)
(a) Explain conflict serializability with suitable example.
(b) Define reliability. Write short notes on non blocking commitment protocols.
(c) Write short notes on redundant and non redundant databases.
(d) Explain 2 Phase commitment protocol.
(e) Explain SDD-1 Algorithm

SECTION – C
3. Attempt any one part of the following: (7×1=7 marks)
(a) Explain query execution with example.
(b) Explain Object query processor architecture.
4. Attempt any one part of the following: (7×1=7 marks)
(a) Explain Multi database concurrency control.
(b) Explain PUSH based technology in distributed databases.
.
5. Attempt any one part of the following: (7×1=7 marks)

 
 
 (a) Explain the architecture of a distributed database management function with
diagrammatic illustration.
(b) Give brief details of Distributed Deadlocks.
6. Attempt any one part of the following: (7×1=7 marks)
(a) What is a query? Explain query optimization techniques in details.
(b) Define Transactions. Explain the different properties of transactions

7. Attempt any one part of the following: (7×1=7 marks)

(a) Explain concurrency control based on Time stamps in distributed databases.
(b) Write short notes on allocation techniques for distributed database design.