Question: Let R(A, B, C, D, E) be decomposed into relations with the following three sets of attributes: {A, B, C}, {B, C, D}, and {A,

Let R(A, B, C, D, E) be decomposed into relations with the following three sets of attributes: {A, B, C}, {B, C, D}, and {A, C, E}. Consider the following five sets of FDs:

(a) B E and CE A

(b) AC E and BC D

(c) A D, D E, and B D

(d) A D, CD E, and E D

(e) A B, BC D, and E B

For each set 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 tuples than R has when projected onto the decomposed relations and rejoined.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!