Write programs that implement Algorithms 11.3 and 11,4.
Consider the following decompositions for the relation schema R of Exercise
Determine whether each decomposition has (i) the dependency preservation property, and (ii) the lossless join property, with respect to F. Also determine
which normal form each relation in the decomposition is in.
a. 0) = {R)l Rz' R3, R4, Rs}; R) = {A, B, C}, Rz = {A, 0, E}, R3 = {B, Fl, R4 = {F, G,
H}, Rs = {D, I,]}
b. 0z = {R), Rz, R3}; R) = {A, B, C, 0, E}, Rz = {B, F, G, H}, R3 = {D, I,]}
c. 03 = {R), Rz' R3, R4, Rs}; R) = {A, B, C, O}, Rz = lV, E], R3 = {B, Fl, R4 = {F, G,
H}, Rs = {V, 1,]1