3NF decomposition is both lossless-join and dependency-preserving
A Dependency-Preserving Lossles-Join 3NF Decomposition Algorithm
a.) Find minimal cover
b.) Put FDs agreeing on the left-hand-side in the same schema
c.) Have extra schema for a key, if none of the above schemas contain a key
Example R = {A,B,C,D,E,G,I,J}
a. ) F- ={A→B, A→E, A→D, AC→G}
b.) R1(ABDE), R2(ACG)
c,) R3(ACIJ)