Programme: III B.

TechI Sem
Department: CSE
Academic Year: 2024-25
Course Name: Distributed Database
Faculty Name: Mrs. GATTU SUDHA

Taxonomy Level: Understand/Create/Remember/Apply/Analyze/Evaluate

UNIT 1

2 MARKS
S.N Question Taxonomy CO PI
o Level
1 Define DDBS. C316.
Remember 2.7.2
2
2 Define distributed processing. Remember C316. 2.7.2
2
3 What is optimality. Remember C316. 2.7.2
2
4 Define Fragmentation. Remember C316. 2.7.2
2
5 Define Transmission cost function. Remember C316. 2.7.2
2

3 MARKS
S.N Question Taxonomy CO PI
o Level
1 Identify the layers at which the services of Analyze C316. 2.7.2
transparency can be provided. 2
2 Discuss top-down Design process. Analyze C316. 2.7.2
2
3 Discuss about types of Transparency. Analyze C316. 2.7.2
2
4 Discuss about clustering algorithm. Analyze C316. 2.7.2
2
5 Discuss about partitioning algorithm. Analyze C316. 2.7.2
2

5 MARKS
S.N Question Taxonomy CO PI
o Level
1 Explain horizontal fragmentation. Remember C316.
1
1.2.2
2 Explain vertical fragmentation. Remember C316.
1
1.2.2
3 Discuss about DBMS Standardization. Remember C316. 2.7.2
2
4 Discuss about Architectural models for Remember C316. 2.7.2
Distributed DBMSs. 2
5 Discuss about distribution Design Issues. Remember C316. 2.7.2
2

10 MARKS
S.N Question Taxonomy CO PI
o Level
1 Discuss about the problem areas of Remember C316.
DDBMSs. 1
1.2.2
2 Demonstrate DDMBS Architecture. Remember C316.
1
1.2.2
3 Explain methods for allocation. Remember C316.
1
1.2.2
4 Illustrate about promises of DDBSs. Remember C316.
1
1.2.2
5 Explain methods in detail for Remember C316.
Fragmentation. 1
1.2.2

UNIT 2

2 MARKS
S.N Question Taxonomy CO PI
o Level
1 What is a query processor. Remember C316.3 1.2.2,2.6.2
2 What is optimization timing. Remember C316.3 1.2.2,2.6.2
3 What is search space? Remember C316.3 1.2.2,2.6.2
4 Define cost function. Remember C316.3 1.2.2,2.6.2
5 What is search stratergy? Remember C316.3 1.2.2,2.6.2

3 MARKS
S.N Question Taxonomy CO PI
o Level
1 Discuss about reduction of Primary Remember
C316.3 1.2.2,2.6.2
horizontal Fragmentation.
2 Discuss about reduction of vertical Remember C316.3 1.2.2,2.6.2
Fragmentation and derived
fragmentation.
3 Discuss about the characterization of Remember C316.3 1.2.2,2.6.2
query processors.
4 Discuss about SDD-1 Algorithm. Remember C316.3 1.2.2,2.6.2
5 Discuss about hybrid query Remember C316.3 1.2.2,2.6.2
optimization algorithm

5 MARKS
S.N Question Taxonomy CO PI
o Level
1 Explain the given below from query Remember
decomposition with example
C316.3 1.2.2,2.6.2
i) Normalization
ii) Analysis
2 Explain the given below from query Remember C316.3 1.2.2,2.6.2
decomposition with example
i) Elimination of Redundancy
ii) Rewriting
3 Explain the given below from Remember C316.3 1.2.2,2.6.2
centralized query optimization
i) INGRES Algorithm
ii) System R Algorithms
4 Explain the given below from Join Remember C316.3 1.2.2,2.6.2
Ordering in fragment queries
i) Join ordering
ii) Semi-join based algorithms
5 Explain the given below from Remember C316.3 1.2.2,2.6.2
Distribution query optimization
i) Distributed INGRES Algorithm
ii) R* Algorithms

10 MARKS
S.N Question Taxonomy CO PI
o Level
1 Illustrate about the Layers of Query Remember
C316.3 1.2.2,2.6.2
Processing
2 Discuss about Query Decomposition in Remember C316.3 1.2.2,2.6.2
detail.
3 Discuss about the Localization of Remember C316.3 1.2.2,2.6.2
Distributed Data.
4 Discuss about static and dynamic Remember C316.3 1.2.2,2.6.2
centralized query optimization
algorithms in detail with examples.
5 Discuss about static and dynamic Remember
Distributed Query Optimization C316.3 1.2.2,2.6.2
algorithm in detail with examples.

UNIT 3

2 MARKS
S.N Question Taxonomy CO PI
o Level
1 Describe Distributed Concurrency Understand
C316.4 1.2.2,2.6.2
Control.
2 Define is Serializability? Remember C316.4 1.2.2,2.6.2
3 Define the one phase &two-phase Remember
C316.4 1.2.2,2.6.2
locks.
4 What is WAIT-DIE Rule. Remember C316.4 1.2.2,2.6.2
5 What is WOUND-WAIT Rule. Understand C316.4 1.2.2,2.6.2
 3 MARKS
S.N Question Taxonomy CO PI
o Level
1 Discuss about serializability theory. Understanding C316.4 1.2.2,2.6.2
2 Explain properties of transaction Analyze
C316.4 1.2.2,2.6.2
management.
3 Discuss about Deadlock Avoidance. Remember C316.4 1.2.2,2.6.2
4 Discuss about optimistic concurrency Analyze
C316.4 1.2.2,2.6.2
control algorithms.
5 Discuss about deadlock prevention. Remember C316.4 1.2.2,2.6.2

