Normal Forms Based On Primary Keys
Normal Forms Based On Primary Keys
Chapter 10-1
3.1 Normalization of Relations (1)
Chapter 10-2
Normalization of Relations (2)
Chapter 10-3
3.2 Practical Use of Normal Forms
Chapter 10-4
3.3 Definitions of Keys and Attributes
Participating in Keys (1)
• A superkey of a relation schema R = {A1, A2, ...., An} is
a set of attributes S subset-of R with the property
that no two tuples t1 and t2 in any legal relation state
r of R will have t1[S] = t2[S]
Chapter 10-5
Definitions of Keys and Attributes
Participating in Keys (2)
• If a relation schema has more than one key, each is
called a candidate key. One of the candidate keys is
arbitrarily designated to be the primary key, and the
others are called secondary keys.
• A Prime attribute must be a member of some
candidate key
• A Nonprime attribute is not a prime attribute—that
is, it is not a member of any candidate key.
Chapter 10-6
3.2 First Normal Form
Chapter 10-7
Figure 10.8 Normalization into 1NF
Chapter 10-8
Figure 10.9 Normalization nested relations into
1NF