JNTU

JNTU MCA 2021 DISTRIBUTED DATABASES Previous Question Paper (February - 2021 - R17)

MCA | 2021 | V | R17 | February - 2021

Answer PaperPaper Code: 845ADMaximum Marks: 75Time: 2 hours

Answer any five questions. All questions carry equal marks.

Main

1

Explain the reference architecture for distributed databases.

15 marks

Answer

The reference architecture for distributed databases is designed to manage data across multiple sites while maintaining the illusion of a single, centralized database for the user. It is structured into three main levels of abstraction to ensure data independence and transparency.

The architecture is defined by the following components:

  • External Schema Level: This level consists of various user views or application-specific schemas. It provides the necessary data transparency by allowing users to interact with the database without needing to know the physical location or distribution of the data.
  • Conceptual Schema Level: This is the global logical schema that describes the entire database as if it were centralized. It defines all entities, relationships, and constraints, serving as the integration point for all distributed data fragments.
  • Internal Schema Level: This level deals with the physical distribution and storage of data. It maps the global conceptual schema to the local schemas at individual sites. It includes details about data fragmentation (horizontal or vertical), replication, and the specific data models used at each local site.

The mapping between these levels is managed by the Distributed Database Management System (DDBMS) through the following mechanisms:

  • Fragmentation Schema: Defines how global relations are partitioned into smaller fragments.
  • Allocation Schema: Specifies the physical location of each fragment across the network nodes.
  • Local Mapping: Maps the fragments to the physical storage structures at each local database site.

This layered approach enables Distribution Transparency, where the system hides the complexity of data distribution, fragmentation, and replication from the end-user, ensuring that queries are executed efficiently regardless of where the data resides.

215 marks
a

What is the criteria for checking the correctness of fragmentation? Explain.

7 marks

Answer

The correctness of data fragmentation is evaluated based on three fundamental criteria: Completeness, Reconstruction, and Disjointness.

  1. Completeness: This ensures that every data item in the global relation is mapped to at least one fragment. No data is lost during the fragmentation process.
  2. Reconstruction: This ensures that the original global relation can be reconstructed from the fragments using relational operators like Join or Union. If a relation is decomposed into fragments F1, F2, ..., Fn, there must exist a relational algebra expression such that R = ∇(F1, F2, ..., Fn).
  3. Disjointness: This requires that each data item (except for primary keys in horizontal fragmentation) resides in only one fragment. This avoids data redundancy and ensures consistency, as updates do not need to be propagated across multiple fragments for the same data instance.
b

What are integrity constraints? Explain with examples.

8 marks

Answer

Sign in to view the complete answer paper.

3

Explain global query optimization using distributed data manager method.

15 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

How fragmented relation simplification is done? Explain.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain about semi-join reduction in distributed databases.

7 marks

Answer

Sign in to view the complete answer paper.

5

Prove that 2-phase locking is a correct distributed concurrency control method.

15 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Explain about log-write-ahead protocol.

7 marks

Answer

Sign in to view the complete answer paper.

b

State on the validity of serializability as a correctness criterion.

8 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

Explain quorum-based commitment protocols.

7 marks

Answer

Sign in to view the complete answer paper.

b

With examples, explain how to detect inconsistencies in distributed databases.

8 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

Write about detection based cache consistency algorithms.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain attribute-to-entity transformation with an example.

7 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the solved question paper with answers of DISTRIBUTED DATABASES from JNTU for MCA 2021 V, February - 2021, R17.

For the question paper without answers, switch to the Question Paper tab.

Other papers in DISTRIBUTED DATABASES

Loading Question Papers

Fetching data from database...