JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III DISTRIBUTED DATABASES Previous Question Paper (September - 2021 - R18)
Answer any five questions
All questions carry equal marks
Main
Explain the design requirements and challenges for distributed systems.
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).
Discuss how fragmented relation simplification is done.
Answer
Fragmented relation simplification is the process of transforming a global query into an optimized query on fragments. This involves several steps:
- Selection Simplification: Applying selection predicates to horizontal fragments. If a predicate on a fragment is always false, the fragment is pruned from the query.
- 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.
- 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.
- 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.
Explain architectural model for distributed DBMS.
Answer
Sign in to view the complete answer paper.
Write about different types of fragmentation in detail.
Answer
Sign in to view the complete answer paper.
Explain the phases of query processing in distributed database.
Answer
Sign in to view the complete answer paper.
Discuss how query optimization is useful in distributed databases.
Answer
Sign in to view the complete answer paper.
Discuss different query optimization issues.
Answer
Sign in to view the complete answer paper.
Explain query processing layers in distributed multi-DBMS.
Answer
Sign in to view the complete answer paper.
Write concurrency control mechanisms with suitable examples.
Answer
Sign in to view the complete answer paper.
Illustrate relaxed concurrency control.
Answer
Sign in to view the complete answer paper.
Explain about deadlock management in distributed DBMS.
Answer
Sign in to view the complete answer paper.
Elaborate on conservative timestamp method.
Answer
Sign in to view the complete answer paper.
Distinguish between parallel and distributed database systems.
Answer
Sign in to view the complete answer paper.
Write short note on fault-tolerance in distributed systems.
Answer
Sign in to view the complete answer paper.
State various elements of Object oriented data model.
Answer
Sign in to view the complete answer paper.
Analyze the comparison OODBMS and ORDBMS.
Answer
Sign in to view the complete answer paper.