IS THE FOLLOWING DECOMPOSITION A LOSSLESS JOIN?

a) R1 = {A,B,D,E,F} with (A,D,E) as a key for R1 and R2 = {B,D,C} with (B,D) as a key for R2.

b) R3 = {A,E,F} with (A,E) as a key for R3 and R4 = {A,D,E} with (A,E,D) as a key for R4.

c) R5 = {A,E,F} with (A,E) as a key for R5 and R6 = {A,D,E} with (A,E,D) as a key for R6.

d) Determine whether each of the decompositions in the previous questions (a,b,c) has the dependency preserving property and conclude for the whole decomposition. Justify your answer concisely.

Name CST 225.000: Test 2 Time S01/2019 @ 4.00 pm to 4:50 pm Banner ID: Is the following decomposition a lossless join? a) RI-A.B.D.E.F) with (A, D, E) as a key for RI and R2-[B,D,C) with (BD) as a key for ka b) R3 - (A, E, F) with (A, E) as a key for R3 and R4 - {A, D, E) with (A, E, D) as a key for R4. e) R5 (A, E, F) with (A, E) as a key for R5 and R6 (A, D, E) with (A, E, D) as a key for Ro. d) Determine whether each of the decompositions in the previous questions (a, b, c) has the dependency preserving property and conclude for the whole decomposition. Justify your answer very concisely