0% found this document useful (0 votes)
63 views

Normalization of Database Tables

The document discusses normalization of database tables. Normalization is the process of organizing data in tables to eliminate redundancies and anomalies like update, deletion, and addition anomalies. It involves dividing tables into first normal form (1NF), second normal form (2NF), third normal form (3NF) and BCNF. The examples show how a project database can be normalized through these forms to eliminate anomalies and redundancies in the data.

Uploaded by

Es E
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
63 views

Normalization of Database Tables

The document discusses normalization of database tables. Normalization is the process of organizing data in tables to eliminate redundancies and anomalies like update, deletion, and addition anomalies. It involves dividing tables into first normal form (1NF), second normal form (2NF), third normal form (3NF) and BCNF. The examples show how a project database can be normalized through these forms to eliminate anomalies and redundancies in the data.

Uploaded by

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

Normalization of Database Tables

5
Database Systems: Design, Implementation, and Management
4th Edition

Peter Rob & Carlos Coronel


Database Tables and Normalization
 Normalization is a process for assigning attributes to
entities. It reduces data redundancies and helps
eliminate the data anomalies.

5  Normalization works through a series of stages


called normal forms:
 First normal form (1NF)
 Second normal form (2NF)
 Third normal form (3NF)
 Fourth normal form (4NF)

 The highest level of normalization is not always


desirable.
Database Tables and Normalization
 The Need for Normalization
 Case of a Construction Company

5 


Building project -- Project number, Name,
Employees assigned to the project.
Employee -- Employee number, Name, Job
classification
 The company charges its clients by billing the
hours spent on each project. The hourly billing rate
is dependent on the employee’s position.
 Periodically, a report is generated.
 The table whose contents correspond to the
reporting requirements is shown in Table 5.1.
5
A Table Whose Structure Matches the Report Format

Figure 5.1
Database Tables and Normalization
 Problems with the Figure 5.1
 The project number is intended to be a primary

5
key, but it contains nulls.
 The table displays data redundancies.
 The table entries invite data inconsistencies.
 The data redundancies yield the following
anomalies:
 Update anomalies.
 Addition anomalies.
 Deletion anomalies.
Database Tables and Normalization
 Conversion to First Normal Form
 A relational table must not contain repeating groups.

5  Repeating groups can be eliminated by adding the


appropriate entry in at least the primary key column(s).

Figure 5.2 The Evergreen Data


Data Organization: First Normal Form

Figure 5.3
Database Tables and Normalization
 Dependency Diagram
 The primary key components are bold, underlined, and
shaded in a different color.

5 


The arrows above entities indicate all desirable
dependencies, i.e., dependencies that are based on PK.
The arrows below the dependency diagram indicate
less desirable dependencies -- partial dependencies
and transitive dependencies.

Figure 5.4
Database Tables and Normalization
 1NF Definition
 The term first normal form (1NF) describes the
tabular format in which:

5 


All the key attributes are defined.
There are no repeating groups in the table.
All attributes are dependent on the primary key.
Database Tables and Normalization
 Conversion to Second Normal Form
 Starting with the 1NF format, the database can be
converted into the 2NF format by

5 


Writing each key component on a separate line, and
then writing the original key on the last line and
Writing the dependent attributes after each new key.

PROJECT (PROJ_NUM, PROJ_NAME)


EMPLOYEE (EMP_NUM, EMP_NAME, JOB_CLASS,
CHG_HOUR)
ASSIGN (PROJ_NUM, EMP_NUM, HOURS)
Second Normal Form (2NF) Conversion Results

Figure 5.5
Database Tables and Normalization
 2NF Definition
 A table is in 2NF if:

5 


It is in 1NF and
It includes no partial dependencies; that is, no
attribute is dependent on only a portion of the
primary key.
(It is still possible for a table in 2NF to exhibit transitive
dependency; that is, one or more attributes may be
functionally dependent on nonkey attributes.)
Database Tables and Normalization
 Conversion to Third Normal Form
 Create a separate table with attributes in a
transitive functional dependence relationship.

5 PROJECT (PROJ_NUM, PROJ_NAME)


ASSIGN (PROJ_NUM, EMP_NUM, HOURS)
EMPLOYEE (EMP_NUM, EMP_NAME, JOB_CLASS)
JOB (JOB_CLASS, CHG_HOUR)
Database Tables and Normalization
 3NF Definition
 A table is in 3NF if:
 It is in 2NF and

5  It contains no transitive dependencies.


5 Figure 5.6
The Completed Database
Database Tables and Normalization
 Boyce-Codd Normal Form (BCNF)
 A table is in Boyce-Codd normal form (BCNF) if every
determinant in the table is a candidate key.

5 
(A determinant is any attribute whose value determines
other values with a row.)

If a table contains only one candidate key, the 3NF and


the BCNF are equivalent.
 BCNF is a special case of 3NF.
 Figure 5.7 illustrates a table that is in 3NF but not in
BCNF.
 Figure 5.8 shows how the table can be decomposed to
conform to the BCNF form.
A Table That Is In 3NF But Not In BCNF

5
Figure 5.7
The Decomposition of a Table Structure to Meet
BCNF Requirements

Figure 5.8
Sample Data for a BCNF Conversion

5
Table 5.2
Decomposition into BCNF

5
Figure 5.9
Database Tables and Normalization
 BCNF Definition
 A table is in BCNF if every determinant in that
table is a candidate key. If a table contains only

5 one candidate key, 3NF and BCNF are equivalent.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy