MCA 3rd Year 5th Semester [Year:-2008]

DISTRIBUTED DATABASE MANAGEMENT

Code: MCA E-501A

Time: 3 Hour Full Marks – 70

Group-A [Attempt All] 10 × 1

1) Which of the following operation is mostly used in distributed database

i) Union
ii) Selection
iii) Cartesian product
iv) Semi-join

2) Data independence in centralized database can be compared with which of the

following concept in distributed database
i) Conceptual schema
ii) Global Optimization
iii) Concurrency control
iv) Distribution transparency

3) Which of the feature is important aspects of a distributed database

i) Distribution
ii) Logical correlation
iii) Both
iv) None of the above

4) Which of the following rules must be followed when defining fragments

i) Completeness condition
ii) Reconstruction condition
iii) Disjointness condition
iv) All of the above

5) Top-down approach to the design of data distribution is applicable when

i) We are developing a system from scratch
ii) As the aggregation of existing databases
iii) All of the above
iv) None of the above

6) Which one of the following operations is costly in distributed database

i) Selection
ii) Projection
iii) Join
iv) None of the above
 7) Processing locality conflicts with
i) Availability and reliability of distributed data
ii) Workload distribution
iii) Storage cost and availability
iv) None of the above

8) Location transparency can be compared with

i) Fragmentation transparency
ii) Local mapping transparency
iii) Replication transparency
iv) None of the above

9) Local mapping schema depends on the

i) Global relations
ii) Fragments
iii) The type of the local DBMS
iv) None of the above

10) Derived horizontal fragmentation is derived from which combinations of

operations
i) Vertical fragmentation and Semi-join
ii) Horizontal fragmentation and Semi-join
iii) Selection and Union
iv) Projection and Join

Group-B [Attempt any three] 5×3

1) Explain 3-phase commitment protocol. Why is it called non-blocking?

2) Prove that R IN S = S IN R using R IN S = R DF (R DF S).

3) Prove that [R : qR] SJF [S : qS] => [R SJF S : qR AND qS AND F]

4) Discuss data replication and its advantages and disadvantages.

5) Discuss the database profile for Selection operation.

6) Given two relations: DEPT (DEPTNO, NAME, AREA, MGRNO) and

EMP (EMPNO, NAME, SAL, TAX, MGRNO, DEPTNO).
Draw the ‘modified’ operator tree for the query, which gives the names of employees
who work in a department whose manager has number 73 but don’t earn more than
Rs.25,000.
 Group-C [Attempt any three] 15 × 3

1. (a) What do you mean by fragmentation transparency & location transparency?

(b) Describe the reference architecture for distributed databases.
(c) Write the rules to follow when defining fragments.
(d) Describe the objectives of the design of data distribution. 2+6+3+4=15

2. (a) What do you mean by local mapping transparency & replication transparency?
(b) Consider the following global, fragmentation, and allocation schemata:

Global Schema: STUDENT (ROLL, NAME, DEPT)

Fragmentation Schema: STUDENT1 = SLDEPT=”IT” STUDENT

STUDENT2 = SLDEPT=”CS” STUDENT

Allocation Schema: STUDENT1 at sites 1, 2

STUDENT2 at sites 3, 4
[Assume that “IT” and “CS” are the only possible values for DEPT attribute]

(i)Write an application that requires the roll number of a student from the terminal
and outputs the name and department, at levels 1, 2, and 3 of transparency.
(ii)Write an application that moves the student having roll number 432 from
department “IT” to department “CS”, at levels 1, 2, and 3 of transparency. 3+12=15

3. (a) What is Mixed Fragmentation? Explain with an example.

(b) Consider the following global, fragmentation, and allocation schemata:

Global Schema: SUPPLIER (SNO, NAME, CITY)

SUPPLY (SNO, PNO, DEPTNO, QTY)

Fragmentation Schema: SUPPLIER 1 = SLCITY=”KOLKATA” SUPPLIER

SUPPLIER 2 = SLCITY=”DELHI” SUPPLIER
[Assume that “KOLKATA” and “DELHI” are the only possible values for CITY attribute]
SUPPLY 1 = SUPPLY SJSNO=SNO SUPPLIER 1
SUPPLY 2 = SUPPLY SJSNO=SNO SUPPLIER 2

Allocation Schema: SUPPLIER 1 at site 1, SUPPLIER 2 at site 2

SUPPLY1 at site 3, SUPPLY2 at site 4.

Write an application that retrieves the names of the suppliers who supplies a given part; the part
number is read from the terminal by the user who requests the application. 5+10=15

4. Justify the following statements: 3 × 5 =15

a) In DDBMS workload distribution might negatively affect processing locality.
b) In terms of redundancy of data, Centralized database, and Distributed database
employs different approaches.
c) Update applications cause problems in DDBMS.
d) Semi join reduces network traffic.
e) In DDBMS replication transparency is implied by location transparency.
5. (a) Describe how the deadlock is detected in the distributed system?
(b) What is a false deadlock?
(c) Write the algorithm for Primary Horizontal Fragmentation. 6 + 2 + 7 = 15

6. (a) What do you mean by canonical expression of a fragment query? Explain with an
example.
(b) Define the term “Database Profile”. Discuss the database profile for Semi-join
operation.
(c) Given two relations: SUPPLY (SNO, PNO, DEPTNO, QTY)
and DEPT (DEPTNO, NAME, AREA, MGRNO).
Draw the ‘modified’ operator tree for the query, which requires the Supplier number
of suppliers that have issued a supply order in the East area of our company).
4 + 6 + 5 =15

O--------X--------O