Question: 4. Let R(ABCDEG) be a relation schema and let the set of functional dependencies satisfied by R be F ABCD, BCDA, BC, E-D (4.1) Compute

4. Let R(ABCDEG) be a relation schema and let the set of functional dependencies satisfied by R be F ABCD, BCDA, BC, E-D (4.1) Compute a minimal cover of F. Show the steps in your computation. (4.2) Compute an LLJ BCNF decomposition of R. Is it possible to get a BCNF decomposition for the relation R which is both LLJ and fd-preserving? Show your decomposition tree, and the fd's used in each decomposition step. Moreover, for each relation R at a leaf node in the tree, show the set of functional dependencies F, that hold true on R
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
