I have a knotty (at least for me) problem to solve.
Normalize, with respect to Boyce Codd NF, the relational scheme E(A, B, C, D, E, F) by assuming that (A, B, C) is the unique candidate key and that the following additional functional dependencies hold: A,B -> D C,D -> E E -> A
Actually what I did is:
E1(ABCEF) , E2(ABD), E3(ABCDF), E4(CDE) then I added E5(ABC) and E6(EA) getting the final result:
E1(ABC), E2(ABD), E3(CDE), E4(EA)
Unfortunately, what I wrote is wrong....Can anyone help me?