
Database Systems Normalization Concepts
Explore the fundamentals of database normalization, including the different normal forms such as 1NF, 2NF, 3NF, and BCNF. Understand the sequence of normal forms and learn how to transform data into higher normal forms for optimal database design.
Download Presentation

Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
CS405G: INTRODUCTION TO DATABASE SYSTEMS Jinze Liu 1 6/25/2025
Normalization We discuss four normal forms: first, second, third, and Boyce-Codd normal forms 1NF, 2NF, 3NF, and BCNF Normalizationis a process that improves a database design by generating relations that are of higher normal forms. The objective of normalization: to create relations where every dependency is on the key, the whole key, and nothing but the key . 2 6/25/2025 Jinze Liu @ University of Kentucky
Normalization There is a sequence to normal forms: 1NF is considered the weakest, 2NF is stronger than 1NF, 3NF is stronger than 2NF, and BCNF is considered the strongest Also, any relation that is in BCNF, is in 3NF; any relation in 3NF is in 2NF; and any relation in 2NF is in 1NF. 3 6/25/2025
Normalization 1NF a relation in BCNF, is also in 3NF 2NF a relation in 3NF is also in 2NF 3NF a relation in 2NF is also in 1NF BCNF 4 6/25/2025
First Normal Form First Normal Form We say a relation is in 1NF if all values stored in the relation are single-valued and atomic. 1NF places restrictions on the structure of relations. Values must be simple. 6 6/25/2025
First Normal Form The following is not in 1NF EmpNum 123 333 679 EmpPhone 233-9876 233-1231 233-1231 EmpDegrees BA, BSc, PhD BSc, MSc EmpDegrees is a multi-valued field: employee 679 has two degrees: BSc and MSc employee 333 has three degrees: BA, BSc, PhD 7 6/25/2025
First Normal Form EmpNum 123 333 679 EmpPhone 233-9876 233-1231 233-1231 EmpDegrees BA, BSc, PhD BSc, MSc To obtain 1NF relations we must, without loss of information, replace the above with two relations - see next slide 8 6/25/2025
First Normal Form EmployeeDegree Employee EmpNum EmpDegree 333 333 333 679 679 EmpNum 123 333 679 EmpPhone 233-9876 233-1231 233-1231 BA BSc PhD BSc MSc A join between Employee and EmployeeDegree will produce the information we saw before 9 6/25/2025
Review Functional dependencies X ->Y: X determines Y If two rows agree on X, they must agree on Y A generalization of the key concepts X x Y y1 A a1 x ? a2 y1 10 6/25/2025
Functional Dependencies EmpNum EmpEmail 123 jdoe@abc.com 456 psmith@abc.com 555 alee1@abc.com 633 pdoe@abc.com 787 alee2@abc.com EmpFname John Peter Alan Peter Alan EmpLname Doe Smith Lee Doe Lee If EmpNum is the PK then the FDs: EmpNum EmpEmail EmpNum EmpFname EmpNum EmpLname must exist. 11 6/25/2025
Functional Dependencies EmpNum EmpEmail EmpNum EmpFname EmpNum EmpLname 3 different ways you might see FDs depicted EmpEmail EmpFname EmpNum EmpLname EmpNum EmpEmail EmpFname EmpLname 12 6/25/2025
Determinant Functional Dependency EmpNum EmpEmail Attribute on the LHS is known as the determinant EmpNum is a determinant of EmpEmail 13 6/25/2025
What functional dependencies? EmployeeProject ssn pnumber hours ename plocation WORKS ON Essn pno hours 14 6/25/2025
Transitive dependency Transitive dependency Transitive dependency Consider attributes A, B, and C, and where A B and B C. Functional dependencies are transitive, which means that we also have the functional dependency A C We say that C is transitively dependent on A through B. 15 6/25/2025
Transitive dependency Transitive dependency EmpNum DeptNum EmpNum EmpEmail DeptNum DeptNname DeptNum DeptName EmpNum EmpEmail DeptNum DeptNname DeptName is transitively dependent on EmpNum via DeptNum EmpNum DeptName 16 6/25/2025
Partial dependency Partial dependency A partial dependency exists when an attribute B is functionally dependent on an attribute A, and A is a component of a multipart candidate key. InvNum LineNum Qty InvDate Candidate keys: {InvNum, LineNum} InvDate is partially dependent on {InvNum, LineNum} as InvNum is a determinant of InvDate and InvNum is part of a candidate key 17 6/25/2025
Second Normal Form Second Normal Form A relation is in 2NF if it is in 1NF, and every non-key attribute is fully dependent on each candidate key. (That is, we don t have any partial functional dependency.) 2NF (and 3NF) both involve the concepts of key and non-key attributes. A key attribute is any attribute that is part of a key; Any attribute that is not a key attribute, is a non-key attribute. Relations that are not in BCNF have data redundancies A relation in 2NF will not have any partial dependencies 18 6/25/2025
Second Normal Form Consider this InvLine table (in 1NF): InvNum LineNum ProdNum Qty InvDate InvNum, LineNum ProdNum There are two candidate keys. Qty InvNum, ProdNum LineNum Qty is the only non- key attribute, and it is dependent on InvNum InvNum InvDate Since there is a determinant that is not a candidate key, InvLine is not BCNF InvLine is only in 1NF InvLine is not 2NF since there is a partial dependency of InvDate on InvNum 19 6/25/2025
Second Normal Form InvLine InvNum The above relation has redundancies: the invoice date is repeated on each invoice line. LineNum ProdNum Qty InvDate We can improve the database by decomposing the relation into two relations: LineNum InvNum ProdNum Qty InvNum InvDate Question: What is the highest normal form for these relations? 2NF? 3NF? BCNF? 20 6/25/2025
Third Normal Form A relation is in 3NF if the relation is in 1NF and all determinants of non-key attributes are candidate keys That is, for any functional dependency: X Y, where Y is a non-key attribute (or a set of non-key attributes), X is a candidate key. This definition of 3NF differs from BCNF only in the specification of non-key attributes BCNF requires all determinants to be candidate keys. A relation in 3NF will not have any transitive dependencies 21 6/25/2025
Third Normal Form Consider this Employee relation Candidate keys are? EmpNum EmpName DeptNum DeptName EmpName, DeptNum, and DeptName are non-key attributes. DeptNum determines DeptName, a non-key attribute, and DeptNum is not a candidate key. Is the relation in 3NF? no Is the relation in BCNF? no Is the relation in 2NF? yes 22 6/25/2025
Third Normal Form EmpNum EmpName DeptNum DeptName We correct the situation by decomposing the original relation into two 3NF relations. Note the decomposition is lossless. EmpNum EmpName DeptNum DeptNum DeptName Verify these two relations are in 3NF. Are they in BCNF? 23 6/25/2025
Boyce-Codd Normal Form BCNF is defined very simply: a relation is in BCNF if it is in 1NF and if every determinant is a candidate key. If our database will be used for OLTP (on line transaction processing), then BCNF is our target. Usually, we meet this objective. However, we might denormalize (3NF, 2NF, or 1NF) for performance reasons. 24 6/25/2025
Boyce-Codd Normal Form InvNum LineNum ProdNum Qty InvNum, LineNum ProdNum {InvNum, LineNum} and {InvNum, ProdNum} are the two candidate keys. Qty InvNum, ProdNum LineNum There are two candidate keys. Since every determinant is a candidate key, the relation is in BCNF This relation is about Invoice lines only. 25 6/25/2025
inv_no line_no prod_no prod_desc qty 26 6/25/2025
2NF, but not in 3NF, nor in BCNF: inv_no line_no prod_no prod_desc qty since prod_no is not a candidate key and we have: prod_no prod_desc. 27 6/25/2025
EmployeeDept ename ssn bdate address dnumber dname 28 6/25/2025
2NF, but not in 3NF, nor in BCNF: EmployeeDept ename ssn bdate address dnumber dname since dnumber is not a candidate key and we have: dnumber dname. 29 6/25/2025
Instructor teaches one course only. student_no course_no instr_no Student takes a course and has one instructor. {student_no, course_no} instr_no instr_no course_no 30 6/25/2025
In 3NF, but not in BCNF: Instructor teaches one course only. student_no course_no instr_no Student takes a course and has one instructor. {student_no, course_no} instr_no instr_no course_no since we have instr_no course-no, but instr_no is not a Candidate key. 31 6/25/2025
student_no course_no instr_no student_no instr_no course_no instr_no {student_no, instr_no} student_no {student_no, instr_no} instr_no instr_no course_no 32 6/25/2025
Another example: 3NF Address (street_address, city, state, zip) street_address, city, state -> zip zip -> city, state Keys {street_address, city, state} {street_address, zip} BCNF? Violation: zip -> city, state 33 6/25/2025
To decompose or not to decompose Address1 (zip, city, state) Address2 (street_address, zip) FD s in Address1 zip -> city, state FD s in Address2 None! Hey, where is street_address, city, state->zip? Cannot check without joining Address1 and Address2 back together Dilemma: Should we get rid of redundancy at the expense of making constraints harder to enforce? 34 6/25/2025
BCNF = no redundancy? Student (SID, CID, club) Suppose your classes have nothing to do with the clubs you join FD s? None BCNF? Yes Redundancies? Tons! SID 142 142 142 142 123 123 ... CID CPS116 ballet CPS116 sumo CPS114 ballet CPS114 sumo CPS116 chess CPS116 golf ... club ... 35 6/25/2025
Multivalued dependencies A multivalued dependency (MVD) has the form X->>Y, where X and Y are sets of attributes in a relation R X ->>Y means that whenever two rows in R agree on all the attributes of X, then we can swap their Y components and get two new rows that are also in R X a b1 c1 a b2 c2 a b1 c2 a b2 c1 Y Z Must be in R too 36 6/25/2025
4NF decomposition example SID CID club 142 CPS116 ballet 142 CPS116 sumo Student (SID, CID, club) 4NF violation: SID ->>CID 142 CPS114 ballet 142 CPS114 sumo 123 CPS116 chess 123 CPS116 ... ... golf ... Enroll (SID, CID) 4NF Join (SID, club) 4NF SID 142 142 123 ... CID CPS116 CPS114 CPS116 ... SID 142 142 123 123 ... club ballet sumo chess golf ... 6/25/2025 37
3NF, BCNF, 4NF, and beyond Anomaly/normal form 3NF BCNF 4NF Lose FD s? Redundancy due to FD s No Possible Possible No Possible No Redundancy due to MVD s Possible Possible No Of historical interests 1NF: All column values must be atomic 2NF: Slightly more relaxed than 3NF 38 6/25/2025
Summary Philosophy behind BCNF, 4NF: Data should depend on the key, the whole key, and nothing but the key! Philosophy behind 3NF: But not at the expense of more expensive constraint enforcement! 39 6/25/2025