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

Consider a relational schema R(A, B, C, D, E, G, H, I) and a set of functional dependency F = {E --> D, C --> G, AB --> HI, G --> A}. Find out a key of R and perform a key-based BCNF decomposition of R. Justify whether the decomposition is dependency preserving.

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!