Question: Consider a relation schema R(A, B, C, D, E, G) and a set of functional dependencies F = {A BCD, BC DE, B D, D
Consider a relation schema R(A, B, C, D, E, G) and a set of functional dependencies F = {A BCD, BC DE, B D, D A}.
Assume that R(A, B, C, D, E, G) is decomposed into R1(A, B, C, E, G) and R2(D, G). Given the above functional dependencies, is this decomposition always lossless? If so, prove this. Otherwise, explain it using an example.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
