3 votes 3 votes What is the highest normal form of the relation $R(ABCDEF)$ having functional dependency set at $F = \{ A \rightarrow BC, \ \ C \rightarrow AD, \ \ E \rightarrow ABC, \ \ F \rightarrow CD, \ \ CD \rightarrow BEF, \ \ AB \rightarrow D \}$? $1NF$ $2NF$ $3NF$ $BCNF$ Databases tbb-dbms-2 databases database-normalization + – Bikram asked Aug 26, 2017 retagged Sep 17, 2020 by ajaysoni1924 Bikram 355 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes If we find the candidate keys here we can clearly see that (A, C, E, F) are candidate keys. hence CD and AB are also superkeys. so all the FD's will be like SUPERKEY-> ATTRIBUTE. that;s the only condition for BCNF. hence it is in BCNF normal form. s9k96 answered Sep 9, 2017 selected Dec 15, 2017 by Rishabh Gupta 2 s9k96 comment Share Follow See all 2 Comments See all 2 2 Comments reply rahul123 commented Sep 18, 2017 reply Follow Share It is not bcnf 0 votes 0 votes Sid Mukherj commented Oct 14, 2017 i edited by Sid Mukherj Oct 14, 2017 reply Follow Share I think this is a very appropriate explanation. Nice explanation thanks. This is definitely in BCNF. Adding to the explanation: All the FD's will be like SUPERKEY-> ATTRIBUTE. that's the only condition for BCNF. ATTRIBUTE can be prime or non prime; doesn't matter. 1 votes 1 votes Please log in or register to add a comment.