4 TH NORMAL FORM By: Karen McVay. REVIEW OF NFs 1NF  All values of the columns are atomic. That is, they contain no repeating values. 1NF  All values.

Slides:



Advertisements
Similar presentations
Higher Normal Forms By John Nicosia CS 157a Fall 2007.
Advertisements

Schema Refinement: Normal Forms
Shantanu Narang.  Background  Why and What of Normalization  Quick Overview of Lower Normal Forms  Higher Order Normal Forms.
Boyce-Codd NF Takahiko Saito Spring 2005 CS 157A.
Normalization What is it?
Chapter 3 Notes. 3.1 Functional Dependencies A functional dependency is a statement that – two tuples of a relation that agree on some particular set.
Normalisation The theory of Relational Database Design.
4 TH NORMAL FORM & Lossless Decomposition By: Karen McVay CS 157B.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 15 Basics of Functional Dependencies and Normalization for Relational.
Jump to first page Normalization Jump to first page Topics n Why normalization is needed n What causes anomalies n What the 4 normal forms are n How.
Chapter 8 Normal Forms Based on Functional Dependencies Deborah Costa Oct 18, 2007.
Fundamentals, Design, and Implementation, 9/e Chapter 4 The Relational Model and Normalization.
Database Design Conceptual –identify important entities and relationships –determine attribute domains and candidate keys –draw the E-R diagram Logical.
1 Database Design Theory Which tables to have in a database Normalization.
4 Normal Form Nathanael Chow CS 157A Fall 2006 Dr. Lee.
1 Multi-valued Dependencies. 2 Multivalued Dependencies There are database schemas in BCNF that do not seem to be sufficiently normalized. Consider a.
© 2002 by Prentice Hall 1 David M. Kroenke Database Processing Eighth Edition Chapter 5 The Relational Model and Normalization.
Normalization II. Boyce–Codd Normal Form (BCNF) Based on functional dependencies that take into account all candidate keys in a relation, however BCNF.
Chapter 14 Advanced Normalization Transparencies © Pearson Education Limited 1995, 2005.
Introduction to Schema Refinement
©Silberschatz, Korth and Sudarshan7.1Database System Concepts Chapter 7: Relational Database Design First Normal Form Pitfalls in Relational Database Design.
Normalization B Database Systems Normal Forms Wilhelm Steinbuss Room G1.25, ext. 4041
Lecture 12 Inst: Haya Sammaneh
Web-Enabled Decision Support Systems
Copyright © Curt Hill Schema Refinement III 4 th NF and 5 th NF.
Fundamentals, Design, and Implementation, 9/e. Database Processing: Fundamentals, Design and Implementation, 9/e by David M. KroenkeChapter 4/2 Copyright.
Avoiding Database Anomalies
NormalizationNormalization Chapter 4. Purpose of Normalization Normalization  A technique for producing a set of relations with desirable properties,
RDBMS Concepts/ Session 3 / 1 of 22 Objectives  In this lesson, you will learn to:  Describe data redundancy  Describe the first, second, and third.
Normalization. Learners Support Publications 2 Objectives u The purpose of normalization. u The problems associated with redundant data.
Normalization (Codd, 1972) Practical Information For Real World Database Design.
Lecture 6 Normalization: Advanced forms. Objectives How inference rules can identify a set of all functional dependencies for a relation. How Inference.
Further Normalization II: Higher Normal Forms Prof. Yin-Fu Huang CSIE, NYUST Chapter 13.
Schema Refinement and Normal Forms 20131CS3754 Class Notes #7, John Shieh.
Chapter 7 1 Database Principles Data Normalization Primarily a tool to validate and improve a logical design so that it satisfies certain constraints that.
CS143 Review: Normalization Theory Q: Is it a good table design? We can start with an ER diagram or with a large relation that contain a sample of the.
DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall, Modified by Dr. Mathis 3-1 David M. Kroenke’s Chapter Three: The Relational.
Normal Forms through BCNF CPSC 356 Database Ellen Walker Hiram College (Includes figures from Database Systems by Connolly & Begg, © Addison Wesley 2002)
Normalization Well structured relations and anomalies Normalization First normal form (1NF) Functional dependence Partial functional dependency Second.
CSE314 Database Systems Basics of Functional Dependencies and Normalization for Relational Databases Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E.
Unit 4 Object Relational Modeling. Key Concepts Object-Relational Modeling outcomes and process Relational data model Normalization Anomalies Functional.
IST 210 Normalization 2 Todd Bacastow IST 210. Normalization Methods Inspection Closure Functional dependencies are key.
In this session, you will learn to: Describe data redundancy Describe the first, second, and third normal forms Describe the Boyce-Codd Normal Form Appreciate.
Design Process - Where are we?
Dr. Mohamed Osman Hegaz1 Logical data base design (2) Normalization.
9/23/2012ISC329 Isabelle Bichindaritz1 Normalization.
Normalization. 2 u Main objective in developing a logical data model for relational database systems is to create an accurate representation of the data,
Normalization MIS335 Database Systems. Why Normalization? Optimizing database structure Removing duplications Accelerating the instructions Data integrity!
Normalization.
Multivalued Dependencies Fourth Normal Form Tony Palladino 157B.
Multivalued Dependencies and 4th NF CIS 4301 Lecture Notes Lecture /21/2006.
Brian Thoms.  Databases normalization The systematic way of ensuring that a database structure is suitable for general-purpose querying and free of certain.
11/10/2009GAK1 Normalization. 11/10/2009GAK2 Learning Objectives Definition of normalization and its purpose in database design Types of normal forms.
RELATIONAL TABLE NORMALIZATION. Key Concepts Guidelines for Primary Keys Deletion anomaly Update anomaly Insertion anomaly Functional dependency Transitive.
Chapter 8 Relational Database Design. 2 Relational Database Design: Goals n Reduce data redundancy (undesirable replication of data values) n Minimize.
NormalisationNormalisation Normalization is the technique of organizing data elements into records. Normalization is the technique of organizing data elements.
Objectives of Normalization  To create a formal framework for analyzing relation schemas based on their keys and on the functional dependencies among.
NORMALIZATION Handout - 4 DBMS. What is Normalization? The process of grouping data elements into tables in a way that simplifies retrieval, reduces data.
Logical Database Design and Relational Data Model Muhammad Nasir
SLIDE 1IS 257 – Fall 2006 Normalization Normalization theory is based on the observation that relations with certain properties are more effective.
1 CS490 Database Management Systems. 2 CS490 Database Normalization.
4NF & MULTIVALUED DEPENDENCY By Kristina Miguel. Review  Superkey – a set of attributes which will uniquely identify each tuple in a relation  Candidate.
4TH NORMAL FORM By: Karen McVay.
Advanced Normalization
A brief summary of database normalization
Advanced Normalization
Module 5: Overview of Normalization
Normalization.
4 Normal Form.
Chapter 7a: Overview of Database Design -- Normalization
Presentation transcript:

