Question: Consider a relational schema R(A, B, C, D, E, G, H) and a set of functional dependency F = {AB --> H, BD --> C,

Consider a relational schema R(A, B, C, D, E, G, H) and a set of functional dependency F = {AB --> H, BD --> C, G --> E, D --> BE, D --> A, E --> AB}. Find out a minimal cover of the set of functional dependency and based on the minimal cover perform a 3NF dependency preserving decomposition of the schema R. do not answer if u r unsure.

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!