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

Transcribed Image Text:

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. 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.

Answer rating: 100% (QA)

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 the full answer