normalisation
normalisation
5 2. Remove Anamoly-
Insertion,Deletion,Updation
3. Create Better Tables without any duplication
4. Create stable databases
Emp-proj table
5
but it contains nulls.
The table displays data redundancies.
The table entries invite data inconsistencies.
The data redundancies yield the following
anomalies/contradition :
Update anomalies.
Addition anomalies.
Deletion anomalies.
Database Tables and Normalization
Conversion to First Normal Form--A relational
table is in 1NF if it
5
must not contain repeating groups.
Repeating groups can be eliminated by adding the
appropriate entry in at least the primary key column(s).
create Table with only atomic values only
Figure 5.3
Database Tables and Normalization
Dependency Diagram after INF
The primary key components are bold, underlined
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
5
tabular format in which:
All the key attributes are defined.
There are no repeating groups in the table.
All attributes are dependent on the primary key.
2NF
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 Second Normal Form
Starting with the 1NF format, the database can be
5
converted into the 2NF format by
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.
Figure 5.5
Database Tables and Normalization
3NF Definition
A table is in 3NF if:
5
It is in 2NF and
It contains no transitive dependencies.
Database Tables and Normalization
Conversion to Third Normal Form
Create a separate table with attributes in a
5
transitive functional dependence relationship.
5
determinant in the table is a candidate key.
(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
5
table is a candidate key. If a table contains only
one candidate key, 3NF and BCNF are equivalent.
Higher-Level Normal Forms
4NF Definition
A table is in 4NF if it is in 3NF and has no multiple sets
5
of multivalued dependencies.
5
Normalized (decomposed) tables require additional
processing, reducing system speed.
Normalization purity is often difficult to sustain in the
modern database environment. The conflict between
design efficiency, information requirements, and
processing speed are often resolved through
compromises that include denormalization.
The Initial 1NF Structure
Figure 5.16
Identifying the Possible PK Attributes
Figure 5.17
Table Structures Based On The Selected PKs
Figure 5.18