Monthly Archives: October 2013

Method for normalizing a relation to BCNF based on functional dependencies

In the previous post I showed the method I use to determine the candidate keys and highest normal form of a relation. Now let’s break these large relations into smaller ones to make sure we achieve Boyce-Codd Normal Form (BCNF)! … Continue reading

Posted in Tutorials | Tagged , , , | 5 Comments

Method for determining candidate keys and highest normal form of a relation based on functional dependencies

For my advanced database systems course I needed to learn how to take a given relation and functional dependencies, tell the highest normal form and then normalize it up to BCNF. It’s actually not that hard, but there are a … Continue reading

Posted in Tutorials | Tagged , , , , | 64 Comments