Jawaharlal Nehru Technological University Kakinada 2009-1st Sem B.Tech Information Technology IV Regular s, DISTRIBUTED DATA BASES ( Common to and Computer Science & Systems Engineering

Code No: N1202

 

 

 

 

 

 

 

Set No. 1

 

IV B.Tech I Semester Regular Examinations, November 2009

DISTRIBUTED DATA BASES

( Common to Information Technology and Computer Science & Systems

Engineering)

Time: 3 hours

Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

 

 

 

1. Consider the global relations:

PATIENT(NUMBER, NAME, SSN, AMOUNT-DUE,DEPT,DOCTOR,MED-TREATMENT)

DEPARTMENT(DEPT,LOCATION,DIRECTOR)

STAFF(STAFFNUM,DIRECTOR,TASK)

 

 

Define their fragmentation as follows:

 

 

(a) DEPARTMENT has a horizontal fragmentation by LOCATION, with two

locations; each department is conducted by one DIRECTOR.

(b) There are several staff members for each department, led by the departments

director. STAFF has a horizontal fragmentation derived from that of the

DEPARTMENT and a semi-join on the DIRECTOR attribute. Which as-

sumption is required in order to assure completeness?

(c) Discuss the type of fragmentation PATIENT can have.[16]

 

2. (a) Draw an operator tree and show the simplification for the following query. For

given EMP and DEPT relations, assuming the necessary attributes, a query

to give the names of employees who work in a department whose manager has

number 373 but who do not earn more than Rs.100000/- is as given below.

PJ

EMP.NAME((EMP JN DEPTNUM=DEPTNUM SLMGRNUM=373DEP T )

DF

(SLSAL>100000 EMP JN DEPTNUM=DEPTNUMSLMGRNUM=373DEP T )

(b) Explain parametric queries in detail.[8+8]

 

3. (a) Explain the use of Semi-Join programs for join queries with examples.

(b) Assume the following query which requires the supplier number of suppliers

that have issued a supply order in the North area of a company

PJ

SNUMSLAREA=North(SUPPLY JN DEPTNUM=DEPTNUMDEP T )Analyse

transmission requirements for the above query for at least three different exe-

cution strategies.[8+8]

 

4. (a) Write about the concurrency control based on locking in distributed databases.

(b) Explain recovery of distributed transactions. [8+8]

 

5. (a) Classify 2- phase locking, time stamps and optimistic methods.[8+8]

 

 

(b) Explain Validation using only transaction time stamps.

 

6. (a) Explain about Nonblocking 2-phase-commitment protocol with state diagram.

(b) Explain in detail 3-phase-commitment protocol with state diagram.[8+8]

 

7. Write a short note on:

 

(a) Synchronizing access to objects

(b) Management of Type lattice.

(c) Explain about transaction models and object structures.

[5+5+6]

 

8. Explain about the concepts of Datawarehousing in detail.[8+8]

 

 

 

 

 

 

 

 

 

Set No. 2

 

IV B.Tech I Semester Regular Examinations, November 2009

DISTRIBUTED DATA BASES

( Common to Information Technology and Computer Science & Systems

Engineering)

Time: 3 hours

Answer any FIVE Questions

All Questions carry equal marks

 

Max Marks: 80

 

1. Discuss the following:

 

(a) Types of data fragmentation

(b) Access primitives in DDB.[8+8]

 

2. Give an example of global schema, fragmentation schema and additional semantic

knowledge, and explain how this information can be used for deducing the simpli-

fication of a query. .[16]

 

3. (a) Discuss the problems in Query Optimization.

(b) Discuss how query optimisation is useful in distributed databases[8+8]

 

4. (a) Discuss the properties of distributed transactions.

(b) Write about the communication structure of distributed transactions. [8+8]

 

5. (a) Explain distributed wait-for graph and local wait-for graph with diagrams?

(b) Classify 2- phase locking, time stamps and optimistic methods.[8+8]

 

6. (a) Explain about Nonblocking 2-phase-commitment protocol with state diagram.

(b) Explain in detail 3-phase-commitment protocol with state diagram.

 

7. Explain in detail Transaction Management in Object DBMSs? [16]

 

 

8. Explain the following :

 

(a) Propagating updates

(b) Client cache management.[8+8]

 

 

 

 

 

 

 

Code No: N1202

 

 

 

 

 

 

 

Set No. 3

 

IV B.Tech I Semester Regular Examinations, November 2009

DISTRIBUTED DATA BASES

( Common to Information Technology and Computer Science & Systems

Engineering)

Time: 3 hours

Answer any FIVE Questions

All Questions carry equal marks

 

Max Marks: 80

 

1. Write about the following:

 

(a) Heterogeneous databases

(b) Homogeneous databases

(c) Conceptual schema

(d) Physical schema.[4+4+4+4]

 

2. Discuss query processing. Write about the equivalence transformations of a Query.

[16]

 

3. Discuss the following for distributed databases

 

(a) Post-optimization

(b) Transmission requirements

(c) AHY approach for semi-Joins.[5+5+6]

 

4. (a) Write about the atomicity of transactions in distributed databases with em-

phasis on failures and logs and recovery methods.

(b) Explain the 2-phase commitment protocol.[8+8]

 

5. Explain the following:

 

(a) Two phase locking

(b) Time stamping

(c) Concurrency Control

(d) Distributed wait for graph.[4x4]

 

6. Explain the following Authorization and Protection problems:

 

(a) Site-to-site Protection

(b) Enforcing Authorization Rules.[8+8]

 

7. Describe in detail cash consistency and object identifier management in object

management?

 

8. Explain the following in detail:

 

(a) Datawarehousing architectures

(b) OLAP Datamodel

(c) OLAP Servers.[4,6,6]

 

 

 

 

 

 

Code No: N1202

 

 

 

 

 

 

 

Set No. 4

 

IV B.Tech I Semester Regular Examinations, November 2009

DISTRIBUTED DATA BASES

( Common to Information Technology and Computer Science & Systems

Engineering)

Time: 3 hours

Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

 

 

 

1. (a) With a neat diagram explain the reference architecture for distributed data-

bases.

(b) Discuss the construction of a fragment tree with an example. [8+8]

 

2. (a) Discuss parametric queries in detail.

(b) Draw an operator tree for the following query

PJ

SNUMSLAREA=North(SUPPLY JN DEPTNUM=DEPTNUMDEP T )[8+8]

 

3. (a) What are the effects of commuting Joins and Unions?

(b) Explain the use of semi-Join for Join quarics with example.[8+8]

 

4. (a) Discuss concurrency control for distributed structures.

(b) Explain the following:

i. Granularity of locking

ii. Checkpoints and recovery.

 

5. Explain the following:

 

(a) A Comment on Serializability.

(b) Serializability in a Distributed Database.

(c) Read-set and write-set.

 

6. Explain the following:

(a)Checkpoints

(b)Usage of Catalogs

(c)User Identification

(d)Systemwide names.[6+4+4+2]

 

7. Why do client-server object DBMSs primarily employ data shipping architecture

while relational DBMSs employ function shipping? [16]

 

8. Explain the following :

 

(a) Propagating updates

(b) Client cache management.[8+8]