Question: Consider the schema R = (A, B, C, D, E, G,H) and the set F of functional dependencies: AB CD D C DE
Consider the schema R = (A, B, C, D, E, G,H) and the set F of functional dependencies:
AB → CD
D → C
DE → B
DEH → AB
AC → DC
Use the 3NF decomposition algorithm to generate a 3NF decomposition of R, and show your work. This means:
a. A list of all candidate keys
b. A canonical cover for F
c. The steps of the algorithm, with explanation
d. The final decomposition
Step by Step Solution
3.37 Rating (156 Votes )
There are 3 Steps involved in it
a The candidate keys of R are AB DE and AC b The c... View full answer
Get step-by-step solutions from verified subject matter experts