4 TH NORMAL FORM By: Karen McVay

REVIEW OF NFs 1NF  All values of the columns are atomic. That is, they contain no repeating values. 1NF  All values of the columns are atomic. That is, they contain no repeating values. 2NF  it is in 1NF and every non-key column is fully dependent upon the primary key. 2NF  it is in 1NF and every non-key column is fully dependent upon the primary key.

REVIEW OF NF Cont… 3NF  it is already in 2NF and every non-key column is non transitively dependent upon its primary key. In other words, all non-key attributes are functionally dependent only upon the primary key. 3NF  it is already in 2NF and every non-key column is non transitively dependent upon its primary key. In other words, all non-key attributes are functionally dependent only upon the primary key. BCNF  A relation is in BCNF if every determinant is a candidate key. This is an improved form of third normal form. BCNF  A relation is in BCNF if every determinant is a candidate key. This is an improved form of third normal form. Determinant: an attribute on which some other attribute is fully functionally dependent

4th Normal Form A Boyce Codd normal form relation is in fourth normal form if (a) there is no multi value dependency in the relation or (b) there are multi value dependency but the attributes, which are multi value dependent on a specific attribute, are dependent between themselves.

4 th Normal Form Cont… This is best discussed through mathematical notation. Assume the following relation R(a:pk1, b:pk2, c:pk3) Recall that a relation is in BCNF if all its determinant are candidate keys, in other words each determinant can be used as a primary key. Because relation R has only one determinant (a, b, c), which is the composite primary key and since the primary is a candidate key therefore R is in BCNF.

