Question: Suppose we have a relation schema R(A, B, C, D, E, F, G) and a set of functional dependencies H = {BCD A, BC E,

Suppose we have a relation schema R(A, B, C, D, E, F, G) and a set of functional dependencies H = {BCD A, BC E, A F, FG, C D, A GA B}. Decompose R into 3NF by using the 3NF synthesis algorithm. Show all steps and argue precisely. Is this decomposition also in BCNF? If so, why. If not, why not? Suppose we have a relation schema R(A, B, C, D, E, F, G) and a set of functional dependencies H = {BCD A, BC E, A F, FG, C D, A GA B}. Decompose R into 3NF by using the 3NF synthesis algorithm. Show all steps and argue precisely. Is this decomposition also in BCNF? If so, why. If not, why not
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
