Question: a) Given relation R(A, B, C, D, E, G) and functional dependencies F={ABDCE, BCD, CDE, DEG, AB}. Compute a minimal cover of F. Show the
a) Given relation R(A, B, C, D, E, G) and functional dependencies F={ABDCE, BCD, CDE, DEG, AB}. Compute a minimal cover of F. Show the intermediate steps of your derivation. (7 marks)
b) Consider the following relation:
TRIP (Trip_id, Start_date, Cities_visited, Cards_used)
This relation refers to business trips made by company salespeople. Suppose
the TRIP has a single Start_date but involves many Cities and salespeople
may use multiple credit cards on the trip.
i) Make up a mock-up population of the table.
ii) Discuss what FDs and/or MVDs exist in this relation. Justify the existence of the MVD identified.
iii) Show how you will go about normalizing the relation. (2+4+2 = 8 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