4 th Normal Form Cont… Now R may or may not be in fourth normal form. 1. If R contains no multi value dependency then R will be in Fourth normal form. 2. Assume R has the following two-multi value dependencies: a --->> b and a --->> c In this case R will be in the fourth normal form if b and c dependent on each other. However if b and c are independent of each other then R is not in fourth normal form and the relation has to be projected to following two non-loss projections. These non- loss projections will be in fourth normal form.

Many-to-many relationships Fourth Normal Form applies to situations involving many-to-many relationships. In relational databases, many-to-many relationships are expressed through cross-reference tables. 4th Normal Form Cont…

Note about FDs and MVDs Every Functional Dependency is a MVD Every Functional Dependency is a MVD (if A 1 A 2 …A n  B 1 B 2 …B n, then A 1 A 2 …A n  B 1 B 2 …B n ) FDs rule out certain tuples (i.e. if A  B then two tuples will not have the same value for A and different values for B) FDs rule out certain tuples (i.e. if A  B then two tuples will not have the same value for A and different values for B) MVDs do not rule out tuples. They guarantee that certain tuples must exist. MVDs do not rule out tuples. They guarantee that certain tuples must exist.

Formal Definitions Fourth Normal Form - if R is valid BCNF and… - given the “non-trivial” MVD: A 1 A 2 …A n  B 1 B 2 …B n {A 1 A 2 …A n } is a superkey Fourth Normal Form - if R is valid BCNF and… - given the “non-trivial” MVD: A 1 A 2 …A n  B 1 B 2 …B n {A 1 A 2 …A n } is a superkey A MVD: A 1 A 2 …A n  B 1 B 2 …B n for a Relation R is “non-trivial” if: 1.none of the Bs are among the As 2.Not all of the attributes of R are among the As and Bs A MVD: A 1 A 2 …A n  B 1 B 2 …B n for a Relation R is “non-trivial” if: 1.none of the Bs are among the As 2.Not all of the attributes of R are among the As and Bs A MVD is “trivial” if it contains all the variations of A 1 A 2 …A n x B 1 B 2 …B n. A MVD is “trivial” if it contains all the variations of A 1 A 2 …A n x B 1 B 2 …B n. A relation cannot be decomposed any further (under 4NF rules) if it has a trivial MVD A relation cannot be decomposed any further (under 4NF rules) if it has a trivial MVD

Consider a case of class enrollment. Each student can be enrolled in one or more classes and each class can contain one or more students. Clearly, there is a many-to-many relationship between classes and students. This relationship can be represented by a Student/Class cross-reference table: {StudentID, ClassID} Example 1

Example 1 Cont… The key for this table is the combination of StudentID and ClassID. To avoid violation of 2NF, all other information about each student and each class is stored in separate Student and Class tables, respectively. The key for this table is the combination of StudentID and ClassID. To avoid violation of 2NF, all other information about each student and each class is stored in separate Student and Class tables, respectively. Note that each StudentID determines not a unique ClassID, but a well-defined, finite set of values. This kind of behavior is referred to as multi-valued dependency of ClassID on StudentID. Note that each StudentID determines not a unique ClassID, but a well-defined, finite set of values. This kind of behavior is referred to as multi-valued dependency of ClassID on StudentID.

Consider another example with two many-to-many relationships, between students and classes and between classes and teachers. Consider another example with two many-to-many relationships, between students and classes and between classes and teachers. Example 2 StudentsClasses ** Also, a many-to-many relationship between students and teachers is implied. Also, a many-to-many relationship between students and teachers is implied. ClassesTeachers **

