Suppose that we decompose the schema

15kviews

written 9.5 years ago by

meghalikalyankar • 2.3k

modified 4.0 years ago by

binitamayekar ★ 6.7k

R = {A, B, C, D, E} into

R1 = {A, B, C} and

R2 = {A, D, E}

Show that this decomposition is lossless join decomposition if the following set of functional dependencies hold

enter image description here

database management systems

ADD COMMENT EDIT

1 Answer

3.5kviews

written 9.5 years ago by

meghalikalyankar • 2.3k

I. The decomposition of R into R1 and R2 can be called as lossless join decomposition if any one of the following conditions holds true:

II. R1 = (A, B, C), R2 = (A, D, E) ….Given

Hence, R1 ∩ …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.