DOEACC Society 2006 DOEACC C Level C6 Advanced DBMS ( ) - Question Paper

C6-R3: ADVANCED DATABASE MANAGEMENT SYSTEM
NOTE:
Time: three Hours Total Marks: 100
1.
a) Let F={A®B, C®B, D®ABC, AC®D} be a set of functional dependencies (fds).
Determine whether F1 = f1 and F1 = f2 where f1=AC®BD, and f2=C®A.
b) discuss in brief join dependency with improper examples.
c) How does the concept of an object in the object-oriented model differ from the concept
of an entity in the entity-relationship model?
d) What is a trigger? When is it used?
e) State issues associated with shared-nothing architecture in a distributed environment.
f) What is support AND confidence in association rule-data mining?
g) Differentiate ranging from web usage mining and web content mining.
(7x4)
2.
a) A file of 4096 blocks is to be sorted with an available buffer space of 64 blocks. How
many passes will be needed in the merge phase of external sort merge operation?
b) What is the effect of union operation if a relation contains null values?
c) How is size estimated of union of 2 relations in case of set and bag operations?
(8+5+5)
3.
a) Consider the tree transaction T1, T2, T3 and the Schedules S1 and S2 provided beneath.
Draw the serializability (precedence) graphs for S1 and S2 and state whether every
schedule is serializable or not. If a schedule is serializable, write down the equivalent
serial schedule(s).
T1:r1(X); r1(Z); w1(X);
T2:r2(Z); r2(Y); w2(Z); w2(Y);
T3:r3(X); r3(Y); w3(Y);
S1:r1(X); r2(Z); r1(Z); r3(X); r3(Y); w1(X); w3(Y); r2(Y); w2(Z); w2(Y);
S2:r1(X); r2(Z); r3(X); r1(Z); r2(Y); r3(Y); w1(X); w2(Z); w3(Y); w2(Y);
b) Suppose a learner t kind should have a person t kind within it, as well as an integer
learner ID, an e-mail name, and an expected year of graduation (an integer) in object
relation database. The person T object should be non-null. describe the learner t kind
and a table students using the learner id as the primary key.
(9+9)
4.
a) Consider a relation R(ABC) with fd B®C. Determine whether the decomposition
P1(AB,BC) and P2(AC,AB) of R are lossless.
b) When are 2 sets of functional dependencies equivalent? How can we determine their
equivalence?
(10+8)
C6-R3 Page one of two July, 2006
1. ans ques. one and any 4 ques. from two to 7.
2. Parts of the identical ques. should be answered together and in the identical
sequence.
5.
a) What is a minimal set of functional dependency? Does every set of dependencies have
a minimal equivalent set? Is it unique?
b) State Chase algorithm for inference of dependencies.
c) discuss ECA rules. Where are they used?
(8+6+4)
6.
a) How is recursion handled in datalog?
b) describe K-D-tree.
c) elaborate color histograms? Where are they used?
(8+5+5)
7.
a) State Armstrong axioms.
b) For every of the 3 partitioning techniques, namely round-robin, hash-partitioning and
range partitioning, provide an example of a query for which that partitioning technique would
give the fastest response.
c) elaborate the 3 broad levels at which a database system can be tuned to improve
performance?
(6+6+6)
C6-R3 Page two of two July, 2006

Earning:   Approval pending.