54
Chapter 6: Normalization Chapter 6: Normalization Paul Chen Paul Chen www.cs522.com (Please reference white papers on Data Modelin at Seattle U teaching materials website) Database Modeling and Design

Chapter 6: Normalization

  • Upload
    roddy

  • View
    71

  • Download
    0

Embed Size (px)

DESCRIPTION

Chapter 6: Normalization. Database Modeling and Design . Paul Chen. www.cs522.com (Please reference white papers on Data Modeling at Seattle U teaching materials website). Chapter 6 - Objectives. Purpose of normalization. Problems associated with redundant data. - PowerPoint PPT Presentation

Citation preview

Page 1: Chapter 6: Normalization

Chapter 6: NormalizationChapter 6: Normalization

Paul ChenPaul Chen

www.cs522.com (Please reference white papers on Data Modeling at Seattle U teaching materials website)

Database Modeling and Design

Page 2: Chapter 6: Normalization

Chapter 6 - ObjectivesChapter 6 - Objectives

Purpose of normalization.

Problems associated with redundant data.

Identification of various types of update anomalies such as insertion, deletion, and modification anomalies.

How to recognize appropriateness or quality of the design of relations.

Page 3: Chapter 6: Normalization

Chapter 6 - ObjectivesChapter 6 - Objectives

How functional dependencies can be used to group attributes into relations that are in a known normal form.

How to undertake process of normalization.

How to identify most commonly used normal forms, namely 1NF, 2NF, 3NF, and Boyce–Codd normal form (BCNF).

How to identify fourth (4NF) and fifth (5NF) normal forms.

Page 4: Chapter 6: Normalization

Normalization Normalization

A technique to make sure the data in a logical data

models is defined once and only once. Normalization

helps minimum data redundancy, and minimize

update abnormalities. They are:

First Normal Form Second Normal Form Third Normal Form Boyce–Codd normal form (BCNF)

Page 5: Chapter 6: Normalization

NormalizationNormalization First Normal Form: Relationships

between primary key and each attribute must be one-to-one; ie., remove repeating group.

Second Normal Form: All non-key elements are dependent upon the entire primary key rather than any part thereof.

Third Normal Form: Elimination of the dependence of non-key field upon any other field excepts the primary keys.

Page 6: Chapter 6: Normalization

Data RedundancyData Redundancy

Major aim of relational database design is to group attributes into relations to minimize data redundancy and reduce file storage space required by base relations.

Problems associated with data redundancy are illustrated by comparing the following Staff and Branch relations with the StaffBranch relation.

Page 7: Chapter 6: Normalization

Data RedundancyData Redundancy

Page 8: Chapter 6: Normalization

Data RedundancyData Redundancy

StaffBranch relation has redundant data: details of a branch are repeated for every member of staff.

In contrast, branch information appears only once for each branch in Branch relation and only branchNo is repeated in Staff relation, to represent where each member of staff works.

Page 9: Chapter 6: Normalization

Update AnomaliesUpdate Anomalies

Relations that contain redundant information may potentially suffer from update anomalies.

Types of update anomalies include: Insertion Deletion Modification.

Page 10: Chapter 6: Normalization

Functional Functional DependencyDependency

Main concept associated with normalization.

Functional Dependency Describes relationship between attributes in a

relation. If A and B are attributes of relation R, B is

functionally dependent on A (denoted A B), if each value of A in R is associated with exactly one value of B in R.

Page 11: Chapter 6: Normalization

Functional Functional DependencyDependency

Property of the meaning (or semantics) of the attributes in a relation.

Diagrammatic representation:

Determinant of a functional dependency refers to attribute or group of attributes on left-hand side of the arrow.

Page 12: Chapter 6: Normalization

Functional Functional DependencyDependency

Page 13: Chapter 6: Normalization

The Process of The Process of NormalizationNormalization

Formal technique for analyzing a relation based on its primary key and functional dependencies between its attributes.

Often executed as a series of steps. Each step corresponds to a specific normal form, which has known properties.

As normalization proceeds, relations become progressively more restricted (stronger) in format and also less vulnerable to update anomalies.

Page 14: Chapter 6: Normalization

PK: Primary KeyPK: Primary KeyFK: Foreign KeyFK: Foreign KeyNN: No NullNN: No NullND: No duplicateND: No duplicate

Order/Part OrderNo (PK) part-no Qty part-

namePK + PK NN ND

FK FK    

1 1 123 Nut

3 5 123 Bolt

Relationship Part Order

Page 15: Chapter 6: Normalization

Unnormalized Form Unnormalized Form (UNF)(UNF)

A table that contains one or more repeating groups.

To create an unnormalized table: transform data from information

source (e.g. form) into table format with columns and rows.

Page 16: Chapter 6: Normalization

First Normal Form First Normal Form (1NF)(1NF)

A relation in which intersection of each row and column contains one and only one value.

Page 17: Chapter 6: Normalization

UNF to 1NFUNF to 1NF Nominate an attribute or group of

