Scribd
Upload
55 views

Unit 4 Normalization

The document discusses relational database design and normalization. It defines normalization as decomposing "bad" relations into smaller relations by breaking up attributes. It describes 1st, 2nd, 3rd normal forms and Boyce-Codd normal form, which are based on keys and functional dependencies. It also mentions 4th and 5th normal forms based on multi-valued dependencies and join dependencies. Finally, it defines keys, superkeys, candidate keys, primary keys, and attributes as prime or nonprime based on whether they are members of candidate keys.

Uploaded by

rakshit dhoka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views

Unit 4 Normalization

The document discusses relational database design and normalization. It defines normalization as decomposing "bad" relations into smaller relations by breaking up attributes. It describes 1st, 2nd, 3rd normal forms and Boyce-Codd normal form, which are based on keys and functional dependencies. It also mentions 4th and 5th normal forms based on multi-valued dependencies and join dependencies. Finally, it defines keys, superkeys, candidate keys, primary keys, and attributes as prime or nonprime based on whether they are members of candidate keys.

Uploaded by

rakshit dhoka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 77

Relational Database Design

Normalization of Relations (1)


• Normalization:
– The process of decomposing unsatisfactory "bad"
relations by breaking up their attributes into
smaller relations

• Normal form:
– Condition using keys and FDs of a relation to
certify whether a relation schema is in a particular
normal form
Slide 14- 45
Normalization of Relations (2)
• 2NF, 3NF, BCNF
– based on keys and FDs of a relation schema
• 4NF
– based on keys, multi-valued dependencies : MVDs;
• 5NF
– based on keys, join dependencies : JDs
• Additional properties may be needed to ensure a
good relational design (lossless join, dependency
preservation; see Chapter 15)

Slide 14- 46
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]

• A key K is a superkey with the additional property that


removal of any attribute from K will cause K not to be a
superkey any more.

Slide 14- 47
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.

Slide 14- 48

You might also like