《Database System Concepts Course Introduction》ch07.pptVIP

3NF Decomposition Algorithm Let Fc be a canonical cover for F;i := 0;for each functional dependency ? ? ? in Fc do if none of the schemas Rj, 1 ? j ? i contains ? ?  then begin i := i + 1; Ri := ? ?  endif none of the schemas Rj, 1 ? j ? i contains a candidate key for R then begin i := i + 1; Ri := any candidate key for R; end return (R1, R2, ..., Ri) 3NF Decomposition Algorithm (Cont.) Above algorithm ensures: each relation schema Ri is in 3NF decomposition is dependency preserving and lossless-join Proof of correctness is at end of this file Example R