attributes to act as the key for the unnormalized table.

Identify repeating group(s) in unnormalized table which repeats for the key attribute(s).

Page 18: Chapter 6: Normalization

UNF to 1NFUNF to 1NF Remove repeating group by:

entering appropriate data into the empty columns of rows containing repeating data (‘flattening’ the table).

Or by placing repeating data along with copy

of the original key attribute(s) into a separate relation.

Page 19: Chapter 6: Normalization

First Normal FormFirst Normal Form

Item No Qty-Store-1 Qty-Store-3

Qty-Store-2

PK

101 3000 4000

5000

Item Table

The above is an violation of first normal form

because there exists a repeated group.

Page 20: Chapter 6: Normalization

Rule Number 1Rule Number 1 For each occurrence of an entity, there is

only one and only one value for each its attributes. Attributes with repeating values form at least one new entity.

N other words, relationship between primary key and each attribute must be one-to-one.

Page 21: Chapter 6: Normalization

Possible SolutionPossible Solution

Store/Item

Store ID

Item-No

QtySold

Store ID

PK PK

FK+

FK S1

S1

S2 S

2

101 102

3000

4000

Store

Page 22: Chapter 6: Normalization

Second Normal Form Second Normal Form (2NF)(2NF)

Based on concept of full functional dependency: A and B are attributes of a relation, B is fully dependent on A if B is

functionally dependent on A but not on any proper subset of A.

2NF - A relation that is in 1NF and every non-primary-key attribute is fully functionally dependent on the primary key.

Page 23: Chapter 6: Normalization

1NF to 2NF1NF to 2NF Identify primary key for the 1NF relation.

Identify functional dependencies in the relation.

If partial dependencies exist on the primary key remove them by placing them in a new relation along with copy of their determinant.

Page 24: Chapter 6: Normalization

Second Normal FormSecond Normal Form

StudentNo

CourseNo

Grade Teachercode

CourseName

PK +

FK FK FK

ST01

ST02

100

200

3.0

4.0

T2

T1

Math

CS

Lee

DoeBoth course name and student name should be removed becauseThey are not related to the entire student/course primary key.

Student/Course

Page 25: Chapter 6: Normalization

Possible SolutionPossible Solution

Student

Student No

StudentName Course No

CourseName

Student/Course

Page 26: Chapter 6: Normalization

Rule Number 2Rule Number 2 Each attribute must be related to the

entire primary key.

Page 27: Chapter 6: Normalization

Second Normal ProcessSecond Normal ProcessOrder PartOrderNo

Order-Dt PartNo

PartName Pt-

price

PartnoOrderNo

QTY

PK PK

PK +

1

1

3

1/2/011/3/01

15

Nut

Bolts1.52.0

1

3

1

5

123

123

Order/Part

How aboutPutting PartNameIn Order/partTable?

Page 28: Chapter 6: Normalization

Third Normal Form Third Normal Form (3NF)(3NF)

Based on concept of transitive dependency: A, B and C are attributes of a relation

such that if A B and B C, then C is transitively dependent on A

through B. (Provided that A is not functionally dependent on B or C).

3NF - A relation that is in 1NF and 2NF and in which no non-primary-key attribute is transitively dependent on the primary key.

Page 29: Chapter 6: Normalization

2NF to 3NF2NF to 3NF Identify the primary key in the 2NF

relation.

Identify functional dependencies in the relation.

If transitive dependencies exist on the primary key remove them by placing them in a new relation along with copy of their determinant.

Page 30: Chapter 6: Normalization

Third Normal FormThird Normal Form

Course Id

CourseName

Dept -IdTeacherCode

DeptName

PK

MH400

Math T1

CS401 DB CS T2

Math

Lee

The relationship between any two non-primary key componentsmust not be one-to-one. What’s wrong with the above?

TeacherName

A1

CS

DOE

COURSE

Page 31: Chapter 6: Normalization

Rule Number 3Rule Number 3 The relationship between any two non-

primary key components must not be one-t-one; ie., remove tables within tables.

Page 32: Chapter 6: Normalization

The Normal ProcessThe Normal ProcessCustomerCust-Id Cust-Name

PK

OrderID

OrderDT Cust-Id

PK FK1

3Lee

Sato1

5

1

31/2/ 011/5/21

Order

It would be a violation of third normal form to place cust-name in the order table.

Page 33: Chapter 6: Normalization

WhyWhyReasons:

1. One-to-one relationship between two non-primary key columns (Cus-Id and Cust-name).

2. Redundancy3. An update anomaly (when a customer

name was changed)4. Worse yet when a new name was added

(the name could not be stored until the customer placed at least one order)

Page 34: Chapter 6: Normalization

NormalizationNormalization

Item No Qty_Hotel_no-1

Qty_ Hotel _no -3

Qty_ Hotel _no -2

PK

101 6 9 14

Item

The above is an violation of first normal form because there exists a repeated group. Relationships between primary key and each attribute must

