385 views

2 Answers

1 votes
1 votes

(C) is correct.

R1(ABC) with dependency {AB → C, C → A} 

and

R2(CDA) with dependency {C → A, C → D}

Therefore, R1 is not BCNF decomposition because of C → A dependency.

0 votes
0 votes

Option C will be the answer. if we decompose into CD, CA and ABC to make it into BCNF then will get lossy decomposition due to the common attributes AC is not the key.

Related questions

4 votes
4 votes
4 answers
2
Tuhin Dutta asked May 27, 2019
2,445 views
In a relation, if every attribute is prime but key may not be simple then the relation is in ______.A. 1NFB. 2NFC. 3NFD. BCNF
2 votes
2 votes
1 answer
3