1. Define Distributed Database.
2. Why distributed databases are essential?
3. What are the components of DDBMS?
4. What do you mean by DBMS standardization?
5. What are the three kinds of distributed dbms architecture?
6. What is Horizontal Fragmentation?
7. What is Vertical Fragmentation?
8. What is meant by Partitioning Algorithms?
9. What are the distribution design issues?
10. What is meant by hybrid fragmentation?
11. What are the information requirements during allocation?
12. What do you mean by data security?
PART – B (16 Marks):-
1. Explain the advantages & disadvantages of distributed database.
2. Explain Briefly about DDBMS Architecture.
3. Explain about Architectural Models for DDBMS.
4. Explain about DBMS Standardization? Give Examples.
5. What are the distribution design issues? Explain with examples.
6. Explain briefly about Fragmentation with suitable examples.
7. Explain allocation model.
8. Explain views in centralized DBMSs with examples.
UNIT- 2:
PART – A (2 Marks):-
1. What is meant by query processing?
2. What are the objectives of query processing?
3. What are the layers of query processing?
4. What is query optimization?
5. What is meant by query Decomposition?
6. Give an example o operation tree?
7. What is meant by R* algorithm?
PART – B (16 Marks):-
1. Explain about Complexity of relational algebra operations.
2. Explain query processing with examples.
3. Briefly describe the characterization of query processors.
4. Explain distributed query optimization algorithms.
5. Explain briefly about query decomposition & data localization.
6. Explain about query processing problems.
UNIT- 3:
PART – A (2 Marks):-
1. Define Transaction?
2. What are the termination conditions of transaction?
3. What are the properties of transaction?
4. What are the types of Transaction?
5. What are the types of workflow?
6. What are the classifications of concurrency control?
7. What is meant by deadlock?
PART – B (16 Marks):-
1. Explain briefly about transaction management.
2. Explain serializability theory with an example.
3. Explain briefly about timestamp-based concurrency algorithms.
4. Explain relaxed concurrency control.
UNIT- 4:
PART – A (2 Marks):-
1. Define Reliability?
2. What are the reliability concepts?
3. What are the types of failures in distributed DBMS?
4. What is meant by network partitioning?
5. Draw a diagram of logging interface.
6. What are the reliability protocols in distributed systems?
7. What are the parallel execution problems?
8. What are the executions of LRM commands?
9. What is meant by parallel database.
PART – B (16 Marks):-
1. Explain the failures in DDBMS.
2. Explain by means of a diagram the interface between the local recovery manager & buffer
manager.
3. Draw a diagram for fully memory hierarchy managed by LRM and BM.
4. Draw a diagram of state transactions in 3PC protocols.
5. Explain briefly about network partitioning.
6. Explain general architecture of a parallel database system & shared memory architecture.
7. Explain through diagrams the following
A. Shared disk architecture.
B. Shared nothing architecture.
C. Hierarchical architecture.
D. Cache-only memory architecture.
8. Explain about parallel execution for hierarchical architecture.
UNIT- 5:
PART – A (2 Marks):-
1. Define abstract data types.
2. What are the kinds of object distribution design?
3. What is meant by Pointer Swizzling?
4. What do you mean by horizontal class partitioning?
5. What do you mean by Vertical class partitioning?
6. How do you perform object management?
7. What is meant by distributed object storage?
PART – B (16 Marks):-
1. Explain briefly about architectural issues in distributed object DBMS?
2. Explain about Partitioning algorithms
3. Explain briefly about object storage.
4. Explain briefly about transaction management through examples.