be one-to-one.

(such as TV, Bed)

Page 35: Chapter 6: Normalization

Possible SolutionPossible Solution

Hotel Hotel/Item

Hotel ID

Item-No

QtyHotelID

PK PK

FK+

FK H1

H1

H2H2

101(TV)102

6

5

Hotelname

Min-nan

Xiamen

Page 36: Chapter 6: Normalization

Second Normal FormSecond Normal FormRoom/Hotel

RoomNo

HotelNo Type Price

101 4 double 100

Hotel name

Xiamen

Hotel Name should be removed becauseit is not related to the entire room/hotel primary key.What happens if one of the hotel names is being changed?

Page 37: Chapter 6: Normalization

Third Normal FormThird Normal Form

The relationship between any two non-primary key components must not be one-t-one; ie., remove tables within tables.

Page 38: Chapter 6: Normalization

Third Normal FormThird Normal FormCity

Hotel/City

Hotel ID

Hotel -name

CityId

CityID

PK PK

Circus H1

C1

C2H2

FlemingoHoliday

C1

C2

City name

LasVegas

Seattle

H0 C1

What happens if a new City name is added to the Hotel/City Table?

Page 39: Chapter 6: Normalization

Boyce–Codd Normal Form Boyce–Codd Normal Form (BCNF)(BCNF)

Based on functional dependencies that take into account all candidate keys in a relation, however BCNF also has additional constraints compared with general definition of 3NF.

BCNF - A relation is in BCNF if and only if every determinant is a candidate key.

Page 40: Chapter 6: Normalization

Boyce–Codd Normal Form Boyce–Codd Normal Form (BCNF)(BCNF)

Difference between 3NF and BCNF is that for a functional dependency A B, 3NF allows this dependency in a relation if B is a primary-key attribute and A is not a candidate key.

Whereas, BCNF insists that for this dependency to remain in a relation, A must be a candidate key.

Every relation in BCNF is also in 3NF. However, relation in 3NF may not be in BCNF.

Page 41: Chapter 6: Normalization

Boyce–Codd Normal Form Boyce–Codd Normal Form (BCNF)(BCNF)

Violation of BCNF is quite rare.

Potential to violate BCNF may occur in a relation that: contains two (or more) composite candidate keys; the candidate keys overlap (ie. have at least one

attribute in common).

Page 42: Chapter 6: Normalization

Review of Review of Normalization (UNF Normalization (UNF to BCNF)to BCNF)

Page 43: Chapter 6: Normalization

Review of Normalization (UNF Review of Normalization (UNF to BCNF)to BCNF)

Page 44: Chapter 6: Normalization

Review of Normalization (UNF Review of Normalization (UNF to BCNF)to BCNF)

Page 45: Chapter 6: Normalization

Review of Normalization (UNF Review of Normalization (UNF to BCNF)to BCNF)

Page 46: Chapter 6: Normalization

Fourth Normal Form (4NF)Fourth Normal Form (4NF) Although BCNF removes anomalies due to functional

dependencies, another type of dependency called a multi-valued dependency (MVD) can also cause data redundancy.

Possible existence of MVDs in a relation is due to 1NF and can result in data redundancy.

Page 47: Chapter 6: Normalization

Fourth Normal Form (4NF) - Fourth Normal Form (4NF) - MVDMVD

Dependency between attributes (for example, A, B, and C) in a relation, such that for each value of A there is a set of values for B and a set of values for C. However, set of values for B and C are independent of each other.

Page 48: Chapter 6: Normalization

Fourth Normal Form (4NF)Fourth Normal Form (4NF)

MVD between attributes A, B, and C in a relation using the following notation:

A B A C

Page 49: Chapter 6: Normalization

Fourth Normal Form (4NF)Fourth Normal Form (4NF)

MVD can be further defined as being trivial or nontrivial.

– MVD A B in relation R is defined as being trivial if (a) B is a subset of A or (b) A B = R.

– MVD is defined as being nontrivial if neither (a) nor (b) are satisfied.

– Trivial MVD does not specify a constraint on a relation, while a nontrivial MVD does specify a constraint.

Page 50: Chapter 6: Normalization

Fourth Normal Form (4NF)Fourth Normal Form (4NF)

Defined as a relation that is in BCNF and contains no nontrivial MVDs.

Page 51: Chapter 6: Normalization

4NF - Example4NF - Example

Page 52: Chapter 6: Normalization

Fifth Normal FormFifth Normal Form (5NF) (5NF) A relation decomposed into two relations must have

lossless-join property, which ensures that no spurious tuples are generated when relations are reunited through a natural join.

However, there are requirements to decompose a relation into more than two relations.

Although rare, these cases are managed by join dependency and fifth normal form (5NF).

Page 53: Chapter 6: Normalization

Fifth Normal FormFifth Normal Form (5NF) (5NF) A relation that has no join dependency.

Page 54: Chapter 6: Normalization

5NF - Example5NF - Example