2006.09.14 - SLIDE 1IS 257 – Fall 2006 Normalization Normalization theory is based on the observation that relations with certain properties are more effective.

Slides:



Advertisements
Similar presentations
+ Review: Normalization and data anomalies CSCI 2141 W2013 Slide set modified from courses.ischool.berkeley.edu/i257/f06/.../Lecture06_257.ppt.
Advertisements

9/20/2000Information Organization and Retrieval Database Design: Object- Oriented Modeling, Logical Design and Normalization University of California,
SLIDE 1IS 202 – FALL 2005 Prof. Ray Larson UC Berkeley SIMS SIMS 202: Information Organization and Retrieval Normalization & The Relational.
Normalization of Database Tables
Fundamentals, Design, and Implementation, 9/e Chapter 4 The Relational Model and Normalization.
SLIDE 1IS 257 – Fall 2006 Database Design: Logical Models: Normalization and The Relational Model University of California, Berkeley School.
SLIDE 1IS 257 – Fall 2009 Database Design: Logical Models: Normalization and The Relational Model University of California, Berkeley School.
SLIDE 1IS Fall 2002 Physical Database Design University of California, Berkeley School of Information Management and Systems SIMS 202:
Database Design Conceptual –identify important entities and relationships –determine attribute domains and candidate keys –draw the E-R diagram Logical.
Boyce-Codd Normal Form Kelvin Nishikawa SE157a-03 Fall 2006 Kelvin Nishikawa SE157a-03 Fall 2006.
SLIDE 1IS 202 – FALL 2002 Prof. Ray Larson & Prof. Marc Davis UC Berkeley SIMS Tuesday and Thursday 10:30 am - 12:00 pm Fall 2002
Normalization of Database Tables
SLIDE 1IS 257 – Spring 2004 Physical Database Design University of California, Berkeley School of Information Management and Systems SIMS 257:
Normalization I.
12/5/2000Information Organization and Retrieval Database Design: Normalization and SQL University of California, Berkeley School of Information Management.
Database Design: Logical Model and Normalization
SLIDE 1IS 257 – Fall 2008 Database Design: Logical Models: Normalization and The Relational Model University of California, Berkeley School.
SLIDE 1IS 257 – Fall 2005 Database Design: Normalization and The Relational Model University of California, Berkeley School of Information.
8/28/97Information Organization and Retrieval Database Design: Normalization University of California, Berkeley School of Information Management and Systems.
Normalization of Database Tables
SLIDE 1IS 257 – Fall 2004 Database Design: Normalization and The Relational Model University of California, Berkeley School of Information.
SLIDE 1IS 257 – Fall 2009 Physical Database Design University of California, Berkeley School of Information I 257: Database Management.
SLIDE 1IS 202 – FALL 2003 Prof. Ray Larson & Prof. Marc Davis UC Berkeley SIMS Tuesday and Thursday 10:30 am - 12:00 pm Fall 2003
Chapter 5 Normalization of Database Tables
Database Systems Design, Implementation, and Management Coronel | Morris 11e ©2015 Cengage Learning. All Rights Reserved. May not be scanned, copied or.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 5 Normalization of Database Tables.
NORMALIZATION N. HARIKA (CSC).
SLIDE 1IS 257 – Spring 2004 Database Design: Normalization and Access DB Creation University of California, Berkeley School of Information.
Introduction to Schema Refinement. Different problems may arise when converting a relation into standard form They are Data redundancy Update Anomalies.
Chapter 3 The Relational Model and Normalization
Week 6 Lecture Normalization
DBSQL 4-1 Copyright © Genetic Computer School 2009 Chapter 4 Database Design.
Lecture 12 Inst: Haya Sammaneh
Chapter 5 The Relational Model and Normalization David M. Kroenke Database Processing © 2000 Prentice Hall.
Normalization. 2 Objectives u Purpose of normalization. u Problems associated with redundant data. u Identification of various types of update anomalies.
Database Systems: Design, Implementation, and Management Tenth Edition
RDBMS Concepts/ Session 3 / 1 of 22 Objectives  In this lesson, you will learn to:  Describe data redundancy  Describe the first, second, and third.
Concepts of Database Management, Fifth Edition
Database Systems: Design, Implementation, and Management Ninth Edition Chapter 6 Normalization of Database Tables.
Normalization. Learners Support Publications 2 Objectives u The purpose of normalization. u The problems associated with redundant data.
1 DATABASE SYSTEMS DESIGN IMPLEMENTATION AND MANAGEMENT INTERNATIONAL EDITION ROB CORONEL CROCKETT Chapter 7 Normalisation.
BIS Database Systems School of Management, Business Information Systems, Assumption University A.Thanop Somprasong Chapter # 5 Normalization of Database.
Logical Database Design Relational Model. Logical Database Design Logical database design: process of transforming conceptual data model into a logical.
SALINI SUDESH. Primarily a tool to validate and improve a logical design so that it satisfies certain constraints that avoid unnecessary duplication of.
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.
Normalization Well structured relations and anomalies Normalization First normal form (1NF) Functional dependence Partial functional dependency Second.
SLIDE 1IS 257 – Fall 2014 Database Design: Logical Models: Normalization and The Relational Model University of California, Berkeley School.
11/07/2003Akbar Mokhtarani (LBNL)1 Normalization of Relational Tables Akbar Mokhtarani LBNL (HENPC group) November 7, 2003.
SLIDE 1IS 202 – FALL 2006 Prof. Ray Larson UC Berkeley SIMS SIMS 202: Information Organization and Retrieval Introduction to Database Design.
Component 4/Unit 6d Topic IV: Design a simple relational database using data modeling and normalization Description and Information Gathering Data Model.
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.
Database Processing: Fundamentals, Design and Implementation, 9/e by David M. KroenkeChapter 4/1 Copyright © 2004 Please……. No Food Or Drink in the class.
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,
11/10/2009GAK1 Normalization. 11/10/2009GAK2 Learning Objectives Definition of normalization and its purpose in database design Types of normal forms.
Normalisation 1NF to 3NF Ashima Wadhwa. In This Lecture Normalisation to 3NF Data redundancy Functional dependencies Normal forms First, Second, and Third.
Microsoft Access 2010 Chapter 11 Database Design.
Dr. T. Y. Lin | SJSU | CS 157A | Fall 2015 Chapter 3 Database Normalization 1.
NormalisationNormalisation Normalization is the technique of organizing data elements into records. Normalization is the technique of organizing data elements.
Logical Database Design and Relational Data Model Muhammad Nasir
1 CS490 Database Management Systems. 2 CS490 Database Normalization.
University of California, Berkeley School of Information
Normalization.
Normalization Karolina muszyńska
Database Normalization
Chapter 6 Normalization of Database Tables
Normalization.
Normalization Normalization theory is based on the observation that relations with certain properties are more effective in inserting, updating and deleting.
University of California, Berkeley School of Information
Physical Database Design
Presentation transcript:

