Consider a relation R(A,B,C,D,E,F,G) with set of functional dependencies
F={AD->BF, CD->EGC, BD->F, E->D, F->C, D->F}
The relation R is decomposed into the following two relations after finding the minimal cover for the above set of functional dependencies R1(A,B,C,D,E) and R2(A,D,F,G)
Use the functional dependencies in the minimal cover to determine the nature of this decomposition.
- Decomposition is lossless and dependency preserving
- Decomposition is lossy and dependency preserving
- Decomposition is lossy and not dependency preserving
- Decomposition is lossless and not dependency preserving
