Normalization
Normalization
ABHIRAMI T
• candidate key is a set of one or more attributes (columns)
that can uniquely identify a tuple (row) in a relation (table).
A primary key is one candidate key that is chosen to
uniquely identify tuples within a relation
• A super key is a set of one or more attributes (columns) that, taken together,
uniquely identify tuples (rows) within a relation (table). In other words, a
super key is a superset of a candidate key. It can contain more attributes
than needed to uniquely identify tuples. Any combination of attributes that
includes a candidate key is considered a super key. For example, if a relation
has attributes A, B, and C, and {A, B} is a candidate key, then {A, B, C} and
{A, B, C, D} are both super keys.
Database normalization
• There are also 4NF (fourth normal form) and 5NF (fifth
normal form).
• be in 2NF
• have no transitive partial dependency.
Examples of 1NF, 2NF, and 3NF
• Database normalization is quite technical, but we will
illustrate each of the normal forms with examples.
• So, if you know the state_code, then you can find the
home_state value.