JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III DISTRIBUTED DATABASES Previous Question Paper (September - 2021 - R18)

B.Tech | III | III-I | R18 | September - 2021

Answer PaperPaper Code: 155AYMaximum Marks: 75Time: 3 hours

Answer any five questions

All questions carry equal marks

Main

115 marks
a

Explain the design requirements and challenges for distributed systems.

8 marks

Answer

The design of a distributed database system must balance local autonomy with global coordination. Key requirements include: Transparency (location, fragmentation, and replication transparency so the system appears as a centralized database), Reliability (the system must continue to function despite individual node failures), Scalability (the ability to handle increased data volumes and user loads by adding nodes), and Performance (minimizing communication overhead and latency).

The primary challenges include: Distributed Query Processing (optimizing queries across multiple nodes to minimize data transfer), Distributed Concurrency Control (maintaining consistency across nodes using protocols like two-phase locking or timestamp ordering), Data Consistency and Replication (ensuring all copies of data reflect the same state), and Heterogeneity (managing differences in hardware, operating systems, and DBMS software across nodes).

b

Discuss how fragmented relation simplification is done.

7 marks

Answer

Fragmented relation simplification is the process of transforming a global query into an optimized query on fragments. This involves several steps:

  1. Selection Simplification: Applying selection predicates to horizontal fragments. If a predicate on a fragment is always false, the fragment is pruned from the query.
  2. Projection Simplification: Removing unnecessary attributes from the query. If a projection is performed on a vertical fragment, only those fragments containing the required attributes are accessed.
  3. Join Simplification: Utilizing the properties of fragmentation to eliminate joins. For example, if two relations are partitioned based on the same join attribute (co-partitioning), the join can be performed locally at each site.
  4. Redundancy Elimination: Identifying and removing redundant operations or redundant fragments that do not contribute to the final result set, often using algebraic equivalences to rewrite the query tree into a more efficient form.
215 marks
a

Explain architectural model for distributed DBMS.

7 marks

Answer

Sign in to view the complete answer paper.

b

Write about different types of fragmentation in detail.

8 marks

Answer

Sign in to view the complete answer paper.

315 marks
a

Explain the phases of query processing in distributed database.

7 marks

Answer

Sign in to view the complete answer paper.

b

Discuss how query optimization is useful in distributed databases.

8 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

Discuss different query optimization issues.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain query processing layers in distributed multi-DBMS.

8 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Write concurrency control mechanisms with suitable examples.

8 marks

Answer

Sign in to view the complete answer paper.

b

Illustrate relaxed concurrency control.

7 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Explain about deadlock management in distributed DBMS.

8 marks

Answer

Sign in to view the complete answer paper.

b

Elaborate on conservative timestamp method.

7 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

Distinguish between parallel and distributed database systems.

8 marks

Answer

Sign in to view the complete answer paper.

b

Write short note on fault-tolerance in distributed systems.

7 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

State various elements of Object oriented data model.

7 marks

Answer

Sign in to view the complete answer paper.

b

Analyze the comparison OODBMS and ORDBMS.

8 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of DISTRIBUTED DATABASES from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for B.Tech CSE III III-I, September - 2021, R18.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in DISTRIBUTED DATABASES

Loading Question Papers

Fetching data from database...