ExamCompetition Your Success, Our Mission
Login Register
Question discussion

A relation R(A, B, C) with the functional dependency A → B only is decomposed into R1(A, B) and R2(B, C). This decomposition is

1940Medium DSSSB TGT Computer Science 0 replies 1 views
0

A relation R(A, B, C) with the functional dependency A → B only is decomposed into R1(A, B) and R2(B, C). This decomposition is

  • Alossless-join and dependency preserving
  • Blossless-join but not dependency preserving
  • Clossy-join
  • Dlossless-join and every part is in BCNF
Correct answer: C

Explanation

The common attribute B is not a key of R1 or of R2, so joining the two parts can produce spurious tuples and the decomposition is lossy.
Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!