SLIDE 1IS 257 – Fall 2006 Normalization Normalization theory is based on the observation that relations with certain properties are more effective in inserting, updating and deleting data than other sets of relations containing the same data Normalization is a multi-step process beginning with an “unnormalized” relation –Hospital example

SLIDE 2IS 257 – Fall 2006 Normal Forms First Normal Form (1NF) Second Normal Form (2NF) Third Normal Form (3NF) Boyce-Codd Normal Form (BCNF) Fourth Normal Form (4NF) Fifth Normal Form (5NF)

SLIDE 3IS 257 – Fall 2006 Normalization Boyce- Codd and Higher Functional dependency of nonkey attributes on the primary key - Atomic values only Full Functional dependency of nonkey attributes on the primary key No transitive dependency between nonkey attributes All determinants are candidate keys - Single multivalued dependency

SLIDE 4IS 257 – Fall 2006 Unnormalized Relations First step in normalization is to convert the data into a two-dimensional table In unnormalized relations data can repeat within a column

SLIDE 5IS 257 – Fall 2006 Unnormalized Relation

SLIDE 6IS 257 – Fall 2006 First Normal Form To move to First Normal Form a relation must contain only atomic values at each row and column. –No repeating groups –A column or set of columns is called a Candidate Key when its values can uniquely identify the row in the relation.

