Question: Consider the relational database schema R(A, B, C, D, E, F, G, H, I) with the following set of functional dependencies: {A} + {E, F}

Consider the relational database schema R(A, B, C, D, E, F, G, H, I) with the following set of functional dependencies: {A} + {E, F} {A,B,C,D} {G,H} {C,D,G} {A,B,1} {H} + {I} A. Use the inference rules to show that {A,B,C,D} {1}. (5 marks) B. Determine which ones of the following sets of attributes are superkeys and which ones are also candidate keys: {A,B,C,D} {C,D,G,H} {C,D,G} Justify your answer by computing the closures. (10 marks) C. Use the candidate keys that you have identified in part B to decompose the relation R such that it satisfies the 2NF
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
