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

Let suppose a relation R=( A,B,C,D, E,F) with a set of functional dependencies F:(A--> BC--> D. EF-->A. F-->E) is given. Relationship R is decomposed into R1 TV( A, B, C, D) and R2( A.E.F). Find out weather the decomposition lossless or not. and weather it is dependency is preserving or not ( show why oy 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!