Problem 1
Consider relation R(A, B, C, D, E) with the following functional dependencies.
1. Find the key(s) of R? Show that the key(s) is/are minimal.
2. Find a minimal basis or prove the current basis is minimal.
3. Perform a BCNF decomposition of R to find a lossless-join dependency-preserving decomposition.
4. Use the 3NF synthesis algorithm to find a lossless-join dependency-preserving decomposition of R into 3NF.
Problem 2
Consider relation S(C,E,J,P,R,T) with the following functional dependencies.
Repeat questions 1 – 4 from problem 1 using relation S.
1