SLIDE 7IS 257 – Fall 2006 First Normal Form

SLIDE 8IS 257 – Fall NF Storage Anomalies Insertion: A new patient has not yet undergone surgery -- hence no surgeon # -- Since surgeon # is part of the key we can’t insert. Insertion: If a surgeon is newly hired and hasn’t operated yet -- there will be no way to include that person in the database. Update: If a patient comes in for a new procedure, and has moved, we need to change multiple address entries. Deletion (type 1): Deleting a patient record may also delete all info about a surgeon. Deletion (type 2): When there are functional dependencies (like side effects and drug) changing one item eliminates other information.

SLIDE 9IS 257 – Fall 2006 Second Normal Form A relation is said to be in Second Normal Form when every nonkey attribute is fully functionally dependent on the primary key. –That is, every nonkey attribute needs the full primary key for unique identification

SLIDE 10IS 257 – Fall 2006 Second Normal Form

SLIDE 11IS 257 – Fall 2006 Second Normal Form

SLIDE 12IS 257 – Fall 2006 Second Normal Form

SLIDE 13IS 257 – Fall NF Storage Anomalies Removed Insertion: Can now enter new patients without surgery. Insertion: Can now enter Surgeons who haven’t operated. Deletion (type 1): If Charles Brown dies the corresponding tuples from Patient and Surgery tables can be deleted without losing information on David Rosen. Update: If John White comes in for third time, and has moved, we only need to change the Patient table

SLIDE 14IS 257 – Fall NF Storage Anomalies Insertion: Cannot enter the fact that a particular drug has a particular side effect unless it is given to a patient. Deletion: If John White receives some other drug because of the penicillin rash, and a new drug and side effect are entered, we lose the information that penicillin can cause a rash Update: If drug side effects change (a new formula) we have to update multiple occurrences of side effects.

SLIDE 15IS 257 – Fall 2006 Third Normal Form A relation is said to be in Third Normal Form if there is no transitive functional dependency between nonkey attributes –When one nonkey attribute can be determined with one or more nonkey attributes there is said to be a transitive functional dependency. The side effect column in the Surgery table is determined by the drug administered –Side effect is transitively functionally dependent on drug so Surgery is not 3NF

SLIDE 16IS 257 – Fall 2006 Third Normal Form

SLIDE 17IS 257 – Fall 2006 Third Normal Form

SLIDE 18IS 257 – Fall NF Storage Anomalies Removed Insertion: We can now enter the fact that a particular drug has a particular side effect in the Drug relation. Deletion: If John White recieves some other drug as a result of the rash from penicillin, but the information on penicillin and rash is maintained. Update: The side effects for each drug appear only once.

SLIDE 19IS 257 – Fall 2006 Boyce-Codd Normal Form Most 3NF relations are also BCNF relations. A 3NF relation is NOT in BCNF if: –Candidate keys in the relation are composite keys (they are not single attributes) –There is more than one candidate key in the relation, and –The keys are not disjoint, that is, some attributes in the keys are common

SLIDE 20IS 257 – Fall 2006 Most 3NF Relations are also BCNF – Is this one?

SLIDE 21IS 257 – Fall 2006 BCNF Relations

SLIDE 22IS 257 – Fall 2006 Normalization Normalization is performed to reduce or eliminate Insertion, Deletion or Update anomalies. However, a completely normalized database may not be the most efficient or effective implementation. “Denormalization” is sometimes used to improve efficiency.

SLIDE 23IS 257 – Fall 2006 Denormalization Usually driven by the need to improve query speed Query speed is improved at the expense of more complex or problematic DML (Data manipulation language) for updates, deletions and insertions.