Question: Given the relation R(A,B,C,D,E,F) with the following functional dependencies: DF CE BF ADE A AB D A FD B BF DF (a) What are the
Given the relation R(A,B,C,D,E,F) with the following functional dependencies:
DF CE
BF ADE
A AB
D A
FD B
BF DF
(a) What are the candidate keys of the relation. Briefly justify your answer.
(b) Form the canonical covering of the functional dependencies. Give all steps of the algorithm.
(c) In which highest normal form is the relation R? Explain why this is the highest normal form.
(d) The relation R was split into two relations using the decomposition algorithm
R1(A,D) and R2(B,C,D,E,F) exploded. The algorithm was correct and complete carried out. What is the highest normal form for the new relations? Give
justify your answer briefly
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