5 MARKS
S.N Question Taxonomy CO PI
o Level
1 Discuss about strict 2PL Analyze
C316.4 1.2.2,2.6.2
lockingmanager with algorithm.
2 Discuss about centralized 2PLwith Remember
C316.4 1.2.2,2.6.2
algorithm.
3 Explain about Optimistic Concurrency Analyze
C316.4 1.2.2,2.6.2
Control Algorithm.
4 Discuss about basic TO Algorithm. Analyze C316.4 1.2.2,2.6.2
5 Discuss about Deadlock Detection and Remember
C316.4 1.2.2,2.6.2
Resolution.

10 MARKS
S.N Question Taxonomy CO PI
o Level
1 Discuss about basic locking algorithm. Analyze C316.4 1.2.2,2.6.2
2 Illustrate about various types of Remember
C316.4 1.2.2,2.6.2
transactions.
3 Discuss about the Time-stamped based Analyze
C316.4 1.2.2,2.6.2
concurrency algorithms.
4 Discuss in detail about three-phase Analyze
commit protocol and its recovery in C316.4 1.2.2,2.6.2
detail.
5 Discuss about deadlock Remember
management in distributed C316.4 1.2.2,2.6.2
databases.

Unit 4
Two(2) Marks Questions
S.N Question Taxonomy CO PI
o Level
1 Define Reliability. Remember C316.5 1.2.2,2.6.2
2 Define Redo&Undo. Remember C316.5 1.2.2,2.6.2
3 Explain about Inplace and out place Understand C316.5 1.2.2,2.6.2
updating
4 Define checkpointing. Remember C316.5 1.2.2,2.6.2
5 Define Availability. Remember C316.5 1.2.2,2.6.2

Three(3) MarksQuestions
S.N Question Taxonomy CO PI
o Level
1 Discuss about sources of system Understand C316.5 1.2.2,2.6.2
failure.
2 Discuss about several LRM Commands Remember C316.5 1.2.2,2.6.2
3 Discuss about termination protocols Remember C316.5 1.2.2,2.6.2
for 2PC
4 Discuss about 2PC-Coordinator – Remember C316.5 1.2.2,2.6.2
Terminate Algorithm.
5 Discuss about parallel Database Remember C316.5 1.2.2,2.6.2
System General Architecture using di
agram.

Unit 4
Five(5) MarksQuestions
S.N Question Taxonomy CO PI
o Level
1 Discuss about the fault tolerance in Remember C316.5 1.2.2,2.6.2
distributed DBMS.
2 Discuss about the failures in Distributed DBMS. Remember C316.5 1.2.2,2.6.2
3 Discuss about Architectural Remember C316.5 1.2.2,2.6.2
considerations in local reliability
protocols.
4 Discuss about Recovery Remember C316.5 1.2.2,2.6.2
information in local reliability
protocols.
5 Discuss about Load balancing Remember C316.5 1.2.2,2.6.2
techniques used in parallel execution
problems.

10 MARKS

S.N Question Taxonomy CO PI

o Level
1 Discuss about the different failures in Remember C316.5 1.2.2,2.6.2
Distributed DBMS.
2 Illustrate local reliability protocol Remember C316.5 1.2.2,2.6.2
3 Illustrate distributed reliability Remember C316.5 1.2.2,2.6.2
protocol.
4 Discuss about 2-phase commit Remember C316.5 1.2.2,2.6.2
protocol
5 Discuss in detail about Network Remember C316.5 1.2.2,2.6.2
partitioning
 UNIT 5
Two(2) MarksQuestions
S.N Question Taxonomy CO PI
o Level
1 Define OODBMS. Remember C316.6 3.6.1
2 Define ORDBMS. Remember C316.6 3.6.1
3 Define Object. Remember C316.6 3.6.1
4 Explain about Abstract data type. Understand C316.6 3.6.1
5 Describe Replication Understand C316.6 3.6.1

Unit 5
Three(3) MarksQuestions
S.N Question Taxonomy CO PI
o Level
1 Define object distributed design Remember C316.6 3.6.1
2 Classify the architectural issues Analyze C316.6 3.6.1
3 Discuss aboutobject identifier management Remember C316.6 3.6.1
4 Define distributed object clustering Remember C316.6 3.6.1
5 Define the Object query Processing. Remember C316.6 3.6.1

Unit 5
Five(5) MarksQuestions
S.N Question Taxonomy CO PI
o Level
1 Compare the OODBMS and ORDBMS Analyze C316.6 3.6.1
2 Explain about comparison Fundamental object Understand C316.6 3.6.1
concepts and models.
3 Discuss about the architectural issues of Understand C316.6 3.6.1
client/server architectures.
4 Discuss about Pointer Swizzling and object Remember C316.6 3.6.1
migration.
5 Discuss about Query processing issues. Remember C316.6 3.6.1

10 MARKS
S.N Question Taxonomy CO PI
o Level
1 Discuss about the fundamental object Understand C316.6 3.6.1
concepts and object models.
2 Discuss about the architectural issues in Understand C316.6 3.6.1
distributed object DBMS.
3 Discuss about object distribution design in Understand C316.6 3.6.1
distributed object DBMS.
4 Discuss about management and storage in Understand C316.6 3.6.1
distributed databases.
5 Discuss about query processing issues in Understand C316.6 3.6.1
distributed object DBMS.

Course Instructor
HOD