Scribd
Upload
13 views3 pages

Presentation DBMS

Uploaded by

Naveed Malik
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
13 views3 pages

Presentation DBMS

Uploaded by

Naveed Malik
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/ 3

Presentation DBMS

Naveed Malik
November 2024

article amsmath longtable

Normalization in DBMS
Normalization in Database Management Systems (DBMS) is the process
of organizing data to reduce redundancy and improve data integrity. It involves
dividing a database into tables and defining relationships to ensure that data is
logically stored and efficiently retrievable.
Normalization is done in stages called normal forms (NFs). Below are the
first three normal forms, along with their definitions, examples, and concepts of
dependencies.

1. First Normal Form (1NF)


Definition: A table is in 1NF if:

• Each column contains atomic (indivisible) values.


• Each column contains values of a single type.
• Each row is unique, with no repeating groups.
Example: Unnormalized Table:

StudentID Name Courses


1 John M ath, P hysics
2 Sarah Chemistry, Biology

Normalized Table in 1NF:


StudentID Name Course
1 John M ath
1 John P hysics
2 Sarah Chemistry
2 Sarah Biology

1
2. Second Normal Form (2NF)
Definition: A table is in 2NF if:
• It is in 1NF.
• All non-key attributes are fully functionally dependent on the entire pri-
mary key (i.e., no partial dependency).
Partial Dependency: A partial dependency occurs when a non-key
attribute depends on only part of a composite primary key.
Example: Table in 1NF:
StudentID Course Instructor Department
1 M ath P rof.X Science
1 P hysics P rof.Y Science
2 Chemistry P rof.Z Science
Here, Department depends only on Course, not the full composite key
(StudentID, Course).
Normalized Tables in 2NF:
StudentID Course Instructor
1 M ath P rof.X
1 P hysics P rof.Y
2 Chemistry P rof.Z

Course Department
M ath Science
P hysics Science
Chemistry Science

3. Third Normal Form (3NF)


Definition: A table is in 3NF if:
• It is in 2NF.
• There are no transitive dependencies (i.e., no non-key attribute depends
on another non-key attribute).
Transitive Dependency: A transitive dependency occurs when a non-
key attribute depends on another non-key attribute instead of directly on the
primary key.
Example: Table in 2NF:
StudentID Course Instructor InstructorContact
1 M ath P rof.X 12345
1 P hysics P rof.Y 67890
2 Chemistry P rof.Z 11223

2
Here, InstructorContact depends on Instructor, not directly on the pri-
mary key (StudentID, Course).
Normalized Tables in 3NF:
StudentID Course Instructor
1 M ath P rof.X
1 P hysics P rof.Y
2 Chemistry P rof.Z

Instructor InstructorContact
P rof.X 12345
P rof.Y 67890
P rof.Z 11223

You might also like