Let R (A, B, C, D) be a relational schema with the following functional…

GATE · 2008 · IT

A → B, B → C,
C → D and D → B. 

The decomposition of R into 
(A, B), (B, C), (B, D)

1. A.

   gives a lossless join, and is dependency preserving

2. B.

   gives a lossless join, but is not dependency preserving

3. C.

   does not give a lossless join, but is dependency preserving

4. D.

   does not give a lossless join and is not dependency preserving

Attempted by 524 students.