JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III Year DISTRIBUTED DATABASES Previous Question Paper (July/August - 2023 - R18)
Note: i) Question paper consists of Part A, Part B. ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions. iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.
Part A
What are the distribution design issues?
Answer
Distribution design in a distributed database system involves deciding how to fragment, allocate, and replicate data across multiple sites to optimize performance and reliability. The primary issues include:
- Fragmentation: The process of partitioning a global relation into smaller, logical units called fragments. This involves deciding between horizontal fragmentation (selecting tuples based on a predicate), vertical fragmentation (selecting attributes), or mixed fragmentation. The key challenge is ensuring completeness, reconstruction, and disjointness of the fragments.
- Allocation: Once fragments are defined, the system must determine which site each fragment should be stored at. The goal is to minimize communication costs during query processing while maintaining load balancing and availability.
- Replication: Deciding whether to store multiple copies of the same data fragment at different sites. While replication increases data availability and read performance, it introduces significant complexity in maintaining data consistency and synchronization across all copies during update operations.
- Data Placement Strategy: Balancing the trade-off between local access efficiency and the overhead of distributed transaction management.
What are the information requirements during allocation?
Answer
During the allocation process in a distributed database system, the goal is to determine the optimal placement of data fragments across various network sites to minimize communication costs and response time. The information requirements for this process are categorized as follows:
- Database Information: This includes the cardinality of each fragment (number of tuples), the size of each tuple, and the selectivity of the fragments. These metrics are essential to estimate the storage requirements and the volume of data transferred during query execution.
- Application Information: This involves identifying the access frequency of each application (query or transaction) to specific fragments, the type of access (read vs. write), and the site of origin for each application. This data helps in placing fragments closer to the sites where they are most frequently requested.
- Site Information: This includes the storage capacity, processing speed, and reliability of each site in the network. It also accounts for the cost of storage and the cost of processing at individual nodes.
- Network Information: This covers the communication cost per unit of data between sites and the bandwidth/latency characteristics of the network links. This is critical for calculating the total cost of distributed query processing and data replication.
What are the layers of query processing?
Answer
Sign in to view the complete answer paper.
What is query optimization?
Answer
Sign in to view the complete answer paper.
What are the types of Transaction?
Answer
Sign in to view the complete answer paper.
What is meant by deadlock? List out the conditions for deadlock?
Answer
Sign in to view the complete answer paper.
What is meant by network partitioning?
Answer
Sign in to view the complete answer paper.
What are the reliability protocols in distributed systems?
Answer
Sign in to view the complete answer paper.
What are the applications of object identification?
Answer
Sign in to view the complete answer paper.
What is meant by distributed object storage?
Answer
Sign in to view the complete answer paper.
Part B
Explain the principles of distributed databases.
Answer
Sign in to view the complete answer paper.
Explain about Architectural Models for DDBMS.
Answer
Sign in to view the complete answer paper.
Explain Briefly about DDBMS Architecture.
Answer
Sign in to view the complete answer paper.
Briefly explain distributed data processing.
Answer
Sign in to view the complete answer paper.
Explain about query processing problems.
Answer
Sign in to view the complete answer paper.
Explain briefly about query decomposition and data localization.
Answer
Sign in to view the complete answer paper.
Briefly describe the characterization of query processors.
Answer
Sign in to view the complete answer paper.
Explain any one distributed query optimization algorithm.
Answer
Sign in to view the complete answer paper.
Briefly explain transaction management.
Answer
Sign in to view the complete answer paper.
Explain deadlock management.
Answer
Sign in to view the complete answer paper.
Explain different optimistic methods for distributed concurrency control.
Answer
Sign in to view the complete answer paper.
Explain the distributed deadlock detection.
Answer
Sign in to view the complete answer paper.
Explain the failures in DDBMS.
Answer
Sign in to view the complete answer paper.
What are different types of Parallel databases architecture?
Answer
Sign in to view the complete answer paper.
Briefly explain fault-tolerance in distributed systems.
Answer
Sign in to view the complete answer paper.
What is parallel data placement? Explain with an example?
Answer
Sign in to view the complete answer paper.
Explain Fundamental object concepts with an example.
Answer
Sign in to view the complete answer paper.
Briefly explain persistence of objects.
Answer
Sign in to view the complete answer paper.
Comparison between OODBMS and ORDBMS.
Answer
Sign in to view the complete answer paper.
Explain object query processing with example.
Answer
Sign in to view the complete answer paper.