Question

Given the relation R(ABCDEFGH) and the functional dependency set F = \{BC \rightarrow GH, AD \rightarrow E, A \rightarrow H, E \rightarrow BCF, G \rightarrow H\} decompose R into BCNF by decomposing in the order of the given functional dependencies.

          Given the relation R(ABCDEFGH) and the functional dependency set
F = \{BC \rightarrow GH, AD \rightarrow E, A \rightarrow H, E \rightarrow BCF, G \rightarrow H\}
decompose R into BCNF by decomposing in the order of the given functional dependencies.

Given the relation R(ABCDEFGH) and the functional dependency set
F = {BC →GH, AD →E, A →H, E →BCF, G →H}
decompose R into BCNF by decomposing in the order of the given functional dependencies.

Added by Gregory C.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert William Mead

Step 1

First, we check if the relation R is in BCNF. For a relation to be in BCNF, for every functional dependency X > Y, X should be a superkey. In our case, none of the left-hand sides of the functional dependencies are superkeys. So, R is not in BCNF. Show more…

Show all steps

Thanks for your feedback!

Given the relation R(ABCDEFGH) and the functional dependency set F ={BC > GH,AD > E,A > H,E > BCF,G > H} decompose R into BCNF by decomposing in the order of the given functional dependencies