1,095 views
3 votes
3 votes
R(A, B, C, D)
FD: B->C, D->A

is the following decomposition in BCNF?

R1(B, C), R2(A, D), R3(C, D)

1 Answer

0 votes
0 votes
No due to lossy the decomposion is not in BCNF.

for decomposition to be a loss less the common attribute between the decompossed relation must be the candidate key of any of the decompossed relation.

Related questions

1 votes
1 votes
2 answers
1
aditi19 asked Apr 14, 2019
1,845 views
Decompose into BCNFR(A, B, C, D, E)FD: AB->C, C->D, D>B, D->E
2 votes
2 votes
1 answer
2
Na462 asked Jul 14, 2018
1,856 views
2 votes
2 votes
2 answers
3
pradeepchaudhary asked Jun 8, 2018
1,750 views
Given: The Relation R(A,B,C,D,E) having (A,B) as Primary key. The set of functional dependencies: (A,C) >D , (B,D) >E. I want to Know whether the functional dependencies ...
0 votes
0 votes
1 answer
4
Mk Utkarsh asked Nov 24, 2017
549 views
Please explain with example how lossless decomposition into BCNF is possible but dependency preservating BCNF decomposition may not be possible for all relations?