Consider a relational schema R = (A, B, C, D, E, H, I)satisfying the functional dependencies F = {A -> C, B -> AC,HD -> ABCH, C -> H, E -> D, D -> E}.
a) Derive all candidate keys for this schema.
b) Derive a canonical cover of the functional dependencies inF
c) Is the above schema in BCNF? Prove or disprove. If it is not inBCNF, convert it into BCNF.
d) Is the BCNF schema from c) dependency-preserving? Prove ordisprove. If not, convert it into 3NF.
Expert Answer
An answer will be send to you shortly. . . . .