471 views
0 votes
0 votes
How many minimum number of tables will be formed if the relation R(A,B,C,D,E,F) with
FD{A→BF,CD→E,B→D,E→A}is decomposed into BCNF?

2 Answers

0 votes
0 votes

candidate keys :{ EC ,AC, BC,CD}

DECOMPOSITION : (CDE)  (EA) (ABF)  (BD)

SO TOTAL we need 4 relation to be in BCNF .?? 

correct me if wrong !! 

Related questions

0 votes
0 votes
0 answers
2
Nishtha_Agarwal asked Dec 31, 2018
647 views
Options area- not in 3nf,in bcnfb- in 3nf,not in bcnfc- in 3nf, in bcnfd- not in 3nf, not in bcnf
2 votes
2 votes
2 answers
3
gatecrack asked Dec 10, 2018
582 views
Is minimal set of functional dependency for a functional dependency set is always unique???
0 votes
0 votes
1 answer
4
Raghav Khajuria asked Oct 5, 2018
884 views
Difference between composite and compound key??