Consider the relation schema R(A, B, C, D, E, F) and the set…
Consider the relation schema R(A, B, C, D, E, F) and the set S = {AB → C, BC → AD, D → E, C → B} of functional dependencies. Assuming that R is decomposed into the relation schemas R1(A, B), R2(B, C), R3(A, B, D, E), and R4(E, F). Use the Chase test to show if this is a lossless decomposition.
Read Details