3NF : Algorithm

Let Fc be the canonical cover of F.

j = 0;

for each dependency a-->b if none of schemes in Ri contains ab then

j = j+1;

Rj = ab;

if none of the schemas contains a candidate key for R then

j = j+ 1;

Rj = any candidate key for R;

return (Rj)

Previous slide

Next slide

Back to first slide

View graphic version