Q61

MCQ2 marks, −0.5

Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$ , $B → C$ , $C → D$ and $D → B$ . The decomposition of $R$ into $(A, B), (B, C), (B, D)$

(A)

gives a lossless join, and is dependency preserving

(B)

gives a lossless join, but is not dependency preserving

(C)

does not give a lossless join, but is dependency preserving

(D)

does not give a lossless join and is not dependency preserving

Loading…