Advanced Database Management Systems

B.E. (CSE) 7th SEM, SECTION (1 + 2)

[Time Allowed: 1.5 hrs] [Max Marks: 30]

(ATTEMPT ANY SIX QUESTIONS 6X5 = 30)

Q1: Draw a state diagram, and discuss the typical states that a transaction goes through during
execution.
Q2: How does a query tree represent a relational algebra expression? Discuss the rules for
transformation of query trees, and identify when each rule should be applied during
optimization.
Q3: Define first, second and third normal form when only primary keys are considered. How do
the general definitions of 2NF and 3NF, which consider all keys of a relation, differ from those
that consider only primary keys?
Q4: consider the scheme S = (V,W,X,Y,Z), suppose the following F.D. hold:
Z -> V
W -> Y
XY -> Z
V -> WX
State whether the following decomposition of scheme S is lossless join decomposition. Justify
your answer.
(1) S1 = (V,W,X)
S2 = (V,Y,Z)
(2) S1 = (V,W,X)
S2 = (X,Y,Z)
Q5: what is the non-additive join property of decomposition? Between properties of
dependency preservation and losslessness, which one must definitely be satisfied and why?
Q6: Discuss cost components for a cost function that is used to estimate query execution cost.
Which cost components are used most often as the basis for cost functions?
Q7: which of the following schedule is a conflict serializable schedule? For each conflict
serializable schedule, determine its equivalent serial schedule.
(1) r1(X); r3(X); w1(X); r2(X); w3(X)
(2) r1(X); r3(X); w3(X); w1(X); r2(X)
(3) r3(X); r2(X); w3(X); r1(X); w1(X)