Question: Let s suppose, a relation R = ( A , B , C , D , E ) with a set of functional dependencies F:

Lets suppose, a relation R =(A, B, C, D, E) with a set of functional dependencies F: (AB -> CD, D -> C, DE -> B, AC -> DC) is given. Relation R (A, B, C, D, E) is decomposed into R1(A, B, C, D) and R2(B, D, E). Find out whether the decomposition is lossless or not, and whether it is dependency preserving or not (show why or why not).

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!