However, the business rules do not constrain this relationship in any way—the combination of StudentID and TeacherID does not contain any additional information beyond the information implied by the student/class and class/teacher relationships. However, the business rules do not constrain this relationship in any way—the combination of StudentID and TeacherID does not contain any additional information beyond the information implied by the student/class and class/teacher relationships. Consequentially, the student/class and class/teacher relationships are independent of each other—these relationships have no additional constraints. The following table is, then, in violation of 4NF: Consequentially, the student/class and class/teacher relationships are independent of each other—these relationships have no additional constraints. The following table is, then, in violation of 4NF: {StudentID, ClassID, TeacherID} Example 2 Cont…

As an example of the anomalies that can occur, realize that it is not possible to add a new class taught by some teacher without adding at least one student who is enrolled in this class. As an example of the anomalies that can occur, realize that it is not possible to add a new class taught by some teacher without adding at least one student who is enrolled in this class. To achieve 4NF, represent each independent many-to-many relationship through its own cross-reference table. To achieve 4NF, represent each independent many-to-many relationship through its own cross-reference table. 4 th NF and Anomalies

4 th Normal Form and anomalies Cont… Case 1: Assume the following relation: Employee (Eid:pk1, Language:pk2, Skill:pk3) No multi value dependency, therefore R is in fourth normal form. No multi value dependency, therefore R is in fourth normal form.

case 2: Assume the following relation with multi-value dependency: Employee (Eid:pk1, Languages:pk2, Skills:pk3) Eid --->> LanguagesEid --->> Skills Languages and Skills are dependent. This says an employee speak several languages and has several skills. However for each skill a specific language is used when that skill is practiced. 4th Normal Form and anomalies Cont…

Thus employee 100 when he/she teaches speaks English but when he cooks speaks French. This relation is in fourth normal form and does not suffer from any anomalies. EidLanguageSkill 100EnglishTeaching 100KurdishPolitic 100FrenchCooking 200EnglishCooking 200ArabicSinging

case 3: Assume the following relation with multi- value dependency: Employee (Eid:pk1, Languages:pk2, Skills:pk3) Eid --->> LanguagesEid --->> Skills Languages and Skills are independent. 4th Normal Form and anomalies Cont…

EidLanguageSkill 100EnglishTeaching 100KurdishPolitic 100EnglishPolitic 100KurdishTeaching 200ArabicSinging This relation is not in fourth normal form and suffers from all three types of anomalies.

Insertion anomaly: To insert row (200 English Cooking) we have to insert two extra rows (200 Arabic cooking), and (200 English Singing) otherwise the database will be inconsistent. Note the table will be as follow: EidLanguageSkill 100EnglishTeaching 100KurdishPolitics 100EnglishPolitics 100KurdishTeaching 200ArabicSinging 200EnglishCooking 200ArabicCooking 200EnglishSinging

Deletion anomaly: If employee 100 discontinue politic skill we have to delete two rows: Deletion anomaly: If employee 100 discontinue politic skill we have to delete two rows: (100 Kurdish Politic), and (100 English Politic) otherwise the database will be inconsistent. EidLanguageSkill 100EnglishTeaching 100KurdishPolitics 100EnglishPolitics 100KurdishTeaching 200ArabicSinging 200EnglishCooking 200ArabicCooking 200EnglishSinging

More anomalies Update anomaly: If employee 200 changes his skill from singing to dancing we have to make changes in more than one place. Update anomaly: If employee 200 changes his skill from singing to dancing we have to make changes in more than one place.

The relation is projected to the following two non-loss projections which are in forth normal form Emplyee_Language(Eid:pk1, Languages:pk2) EidLanguage 100English 100Kurdish 200Arabic

Emplyee_Language(Eid:pk1, Skills:pk2) EidSkill 100Teaching 100Politic 200Singing Cont…

References Functional Dependency (Normalization) ny/files/Normalization.htm ny/files/Normalization.htm ny/files/Normalization.htm Multivalued Dependencies (Ozmar Zaine): al/notes/Chapter7/node13.html al/notes/Chapter7/node13.html al/notes/Chapter7/node13.html