Question: 1. Suppose there are a schema R=(A, B, C, D, E) and a set F of functional dependencies F = {A BC, CD E,

1. Suppose there are a schema R = (A, B, C, D, E) and a set F of functional dependencies F = {A  BC, CD E, B

1. Suppose there are a schema R=(A, B, C, D, E) and a set F of functional dependencies F = {A BC, CD E, B D, E A}. a) Show the decomposition of R into R(A, B, C) and R(A, D, E) is a lossless decomposition. b) Show the decomposition of R into R(A, B, C) and R(C, D, E) is not a lossless decomposition. Give a lossless decomposition into BCNF of R. Give a lossless, dependency preserving decomposition into 3NF of R.

Step by Step Solution

3.39 Rating (149 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a We can decompose R into R1A B C and R2A D E as follows R1A B C a b c a b c d e R R2A D E a d e a b ... View full answer

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 Programming Questions!