JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

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

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

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

Answer any five questions. All questions carry equal marks.

Main

115 marks
a

Explain about Horizontal and vertical fragmentation strategies with examples.

8 marks

Answer

Fragmentation is the process of partitioning a global relation into smaller fragments to improve performance and data locality. There are two primary strategies:

Horizontal Fragmentation: This strategy partitions a relation by selecting specific rows (tuples) based on a predicate. Each fragment contains a subset of the tuples of the original relation, but all attributes are preserved. For example, in a global table 'Employee' with attributes (EmpID, Name, Dept), a horizontal fragment for the 'Sales' department would include all attributes for only those rows where Dept = 'Sales'.

Vertical Fragmentation: This strategy partitions a relation by selecting specific columns (attributes) based on their usage patterns. Each fragment contains a subset of attributes, but all tuples are preserved. A primary key must be included in every fragment to allow for reconstruction via natural join. For example, in the same 'Employee' table, one fragment might contain (EmpID, Name) for personal records, while another contains (EmpID, Salary) for payroll processing.

b

What are the features of the reference architecture for distributed databases?

7 marks

Answer

The reference architecture for distributed databases (often based on the ANSI/SPARC model) provides a framework for managing data distribution and independence through several key features:

  • Global Conceptual Schema (GCS): Provides a unified view of the entire database, hiding the fact that data is distributed across multiple sites.
  • Fragmentation Schema: Defines how relations are partitioned into fragments. It maps the GCS to the fragments, ensuring that the user does not need to know where specific data resides.
  • Allocation Schema: Maps the fragments to specific physical sites in the network. This layer manages data replication and placement to optimize query performance.
  • Local Mapping Schema: Defines the mapping between the fragments and the local database management systems (LDBMS) at each site, allowing for heterogeneity in local storage.
  • Data Independence: The architecture ensures both logical and physical data independence, meaning changes to the distribution or local storage do not affect the global user queries.
215 marks
a

What is an operator tree of a query? What is the use of operator graph? Discuss.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain the procedure for simplifying joins between horizontally fragmented relations.

8 marks

Answer

Sign in to view the complete answer paper.

3

Explain the following with respect to distributed databases:

15 marks
a

Operations in parametric query

7 marks

Answer

Sign in to view the complete answer paper.

b

GROUP by operation for evaluating aggregate functions.

8 marks

Answer

Sign in to view the complete answer paper.

415 marks
a

What are the objectives of query processing optimization? Explain.

7 marks

Answer

Sign in to view the complete answer paper.

b

How an optimization graph can be drawn for a given query? Discuss.

8 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Explain about semi-join reduction in distributed databases

8 marks

Answer

Sign in to view the complete answer paper.

b

Discuss the differences between distributed join and non-distributed join.

7 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Write about the computational structure of distributed transaction.

7 marks

Answer

Sign in to view the complete answer paper.

b

Distinguish between preemptive and non-preemptive methods for deadlock prevention.

8 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

Explain the optimistic approach to concurrency control in distributed databases.

8 marks

Answer

Sign in to view the complete answer paper.

b

What are the issues related to query processing and load balancing in parallel database systems? Discuss.

7 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

What is object management architecture? Explain.

8 marks

Answer

Sign in to view the complete answer paper.

b

Explain the architecture of CORBA.

7 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, March - 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...