R(A, B, C) has the single functional dependency B -> C. Which decomposition of R is lossless-join?
Correct answer B. R1(A, B) and R2(B, C)
Explanation
A binary decomposition is lossless if the common attributes form a superkey of at least one part. In R1(A, B) and R2(B, C) the common attribute B determines C, so B is a key of R2 and joining back gives exactly R. In the other options the shared attribute (C or A) determines nothing, or nothing is shared, so the natural join can create spurious tuples.
Answer checked How we write and check questions
Discussion