1 Suppose we have relation R A B C D E which we have decompo

1.       Suppose we have relation R (A, B, C, D, E), which we have decomposed into relations with sets of attributes S1 = {A, B, C}, S2 = {B, C, D}, and S3 = {A, C, E}. Given the set of FDs are {A->D, B->D, CD->E}.

a.       Use the chase test to tell whether the decomposition of R is lossless.

b.       Is the decomposition is dependency preserving?

c.       Is the decomposition in BCNF? If not, indicate all BCNF violations and try to decompose R into BCNF.

Solution

Answer :-

a. Use the chase test to tell whether the decomposition of R is lossless.

Explanation :

b. Is the decomposition is dependency preserving?

Explanation :

Breakdown based on B->C

c. Is the decomposition in BCNF? If not, indicate all BCNF violations and try to decompose R into BCNF.

Explanation: