13-07-2011 Gtu
13-07-2011 Gtu
13-07-2011 Gtu
: _____
Enrolment No.______
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1
Q.2
Q.3
Q.3
Q.4
14
07
07
(a) Explain with an example. How can binary decompositions for the
nonadditive join property be tested easily?
(b) Design a generalization-specialization hierarchy for a motor
vehicle sales company. The company sells motorcycles, passenger
cars, vans and buses. Justify your placement of attributes at each
level of the hierarchy. Explain why they should not be placed at a
higher or lower level.
07
07
07
07
07
07
07
OR
Q.4
Q.5
Q.5
07
(a) Why can we not guarantee that BCNF relation schemas will be
produced by dependency-preserving decompositions of non-BCNF
relation schemas? Give a counter example to illustrate this point.
(b) Use Armstrongs axioms to prove the soundness of the
decomposition rule.
OR
(a) List three design goals for relational databases, and explain why
each is desirable.
(b) List two advantages and two disadvantages of each of the
following strategies for storing a relational database:
1) Store each relation in one file.
2) Store multiple relations (even the entire database) in one file.
07
07
07
07
07
*************