Schema Refinement and Tuning Consider R = (ABCDEG) with the set of functional dependencies F = {A->D, C->D, CD->A, CE->BG, E->ACD}.
a) [2 marks] Do any trivial functional dependencies hold on R? If yes, list one and explain why it holds. If not, explain why there are none.

b) [5 marks] Find a minimal cover for F. You must show your work.

Answer rating: 100% (QA)

a Trivial functional dependencies refer to those that can be implied by the existing attributes within a relation In this case the relation R ABCDEG w... View the full answer