Question: Given a relation schema R = { A , B , C , D , E , H } and a set of functional dependencies

Given a relation schema R ={A, B, C, D, E, H} and a set of functional dependencies F ={A B, BC D, A C, E A, A E}, the options for a lossless join decomposition of R are:
R1={A, B, C, D}, R2={A, H}
None of the choices are correct.
R1={B, C, D, H}, R2={A, H}
R1={A, B, C, D, E}, R2={B, C, H}

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