Database

Let R(A, B, C, D, E) be decomposed into relations with following sets of attributes: {A, B, C}, {B, C, D}, and {A, C, E}. For each of the following sets of FDs, use the chase test to tell whether the decomposition of R is lossless. For those that are not lossless, give an example of an instance of R that returns more than R when projected on the decomposed relations and rejoined. (Please note that an instance of a relation is one in which there is actual data.) a. AC E and BC D. b. A D, D E, and B D. c. A D, CD E, and E D.

For each of the sets of FDs in a, b, and c are the dependencies preserved by the decomposition?