ADVANCE DATABASE MANAGEMENT SYSTEM (ADBMS) DECEMBER 2013 SEMESTER 5 COMPUTER SCIENCE

ADVANCE DATABASE MANAGEMENT SYSTEM (ADMS) DECEMBER 2013 SEMESTER 5 COMPUTER SCIENCE

Con.6757-13.                                                                                                        LJ-11260.

                                                                 (3 Hours)                                      [Total Marks: 100]

N.B.: (1) Question No.1 is compulsory.
         (2) Solve any four question Nos.2 to 7.
         (3) Figures to the right indicate full marks.
         (4) Assume any suitable data wherever required.

1. (a) Explain different types of transparencies in distributed database. [10 Marks]
         Consider the following schema: -
             Emp (eno, ename,title)
             Proj (pno, pname, budget, Loc)
             Pay (title, salary)
             Assignment (eno, pno, responsibility, duration)
             (i) Give 2 examples of horizontal and vertical fragmentation each.
            (ii) Give the derived horizontal fragmentation on emp & pay relation. Write the
                 resultant fragments.
     (b) Explain heuristic approach of query processing with relevant examples. [10 Marks]

2. (a) Explain Hash join and external Sorting Algorithm in detail. [12 Marks]
    (b) Explain conceptual design phase of database life cycle. [8 Marks]

3. (a) In SQL3 how the type inheritance and table inheritance implemented? Explain with suitable
          examples. [10 Marks] 
    (b) Explain left, right, outer, inner, equi join, pattern matching with example. [10 Marks]

4. (a) Draw and explain architectures for parallel databases. [10 Marks]
    (b) Explain mapping of Generalization, Specialization, Union/category with relevant
          examples. [10 Marks]

5. (a) Consider the following DTD:-
          <!DOCTYPE Parts[
          <!ELEMENT part (name, subpartinfo*)>
          <!ELEMENT subpartinfo (part, quantity)>
          <!ELEMENT name (# PCDATA)>
          <!ELEMENT quantity (#PCDATA)>
           ]>
           (i) Give a small example of data corresponding to the above DTD. [5 Marks]
          (ii) Show how to map this DTD to a relational schema. You can assume that part names
                are unique. [5 Marks]
    (b) Discuss deadlock handling techniques in distributed database. [10 Marks]

6. (a) Expalin cost functions for SELECT operation. [10 Marks]
    (b) Compare RDBMS, OODBMS and ORDBMS. [10 Marks]

7. Write a short notes on (any four):- [20 Marks]
     (a) Nested Relations
     (b) XQuery
     (c) EXIST and NOT EXIST
     (d) Client-server architecture
     (e) Bloom Join Techniques