Question: Consider a relation R(A,B,C,D,E,F), with the following functional dependencies: AB, CAD, AEFC What are the minimal keys for this relation? Justify your answer in terms
Consider a relation R(A,B,C,D,E,F), with the following functional dependencies: AB, CAD, AEFC
What are the minimal keys for this relation? Justify your answer in terms of functional dependencies and closures.
Decompose the relation R into a collection of Boyce-Codd Normal Form (BCNF) relations. Show your intermediate steps; for each step show the relation that you are decomposing and the violation of BCNF that you are using during that decomposition step. Indicate clearly your final result: the relations, their attributes and their keys. Does your decomposition preserve functional dependencies? If so, show where each dependency can be checked in the decomposed tables. Otherwise, list the dependencies that are not preserved.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
