Question: Given R (A, B, C, D, E, F) and the following set of functional dependencies: G = {A->B, B->A, AB->CDEF, B->C, D->E, EF->D} give the
Given R (A, B, C, D, E, F) and the following set of functional dependencies:
G = {A->B, B->A, AB->CDEF, B->C, D->E, EF->D}
- give the minimal cover of R
- List all candidate keys
- Give a BCNF decomposition. Does it preserve the dependencies?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
