L. J. Institute of Engineering & Technology S.G. Highway, Ahmedabad-382210 IT Department Subject Name: Subject Code: Branch & Semester: Subject Coordinator Name: Sr. No 1. 1 2. 3.

Questions

4. 5. 6. 2. 1. 2. 3. 4. 5. 6.

3. 1. 2. 4. 1. 2. 3.

Distributed Database Application & System 171602 VII-IT Rashmi Chaudhary d Marks

Introduction Distributed concurrency control. Reliability in Distributed DBMS Explain Following transparency for distributed database. (1) Network Transparency (2) Replication Transparency (3) Fragmentation Transparency

Year

7 7 7

Nov- 2011 Nov- 2011 June 2012 Rem

Explain complicating factors of distributed DBMSs. Explain the following terms: (i) Fragmentation transparency (ii) Replication transparency Distinguish between tightly coupled and loosely coupled systems. Overview of Relational DBMS. What is normalization? Explain all normal form with example. What are the various problem areas in DDBS environment? Explain them in details. Describe following operation in context of relation algebra (1) Selection (2) Intersection (3) Theta– Join What is normalization? Explain any one normal form. Explain transaction management in DDBMS.

7 4

June 2012 Rem Dec 2012

4

Dec 2012

7 7

Nov- 2011 Nov- 2011

7

Consider the following relation employee (person-name, street, city) works(person-name. company-name, salary) company(company-name, city) manages(person-name,, manager-name) Write following query in relational algebra form. (1) Find names of all employees who work for First Bank Corporation (FBC). (2) Find the names of all employees who live in the same city as the company for which they work. (3) Find names, street addresses and cities of residence of all employees who work for FBC and earn more than $10,000 per year Review of Computer Networks. What are the various types of network? Explain each in detail. Explain type of networks topology. Distributed DBMS Architecture. Draw and explain various components of Distributed DBMS. Explain the Client server architecture for Distributed DBMS with figure. Explain MDBS architecture with and without GCS.

6

June 2012 Rem June 2012 June 2012 Rem Dec 2012

7 7

Nov-2011 June 2012

7 7

7 7,4 7

Nov-2011 Nov-2011 Dec 2012 Nov-2011

4. 5. 6. 7. 8. 5. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11.

7 Explain Client – Server architecture with figure. 7 Explain peer – peer architecture with figure. 2 What is site autonomy in distributed DBMS? Explain in brief. 7 Explain peer-to-peer distributed systems. What are the major Distributed DBMS components? Explain each in 7 detail with proper diagram. Distributed Database Design. Explain Set oriented assertions and its enforcement with example. What is allocation? List the information requirements during allocation. Which process of DDBS design is used when we wanted to design DDBS from scratch? Also draw and explain that process. Explain reduction for hybrid fragmentation. Explain Top Down Design Process for distributed database design. Describe COM_MIN algorithm used in horizontal fragmentation. Describe BEA algorithm used in vertical fragmentation. List Distribution design issue and explain any one of them. Under which situations will it be beneficial to have replication or fragmentation of data? Explain top-down and bottom-up design strategies. Differentiate between partitioned and replicated databases. Discuss the fundamental issues while designing a distributed database.

June 2012 June 2012 Dec 2012 Dec 2012 Dec 2012

7 7

Nov-2011 Nov-2011

7

Nov-2011

7 7 7 7 7 3

Nov-2011 June 2012 Rem June 2012 June Rem 2012 June Rem 2012 Rem2012 Dec

7 7

Dec 2012 Dec 2012

1.

6. 1. 2. 7. 1. 2. 3. 4.

Given the following relational database.

14

Typical queries from applications are: At the controlling department located in Geneva: A1 SELECT P.ProjNo, P.Budget, PA.EmpNo, PA.MonthsSpent FROM Projects P, ProjectAssignments PA WHERE P.ProjNo = PA.ProjNo AND P.Budget < 110000 A2 SELECT PA.EmpNo, PA.ProjNo, PA.MonthsSpent FROM Employees E, ProjectAssignments PA WHERE E.EmpNo = PA.EmpNo AND E.Salary > 11500 At the human resource department located in Munich: A3 SELECT * FROM Employees E A4 SELECT E.*, PA.MonthsSpent FROM Employees E, ProjectAssignments PA WHERE E.EmpNo = PA.EmpNo At the sales coordination department located in Zurich: A5 SELECT * FROM Projects WHERE Location != “Geneva” 1) For the relations Employees and Projects, determine minimal sets of simple predicates. 2) What are the corresponding fragments of the two relations Employees and Projects? Semantic Data Control. 7 Explain views in distributed DBMS. Also what is data security in DDBS. Explain individual assertion for distributed semantic integrity control. 7 Overview of Query Processing. Explain Database interoperability. Parallel database systems Draw and explain query optimization process. Explain Layers of Query Processing.

7 7 7 7

Nov2011

Nov2011 June 2012 Rem Nov2011 Nov2011 Nov2011 June 2012 Rem

5.

Give objective of query processing in view of distributed database.

7

6.

List steps of query decomposition and explain any one from that.

7

7.

What is query optimization? List components of query optimizer software and explain any one from that.

7

8.

What is query processing in a relational database? Explain in detail 7 with an example. How does it differ from distributed query processing? Consider a relation that is fragmented horizontally by plant-number: 7 employee (name, address, salary, plant-number) Assume each fragment has two replicas (1) stored at the New York site (2) locally at the plant site. Describe a good processing strategy for the following queries entered at the San Jose site. a. Find all employees at the Boca plant. b. Find the average salary of all employees. c. Find the highest-paid employee at each of the following sites: Toronto, Edmonton, Vancouver, Montreal d. Find the lowest-paid employee in the company Explain view management in centralized as well as distributed DBMS. 6 What do you mean by query optimization? Explain System R 7 (centralized) query optimization algorithm. Explain various transaction states and properties in detail. 7

Dec 2012

Explain partitioning algorithm. 7 Explain Levels of data and process distribution in distributed 5 environment. What is distributed transaction and how does if differ from remote 4 transaction? Explain with an example. Consider a failure that occurs during 2PC for a transaction. For each 7 possible failure, explain how 2PC ensures transaction atomicity despite the failure? Differentiate individual assertion and self-oriented assertion and how 7 to enforce these assertions in DDBMS? What is authorization control? How do imply authorization control in a 7 distributed environment?

Nov-2011 Dec 2012

9.

10. 11. 12. 1. 2. 3. 4. 5. 6.

June 2012 Rem June 2012 Rem June 2012 Rem

Dec 2012

Dec 2012 Dec 2012 Dec 2012

Dec 2012 Dec 2012 Dec 2012 Dec 2012