Lecture 2 Normalization
|
|
|
- Kristopher Cummings
- 8 years ago
- Views:
Transcription
1 MIT 533 ระบบฐานข อม ล 2 Lecture 2 Normalization Walailuk University Lecture 2: Normalization 1
2 Objectives The purpose of normalization The identification of various types of update anomalies The concept of functional dependency How functional dependencies can be used to group attributes into relations that are in a known normal form. How toundertake the processof normalization. How toidentifythe mostcommonlyused normalforms, namelyfirst (1NF), second (2NF), and third (3NF) normalforms, and Boyce Codd normalform (BCNF). How toidentifyfourth (4NF), and fifth (5NF) normal forms. Lecture 2: Normalization 2
3 Normalization (Overview - I) Main objective in developing a logical data model for relational database systems is to create an accurate representation of the data, its relationships, and constraints. To achieve this objective, we must identify a suitable set of relations. A technique for producing a set of relations with desirable properties, given the data requirements of an enterprise. Developed by E.F. Codd (1972). Lecture 2: Normalization 3
4 Normalization (Overview - II) Often performed as a series of tests on a relation to determine whether it satisfies or violates the requirements of a given normal form. Four most commonly used normal forms are first (1NF), second (2NF), third (3NF) and Boyce-Codd (BCNF) normal forms. Based on functional dependencies among the attributes of a relation. A relation can be normalized to a specific form to prevent the possible occurrence of update anomalies. Lecture 2: Normalization 4
5 Purpose of Normalization Normalizationis a technique for producing a set of suitable relations that support the data requirements of an enterprise. Characteristics of a suitable set of relations include: the minimal number of attributes necessary to support the data requirements of the enterprise; attributes with a close logical relationship are found in the same relation; minimal redundancy with each attribute represented only once with the important exception of attributes that form all or part of foreign keys. Lecture 2: Normalization 5
6 Purpose of Normalization The benefits of using a database that has a suitable set of relations is that the database will be: easier for the user to access and maintain the data; take up minimal storage space on the computer. Lecture 2: Normalization 6
7 How Normalization Supports DB Design Lecture 2: Normalization 7
8 Data Redundancy Major aim of relational database design is to group attributes into relations to minimize data redundancy and reduce file storage space required by base relations. Problems associated with data redundancy are illustrated by comparing the Staff and Branch relations with the StaffBranch relation. StaffBranch: (staffno, sname, position, salary, branchno, baddress) Staff: (staffno, sname, position, salary, branchno) Branch: (branchno, baddress) Lecture 2: Normalization 8
9 Data Redundancy (An Example) Lecture 2: Normalization 9
10 Data Redundancy (Explanation to the example) StaffBranch relation has redundant data details of a branch are repeated for every member of staff. In contrast, branch information appears only once for each branch in Branch relation and only branchno is repeated in Staff relation, to represent where each member of staff works. Lecture 2: Normalization 10
11 Update Anomalies Relations that contain redundant information may potentially suffer from update anomalies. Types of update anomalies include Insertion Duplicate baddress (new staff) Null staffno (new branch) Deletion Some baddress may be lost. Modification Need to update all occurrences of baddress, if it is changed. Lecture 2: Normalization 11
12 Lossless-join and Dependency Preservation Properties To avoid update anomalies, we decompose a large relation into two or more relations. Two important properties of decomposition. Lossless-join property enables us to find any instance of the original relation from corresponding instances in the smaller relations. Dependency preservation property enables us to enforce a constraint on the original relation by enforcing some constraint on each of the smaller relations. Lecture 2: Normalization 12
13 Functional Dependency (I) Main concept associated with normalization is functional dependency Functional Dependency Describes the relationship between attributes in a relation. For example, if A and B are attributes of relation R, B is functionally dependent on A (denoted A B), if each value of A in R is associated with exactly one value of B in R. Lecture 2: Normalization 13
14 Functional Dependency (II) Property of the meaning or semantics of the attributes in a relation. The determinant of a functional dependency refers to the attribute or group of attributes on the left-hand side of the arrow. Diagrammatic representation. determinant Lecture 2: Normalization 14
15 Functional Dependency (An Example) Lecture 2: Normalization 15
16 How to Find Functional Dependency (Normalization) One approach to identifying the set of all possible values for attributes in a relation is to more clearly understand the purpose of each attribute in that relation. For example, the purpose of the values held in the staffno attribute is to uniquely identify each member of staff while the purpose of the values held in the snameattribute is to hold the names of members of staff. Main characteristics of functional dependencies used in normalization: have a 1:1 or M:1 relationship between attribute(s) on left and right-hand side of a dependency; hold for all time; are nontrivial. trivial: staffno, sname sname staffno, sname staffno Lecture 2: Normalization 16
17 Example Functional Dependency that holds for all Time Consider the values shown in staffno and sname attributes of the Staff relation. Based on sample data, the following functional dependencies appear to hold. staffno sname sname staffno However, the only functional dependency that remains true for all possible values for the staffno and snameattributes of the Staff relation is: staffno sname Lecture 2: Normalization 17
18 Properties: Functional Dependencies Determinants should have the minimal number of attributes necessary to maintain the functional dependency with the attribute(s) on the right hand-side. This requirement is called full functional dependency. Full functional dependencyindicates that if A and B are attributes of a relation, B is fully functionally dependent on A, if B is functionally dependent on A, but not on any proper subset of A. Lecture 2: Normalization 18
19 Example Full Functional Dependency Exists in the Staff relation staffno, sname branchno True - each value of (staffno, sname) is associated with a single value of branchno. However, branchno is also functionally dependent on a subset of (staffno, sname), namely staffno. Example above is a partial dependency. The full dependency will be as follows. staffno branchno Lecture 2: Normalization 19
20 Characteristics of Functional Dependencies Main characteristics of functional dependencies used in normalization: There is a one-to-one relationship between the attribute(s) on the left-hand side (determinant) and those on the right-hand side of a functional dependency. Holds for all time. The determinant has the minimal number of attributes necessary to maintain the dependency with the attribute(s) on the right hand-side. Lecture 2: Normalization 20
21 Identifying Functional Dependencies Identifying all functional dependencies between a set of attributes is relatively simple if the meaning of each attribute and the relationships between the attributes are well understood. This information should be provided by the enterprise in the form of discussions with users and/or documentation such as the users requirements specification. However, if the users are unavailable for consultation and/or the documentation is incomplete then depending on the database application it may be necessary for the database designer to use their common sense and/or experience to provide the missing information. Lecture 2: Normalization 21
22 Example -Identifying a set of functional dependencies for the StaffBranch relation Examine semantics of attributes in StaffBranch relation described previously. Assume that position held and branch determine a member of staff s salary. With sufficient information available, identify the functional dependencies for the StaffBranch relation as: staffno sname, position, salary, branchno, baddress branchno baddress baddress branchno branchno, position salary baddress, position salary Lecture 2: Normalization 22
23 Example -Using sample data to identify functional dependencies Consider the data for attributes denoted A, B, C, D, and E in the Sample relation. Important to establish that sample data values shown in relation are representative of all possible values that can be held by attributes A, B, C, D, and E. Assume true despite the relatively small amount of data shown in this relation. Lecture 2: Normalization 23
24 Example -Using sample data to identify functional dependencies Lecture 2: Normalization 24
25 Example -Using sample data to identify functional dependencies Function dependencies between attributes A to E in the Sample relation. A C (fd1) C A (fd2) B D (fd3) A, B E (fd4) Lecture 2: Normalization 25
26 Identifying the Primary Key for a Relation using Functional Dependencies Main purpose of identifying a set of functional dependencies for a relation is to specify the set of integrity constraints that must hold on a relation. An important integrity constraint to consider first is the identification of candidate keys, one of which is selected to be the primary key for the relation. Lecture 2: Normalization 26
27 Example -Identify Primary Key for StaffBranch Relation StaffBranch relation has five functional dependencies. The determinants are staffno, branchno, baddress, (branchno, position), and (baddress, position). To identify all candidate key(s), identify the attribute (or group of attributes) that uniquely identifies each tuplein this relation. staffno sname, position, salary, branchno, baddress branchno baddress baddress branchno branchno, position salary baddress, position salary Lecture 2: Normalization 27
28 Example -Identifying Primary Key for StaffBranch Relation All attributes that are not part of a candidate key should be functionally dependent on the key. The only candidate key and therefore primary key for StaffBranch relation, is staffno, as all other attributes of the relation are functionally dependent on staffno. Moreover there is one more primary, that is branchno. It will be the primary key for Branch relation. Lecture 2: Normalization 28
29 Example -Identifying Primary Key for Sample Relation Sample relation has four functional dependencies. The determinants in the Sample relation are A, B, C, and (A, B). However, the only determinant that functionally determines all the other attributes of the relation is (A, B). (A, B) is identified as the primary key for this relation. A C (fd1) C A (fd2) B D (fd3) A, B E (fd4) Lecture 2: Normalization 29
30 The Process of Normalization Formal technique for analyzing a relation based on its primary key and the functional dependencies between the attributes of that relation. Often executed as a series of steps. Each step corresponds to a specific normal form, which has known properties. As normalization proceeds, the relations become progressively more restricted (stronger) in format and also less vulnerable to update anomalies. Lecture 2: Normalization 30
31 Relationship Between Normal Forms Lecture 2: Normalization 31
32 Unnormalized Form (UNF) and First Normal Form (1NF) Unnormalized Form (UNF) A table that contains one or more repeating groups. To create an unnormalized table Transform the data from the information source (e.g. form) into table format with columns and rows. First Normal Form (1NF) A relation in which the intersection of each row and column contains one and only one value. Lecture 2: Normalization 32
33 UNF to 1NF Identifythe repeating group(s) in the unnormalized table which repeats for the key attribute(s). Remove the repeating group by Entering appropriate data into the empty columns of rows containing the repeating data ( flattening the table). OR Nominate an attribute or group of attributes to act as the primary key for the unnormalized table and then placingthe repeating data along with a copy of the original key attribute(s) into a separate relation. Lecture 2: Normalization 33
34 UNF to 1NF (An Example Form) Lecture 2: Normalization 34
35 UNF to 1NF (An Example Transformation Result) UNF 1NF Lecture 2: Normalization 35
36 UNF to 1NF (An Example Alternative Transformation Result) UNF 1NF Lecture 2: Normalization 36
37 Second Normal Form (2NF) Based on the concept of full functional dependency. Full functional dependency indicates that A and B are attributes of a relation, B is fully dependent on A if B is functionally dependent on A but not on any proper subset of A. 2NF A relation that is in 1NF and every nonprimary-key attribute is fully functionally dependent on the primary key. Lecture 2: Normalization 37
38 1NF to 2NF Identify the primary key for the 1NF relation. Identify the functional dependencies in the relation. If partial dependencies exist on the primary key remove them by placing then in a new relation along with a copy of their determinant. Lecture 2: Normalization 38
39 1NF to 2NF (An Example Functional Dependency) Lecture 2: Normalization 39
40 1NF to 2NF (An Example Transformation Result) 1NF 2NF Lecture 2: Normalization 40
41 Third Normal Form (3NF) Based on the concept of transitive dependency. A, B and C are attributes of a relation such that if A B and B C, then C is transitively dependent on A through B. (Provided that A is not functionally dependent on B or C). 3NF A relation that is in 1NF and 2NF and in which no non-primary-key attribute is transitively dependent on the primary key. Lecture 2: Normalization 41
42 2NF to 3NF Identify the primary key in the 2NF relation. Identify functional dependencies in the relation. If transitive dependencies exist on the primary key remove them by placing them in a new relation along with a copy of their dominant. Second normal form (2NF) A relation that is in 1NF and every non-primary-key attribute is fully functionally dependent on any candidate key. Third normal form (3NF) A relation that is in 1NF and 2NF and in which no nonprimary-key attribute is transitively dependent on any candidate key. Lecture 2: Normalization 42
43 2NF to 3NF (An Example Transformation Result) 2NF 3NF Lecture 2: Normalization 43
44 Summary Result of Normalization (I) Lecture 2: Normalization 44
45 Summary Result of Normalization (II) UNF 3NF Lecture 2: Normalization 45
46 Boyce-CoddNormal Form (BCNF) Based on functional dependencies that takes into account all candidate keys in a relation. However, BCNF also has additional constraints compared with general definition of 3NF. For a relation with only one candidate key, 3NF and BCNF are equivalent. A relation is in BCNF, if and only if every determinant is a candidate key. Violation of BCNF may occur in a relation that contains two (or more) composite keys which overlap and share at least one attribute in common. Lecture 2: Normalization 46
47 Difference between 3NF and BCNF Difference between 3NF and BCNF is that for a functional dependency A B, 3NF allows this dependency in a relation if B is a primary-key attribute and A is not a candidate key. Whereas, BCNF insists that for this dependency to remain in a relation, A must be a candidate key. Every relation in BCNF is also in 3NF. However, relation in 3NF may not be in BCNF. Lecture 2: Normalization 47
48 3NF to BCNF Identify all candidate keys in the relation. Identify all functional dependencies in the relation. If functional dependencies exists in the relation where their determinants are not candidate keys for the relation, remove the functional dependencies by placing them in a new relation along with a copy of their determinant. Lecture 2: Normalization 48
49 3NF to BCNF (An Example) 3NF BCNF Lecture 2: Normalization 49
50 Review of Normalization (Original Form) Lecture 2: Normalization 50
51 Review of Normalization (UNF to 1NF) UNF 1NF Lecture 2: Normalization 51
52 Review of Normalization (Functional Dependency) Lecture 2: Normalization 52
53 Review of Normalization (Final Result) StaffPropertyInspection (propertyno, idate, itime, paddress, comments, staffno, sname, carreg) PropertyInspection(propertyNo, idate, itime, comments, staffno, sname, carreg) Staff (staffno, sname) StaffCat (staffno, idate, carreg) PropertyInspect (propertyno, idate, itime, comments, staffno, carreg) Property (propertyno, paddress) Inspection (propertyno, idate, itime, comments, staffno) Lecture 2: Normalization 53
54 Fourth Normal Form (4NF) Although BCNF removes anomalies due to functional dependencies, another type of dependency called a multi-valued dependency (MVD) can also cause data redundancy. MVDs in a relation are due to first normal form (1NF), which disallows an attribute in a row from having a set of values. Lecture 2: Normalization 54
55 Fourth Normal Form (4NF) MVD Represents a dependency between attributes (for example, A, B, and C) in a relation, such that for each value of A there is a set of values for B, and a set of values for C. However, the set of values for B and C are independent of each other. MVD between attributes A, B, and C in a relation using the following notation: A > B A > C A 4NF relation that is in Boyce-Codd Normal Form (BCNF) and contains no MVDs. BCNF to 4NF involves the removal of the MVD from the relation by placing the attribute(s) in a new relation along with a copy of the determinant(s). Lecture 2: Normalization 55
56 BCNF to 4NF (An Example) BCNF 4NF Lecture 2: Normalization 56
57 Fifth Normal Form (5NF) A relation decomposed into two relations must have lossless-join property, which ensures that no spurious tuples are generated when relations are reunited through a natural join. However, there are requirements to decompose a relation into more than two relations. Although rare, these cases are managed by join dependency and fifth normal form (5NF). 5NF A relation that has no join dependency. Lecture 2: Normalization 57
58 Fifth Normal Form (5NF) (An Example) Consider the following statement: If Property PG4 requires Bed Supplier S2 supplies property PG4 Supplier S2 provides Bed Then Supplier S2 provides Bed for property PG4 To identify this type of constraint on the PropertyItemSupplierrelation, use 5NF Lecture 2: Normalization 58
59 4NF to 5NF (An Example) INCORRECT 4NF 5NF Lecture 2: Normalization 59
60 Exercise I Normalize the following relation Lecturer_Course_Rel(DID, Dept, LID, Lname, Lroom, CID, CName, Credit, DW, LTime, PID, PType) DID Dept. LID LName CID CName Credit LRoom LTime DW PID PType 101 Intro. To Comp :00-16:00 Mon. 01 Sony 0001 Minger 105 Prog. Lang :00-10:20 Tue. 02 Panasonic 10 IT 003 Math II :40-12:00 Thu. 04 Phillips 0002 Craven 105 Prog. Lang :40-16:00 Wed. 02 Panasonic 003 Math II :00-14:20 Thu. 01 Sony 0101 Taylor 11 ME 208 Fluid Dynamics :00-12:00 Mon 01 Sony 0102 Chen 208 Fluid Dynamics :40-16:00 Fri. 04 Phillips 0201 Ahmed 307 Concrete Eng :00-14:20 Tue. 05 Sharp 12 CE 0202 Brown 304 Hydraulics :00-10:20 Wed. 02 Panasonic Where, DID: Department Identifier Dept: Department Name LID: Lecture Identifier Lecturer:Lecturer Name LRoom: Lecture Room CID: Course Identifier Course: Course Name LTime: Lecture Time DW: Day in Week PID: Projector Identifier PType: Projector Type Lecture 2: Normalization 60
61 Exercise II Normalize the following form. ABC Hospital Patient Medication Form Date: 23/03/2004 Full Name: Peter Pakinson Bed Number: 1205 Drug No. Name Description Dosage Ward Number: Ward 11 Ward Name: Orthopaedic Method of Admin Units per day Start Date Finish Date Morphine Pain Killer 10 mg/ml Oral 50 24/03/04 24/04/ Tetracyclene Antibiotic 0.5 mg/ml IV 10 24/03/04 24/05/ Morphine Pain Killer 10 mg/ml Oral 10 25/04/04 28/05/04 Created By: Ms Patana Created Date: 23/03/04 Lecture 2: Normalization 61
62 Exercise III Normalize the following form. Staff No. Doctor Name Patient Name App. Date App. Time Room Nurse Fee 102 Tony Smith Kingston 24/05/04 10:00 R03 Jerry Mary Mind Mice 22/05/04 13:00 R05 Jennifer John Robin Mice 28/05/04 15:00 R34 Mary Tony Smith Susan 28/05/04 9:00 R34 Mary Helen Peter Jim 26/05/04 11:00 R03 Nancy 1200 Lecture 2: Normalization 62
63 Exercise IV Normalize the following form. CDID Movie Name Artist Producer Barcode Member ID Rental Date Fee 1001 Harry Plotter (I) John Sony 7234 M234 12/02/ Ghosts Phillip Paramou nt 3454 M231 15/01/ Harry Plotter (I) John Sony 2344 M214 02/02/ Armageddon Nick Paramou nt 2342 M156 14/06/ Armageddon Nick Paramou nt 2342 M234 13/07/04 20 Lecture 2: Normalization 63
64 Lecture 2: Normalization 64 Exercise V Find functional dependency/normalize the following table. p w j g d a q w l h e a r z k i f a p w j g d b s w m g e b s z m h f b u w o i d c r z k i f c q w l h e c F E D C B A
Normalization. Normalization. Normalization. Data Redundancy
Normalization Normalization o Main objective in developing a logical data model for relational database systems is to create an accurate representation of the data, its relationships, and constraints.
DATABASE NORMALIZATION
DATABASE NORMALIZATION Normalization: process of efficiently organizing data in the DB. RELATIONS (attributes grouped together) Accurate representation of data, relationships and constraints. Goal: - Eliminate
Normalization. Purpose of normalization Data redundancy Update anomalies Functional dependency Process of normalization
Normalization Purpose of normalization Data redundancy Update anomalies Functional dependency Process of normalization 1 Purpose of Normalization Normalization is a technique for producing a set of suitable
Normalization in Database Design
in Database Design Marek Rychly mrychly@strathmore.edu Strathmore University, @ilabafrica & Brno University of Technology, Faculty of Information Technology Advanced Databases and Enterprise Systems 14
DBMS. Normalization. Module Title?
Normalization Database Normalization Database normalization is the process of removing redundant data from your tables in to improve storage efficiency, data integrity (accuracy and consistency), and scalability
Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases
Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 15 Outline Informal Design Guidelines
Database Design and Normalization
Database Design and Normalization CPS352: Database Systems Simon Miner Gordon College Last Revised: 9/27/12 Agenda Check-in Functional Dependencies (continued) Design Project E-R Diagram Presentations
COSC344 Database Theory and Applications. Lecture 9 Normalisation. COSC344 Lecture 9 1
COSC344 Database Theory and Applications Lecture 9 Normalisation COSC344 Lecture 9 1 Overview Last Lecture Functional Dependencies This Lecture Normalisation Introduction 1NF 2NF 3NF BCNF Source: Section
Bridge from Entity Relationship modeling to creating SQL databases, tables, & relations
1 Topics for this week: 1. Good Design 2. Functional Dependencies 3. Normalization Readings for this week: 1. E&N, Ch. 10.1-10.6; 12.2 2. Quickstart, Ch. 3 3. Complete the tutorial at http://sqlcourse2.com/
DATABASE DESIGN: NORMALIZATION NOTE & EXERCISES (Up to 3NF)
DATABASE DESIGN: NORMALIZATION NOTE & EXERCISES (Up to 3NF) Tables that contain redundant data can suffer from update anomalies, which can introduce inconsistencies into a database. The rules associated
Normalization of Database
Normalization of Database UNIT-4 Database Normalisation is a technique of organizing the data in the database. Normalization is a systematic approach of decomposing tables to eliminate data redundancy
Functional Dependency and Normalization for Relational Databases
Functional Dependency and Normalization for Relational Databases Introduction: Relational database design ultimately produces a set of relations. The implicit goals of the design activity are: information
Database Management System
UNIT -6 Database Design Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms; Boyce-Codd Normal
Chapter 10. Functional Dependencies and Normalization for Relational Databases
Chapter 10 Functional Dependencies and Normalization for Relational Databases Chapter Outline 1 Informal Design Guidelines for Relational Databases 1.1Semantics of the Relation Attributes 1.2 Redundant
Functional Dependencies and Finding a Minimal Cover
Functional Dependencies and Finding a Minimal Cover Robert Soulé 1 Normalization An anomaly occurs in a database when you can update, insert, or delete data, and get undesired side-effects. These side
MCQs~Databases~Relational Model and Normalization http://en.wikipedia.org/wiki/database_normalization
http://en.wikipedia.org/wiki/database_normalization Database normalization is the process of organizing the fields and tables of a relational database to minimize redundancy. Normalization usually involves
Theory of Relational Database Design and Normalization
Theory of Relational Database Design and Normalization (Based on Chapter 14 and some part of Chapter 15 in Fundamentals of Database Systems by Elmasri and Navathe, Ed. 3) 1 Informal Design Guidelines for
Schema Refinement, Functional Dependencies, Normalization
Schema Refinement, Functional Dependencies, Normalization MSCI 346: Database Systems Güneş Aluç, University of Waterloo Spring 2015 MSCI 346: Database Systems Chapter 19 1 / 42 Outline 1 Introduction Design
CS143 Notes: Normalization Theory
CS143 Notes: Normalization Theory Book Chapters (4th) Chapters 7.1-6, 7.8, 7.10 (5th) Chapters 7.1-6, 7.8 (6th) Chapters 8.1-6, 8.8 INTRODUCTION Main question How do we design good tables for a relational
CS 377 Database Systems. Database Design Theory and Normalization. Li Xiong Department of Mathematics and Computer Science Emory University
CS 377 Database Systems Database Design Theory and Normalization Li Xiong Department of Mathematics and Computer Science Emory University 1 Relational database design So far Conceptual database design
Chapter 5: Logical Database Design and the Relational Model Part 2: Normalization. Introduction to Normalization. Normal Forms.
Chapter 5: Logical Database Design and the Relational Model Part 2: Normalization Modern Database Management 6 th Edition Jeffrey A. Hoffer, Mary B. Prescott, Fred R. McFadden Robert C. Nickerson ISYS
Theory of Relational Database Design and Normalization
Theory of Relational Database Design and Normalization (Based on Chapter 14 and some part of Chapter 15 in Fundamentals of Database Systems by Elmasri and Navathe) 1 Informal Design Guidelines for Relational
Chapter 10. Functional Dependencies and Normalization for Relational Databases. Copyright 2007 Ramez Elmasri and Shamkant B.
Chapter 10 Functional Dependencies and Normalization for Relational Databases Copyright 2007 Ramez Elmasri and Shamkant B. Navathe Chapter Outline 1 Informal Design Guidelines for Relational Databases
Normalisation 6 TABLE OF CONTENTS LEARNING OUTCOMES
Topic Normalisation 6 LEARNING OUTCOMES When you have completed this Topic you should be able to: 1. Discuss importance of the normalisation in the database design. 2. Discuss the problems related to data
Database Systems Concepts, Languages and Architectures
These slides are for use with Database Systems Concepts, Languages and Architectures Paolo Atzeni Stefano Ceri Stefano Paraboschi Riccardo Torlone To view these slides on-screen or with a projector use
A. TRUE-FALSE: GROUP 2 PRACTICE EXAMPLES FOR THE REVIEW QUIZ:
GROUP 2 PRACTICE EXAMPLES FOR THE REVIEW QUIZ: Review Quiz will contain very similar question as below. Some questions may even be repeated. The order of the questions are random and are not in order of
Chapter 5: FUNCTIONAL DEPENDENCIES AND NORMALIZATION FOR RELATIONAL DATABASES
1 Chapter 5: FUNCTIONAL DEPENDENCIES AND NORMALIZATION FOR RELATIONAL DATABASES INFORMAL DESIGN GUIDELINES FOR RELATION SCHEMAS We discuss four informal measures of quality for relation schema design in
Chapter 10 Functional Dependencies and Normalization for Relational Databases
Chapter 10 Functional Dependencies and Normalization for Relational Databases Copyright 2004 Pearson Education, Inc. Chapter Outline 1 Informal Design Guidelines for Relational Databases 1.1Semantics of
Normalization. Functional Dependence. Normalization. Normalization. GIS Applications. Spring 2011
Normalization Normalization Normalization is a foundation for relational database design Systematic approach to efficiently organize data in a database GIS Applications Spring 2011 Objectives Minimize
Database Design and Normal Forms
Database Design and Normal Forms Database Design coming up with a good schema is very important How do we characterize the goodness of a schema? If two or more alternative schemas are available how do
Database Design Methodologies
Critical Success Factors in Database Design Database Design Methodologies o Work interactively with the users as much as possible. o Follow a structured methodology throughout the data modeling process.
Databases -Normalization III. (N Spadaccini 2010 and W Liu 2012) Databases - Normalization III 1 / 31
Databases -Normalization III (N Spadaccini 2010 and W Liu 2012) Databases - Normalization III 1 / 31 This lecture This lecture describes 3rd normal form. (N Spadaccini 2010 and W Liu 2012) Databases -
Introduction to normalization. Introduction to normalization
Introduction to normalization Lecture 4 Instructor Anna Sidorova Agenda Presentation Review of relational models, in class exersise Introduction to normalization In-class exercises Discussion of HW2 1
Normalization in OODB Design
Normalization in OODB Design Byung S. Lee Graduate Programs in Software University of St. Thomas St. Paul, Minnesota bslee@stthomas.edu Abstract When we design an object-oriented database schema, we need
Relational Database Design
Relational Database Design To generate a set of relation schemas that allows - to store information without unnecessary redundancy - to retrieve desired information easily Approach - design schema in appropriate
Normalisation to 3NF. Database Systems Lecture 11 Natasha Alechina
Normalisation to 3NF Database Systems Lecture 11 Natasha Alechina In This Lecture Normalisation to 3NF Data redundancy Functional dependencies Normal forms First, Second, and Third Normal Forms For more
Schema Design and Normal Forms Sid Name Level Rating Wage Hours
Entity-Relationship Diagram Schema Design and Sid Name Level Rating Wage Hours Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1 Database Management Systems, 2 nd Edition. R. Ramakrishnan
RELATIONAL DATABASE DESIGN
RELATIONAL DATABASE DESIGN g Good database design - Avoiding anomalies g Functional Dependencies g Normalization & Decomposition Using Functional Dependencies g 1NF - Atomic Domains and First Normal Form
Relational Database Design: FD s & BCNF
CS145 Lecture Notes #5 Relational Database Design: FD s & BCNF Motivation Automatic translation from E/R or ODL may not produce the best relational design possible Sometimes database designers like to
LOGICAL DATABASE DESIGN
MODULE 8 LOGICAL DATABASE DESIGN OBJECTIVE QUESTIONS There are 4 alternative answers to each question. One of them is correct. Pick the correct answer. Do not guess. A key is given at the end of the module
Week 11: Normal Forms. Logical Database Design. Normal Forms and Normalization. Examples of Redundancy
Week 11: Normal Forms Database Design Database Redundancies and Anomalies Functional Dependencies Entailment, Closure and Equivalence Lossless Decompositions The Third Normal Form (3NF) The Boyce-Codd
Normalization. CIS 331: Introduction to Database Systems
Normalization CIS 331: Introduction to Database Systems Normalization: Reminder Why do we need to normalize? To avoid redundancy (less storage space needed, and data is consistent) To avoid update/delete
Database Normalization. Mohua Sarkar, Ph.D Software Engineer California Pacific Medical Center 415-600-7003 sarkarm@sutterhealth.
Database Normalization Mohua Sarkar, Ph.D Software Engineer California Pacific Medical Center 415-600-7003 sarkarm@sutterhealth.org Definition A database is an organized collection of data whose content
DATABASE SYSTEMS. Chapter 7 Normalisation
DATABASE SYSTEMS DESIGN IMPLEMENTATION AND MANAGEMENT INTERNATIONAL EDITION ROB CORONEL CROCKETT Chapter 7 Normalisation 1 (Rob, Coronel & Crockett 978184480731) In this chapter, you will learn: What normalization
C# Cname Ccity.. P1# Date1 Qnt1 P2# Date2 P9# Date9 1 Codd London.. 1 21.01 20 2 23.01 2 Martin Paris.. 1 26.10 25 3 Deen London.. 2 29.
4. Normalisation 4.1 Introduction Suppose we are now given the task of designing and creating a database. How do we produce a good design? What relations should we have in the database? What attributes
Database Design. Marta Jakubowska-Sobczak IT/ADC based on slides prepared by Paula Figueiredo, IT/DB
Marta Jakubowska-Sobczak IT/ADC based on slides prepared by Paula Figueiredo, IT/DB Outline Database concepts Conceptual Design Logical Design Communicating with the RDBMS 2 Some concepts Database: an
Schema Refinement and Normalization
Schema Refinement and Normalization Module 5, Lectures 3 and 4 Database Management Systems, R. Ramakrishnan 1 The Evils of Redundancy Redundancy is at the root of several problems associated with relational
Functional Dependencies and Normalization
Functional Dependencies and Normalization 5DV119 Introduction to Database Management Umeå University Department of Computing Science Stephen J. Hegner hegner@cs.umu.se http://www.cs.umu.se/~hegner Functional
Why Is This Important? Schema Refinement and Normal Forms. The Evils of Redundancy. Functional Dependencies (FDs) Example (Contd.)
Why Is This Important? Schema Refinement and Normal Forms Chapter 19 Many ways to model a given scenario in a database How do we find the best one? We will discuss objective criteria for evaluating database
Fundamentals of Database System
Fundamentals of Database System Chapter 4 Normalization Fundamentals of Database Systems (Chapter 4) Page 1 Introduction To Normalization In general, the goal of a relational database design is to generate
DATABASE DESIGN: Normalization Exercises & Answers
DATABASE DESIGN: Normalization Exercises & Answers (a) The table shown in Figure 1 is susceptible to update anomalies. Provide examples of insertion, deletion, and modification anomalies. Answers: This
Lecture Notes on Database Normalization
Lecture Notes on Database Normalization Chengkai Li Department of Computer Science and Engineering The University of Texas at Arlington April 15, 2012 I decided to write this document, because many students
Design of Relational Database Schemas
Design of Relational Database Schemas T. M. Murali October 27, November 1, 2010 Plan Till Thanksgiving What are the typical problems or anomalies in relational designs? Introduce the idea of decomposing
normalisation Goals: Suppose we have a db scheme: is it good? define precise notions of the qualities of a relational database scheme
Goals: Suppose we have a db scheme: is it good? Suppose we have a db scheme derived from an ER diagram: is it good? define precise notions of the qualities of a relational database scheme define algorithms
Carnegie Mellon Univ. Dept. of Computer Science 15-415 - Database Applications. Overview - detailed. Goal. Faloutsos CMU SCS 15-415
Faloutsos 15-415 Carnegie Mellon Univ. Dept. of Computer Science 15-415 - Database Applications Lecture #17: Schema Refinement & Normalization - Normal Forms (R&G, ch. 19) Overview - detailed DB design
CSCI-GA.2433-001 Database Systems Lecture 7: Schema Refinement and Normalization
CSCI-GA.2433-001 Database Systems Lecture 7: Schema Refinement and Normalization Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com View 1 View 2 View 3 Conceptual Schema At that point we
Database Constraints and Design
Database Constraints and Design We know that databases are often required to satisfy some integrity constraints. The most common ones are functional and inclusion dependencies. We ll study properties of
Introduction to Databases, Fall 2005 IT University of Copenhagen. Lecture 5: Normalization II; Database design case studies. September 26, 2005
Introduction to Databases, Fall 2005 IT University of Copenhagen Lecture 5: Normalization II; Database design case studies September 26, 2005 Lecturer: Rasmus Pagh Today s lecture Normalization II: 3rd
Announcements. SQL is hot! Facebook. Goal. Database Design Process. IT420: Database Management and Organization. Normalization (Chapter 3)
Announcements IT0: Database Management and Organization Normalization (Chapter 3) Department coin design contest deadline - February -week exam Monday, February 1 Lab SQL SQL Server: ALTER TABLE tname
If it's in the 2nd NF and there are no non-key fields that depend on attributes in the table other than the Primary Key.
Normalization First Normal Form (1st NF) The table cells must be of single value. Eliminate repeating groups in individual tables. Create a separate table for each set of related data. Identify each set
Normalization. CIS 3730 Designing and Managing Data. J.G. Zheng Fall 2010
Normalization CIS 3730 Designing and Managing Data J.G. Zheng Fall 2010 1 Overview What is normalization? What are the normal forms? How to normalize relations? 2 Two Basic Ways To Design Tables Bottom-up:
Chapter 7: Relational Database Design
Chapter 7: Relational Database Design Pitfalls in Relational Database Design Decomposition Normalization Using Functional Dependencies Normalization Using Multivalued Dependencies Normalization Using Join
Chapter 7: Relational Database Design
Chapter 7: Relational Database Design Database System Concepts, 5th Ed. See www.db book.com for conditions on re use Chapter 7: Relational Database Design Features of Good Relational Design Atomic Domains
7.1 The Information system
Chapter 7. Database Planning, Design and Administration Last few decades have seen proliferation of software applications, many requiring constant maintenance involving: correcting faults, implementing
Normalisation. Why normalise? To improve (simplify) database design in order to. Avoid update problems Avoid redundancy Simplify update operations
Normalisation Why normalise? To improve (simplify) database design in order to Avoid update problems Avoid redundancy Simplify update operations 1 Example ( the practical difference between a first normal
Normal forms and normalization
Normal forms and normalization An example of normalization using normal forms We assume we have an enterprise that buys products from different supplying companies, and we would like to keep track of our
An Algorithmic Approach to Database Normalization
An Algorithmic Approach to Database Normalization M. Demba College of Computer Science and Information Aljouf University, Kingdom of Saudi Arabia bah.demba@ju.edu.sa ABSTRACT When an attempt is made to
Part 6. Normalization
Part 6 Normalization Normal Form Overview Universe of All Data Relations (normalized / unnormalized 1st Normal Form 2nd Normal Form 3rd Normal Form Boyce-Codd Normal Form (BCNF) 4th Normal Form 5th Normal
CS2Bh: Current Technologies. Introduction to XML and Relational Databases. The Relational Model. The relational model
CS2Bh: Current Technologies Introduction to XML and Relational Databases Spring 2005 The Relational Model CS2 Spring 2005 (LN6) 1 The relational model Proposed by Codd in 1970. It is the dominant data
Chapter 9: Normalization
Chapter 9: Normalization Part 1: A Simple Example Part 2: Another Example & The Formal Stuff A Problem: Keeping Track of Invoices (cont d) Suppose we have some invoices that we may or may not want to refer
BCA. Database Management System
BCA IV Sem Database Management System Multiple choice questions 1. A Database Management System (DBMS) is A. Collection of interrelated data B. Collection of programs to access data C. Collection of data
Chapter 6. Database Tables & Normalization. The Need for Normalization. Database Tables & Normalization
Chapter 6 Database Tables & Normalization Objectives: to learn What normalization is and what role it plays in the database design process About the normal forms 1NF, 2NF, 3NF, BCNF, and 4NF How normal
Relational Normalization: Contents. Relational Database Design: Rationale. Relational Database Design. Motivation
Relational Normalization: Contents Motivation Functional Dependencies First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Decomposition Algorithms Multivalued Dependencies and
Optimum Database Design: Using Normal Forms and Ensuring Data Integrity. by Patrick Crever, Relational Database Programmer, Synergex
Optimum Database Design: Using Normal Forms and Ensuring Data Integrity by Patrick Crever, Relational Database Programmer, Synergex Printed: April 2007 The information contained in this document is subject
Databases and BigData
Eduardo Cunha de Almeida eduardo.almeida@uni.lu Outline of the course Introduction Database Systems (E. Almeida) Distributed Hash Tables and P2P (C. Cassagnes) NewSQL (D. Kim and J. Meira) NoSQL (D. Kim)
Limitations of E-R Designs. Relational Normalization Theory. Redundancy and Other Problems. Redundancy. Anomalies. Example
Limitations of E-R Designs Relational Normalization Theory Chapter 6 Provides a set of guidelines, does not result in a unique database schema Does not provide a way of evaluating alternative schemas Normalization
Boyce-Codd Normal Form
4NF Boyce-Codd Normal Form A relation schema R is in BCNF if for all functional dependencies in F + of the form α β at least one of the following holds α β is trivial (i.e., β α) α is a superkey for R
Unit 3.1. Normalisation 1 - V2.0 1. Normalisation 1. Dr Gordon Russell, Copyright @ Napier University
Normalisation 1 Unit 3.1 Normalisation 1 - V2.0 1 Normalisation Overview discuss entity integrity and referential integrity describe functional dependency normalise a relation to first formal form (1NF)
The Relational Model. Why Study the Relational Model? Relational Database: Definitions
The Relational Model Database Management Systems, R. Ramakrishnan and J. Gehrke 1 Why Study the Relational Model? Most widely used model. Vendors: IBM, Microsoft, Oracle, Sybase, etc. Legacy systems in
Relational Database Design Theory
Relational Database Design Theory Informal guidelines for good relational designs Functional dependencies Normal forms and normalization 1NF, 2NF, 3NF BCNF, 4NF, 5NF Inference rules on functional dependencies
Database design 1 The Database Design Process: Before you build the tables and other objects that will make up your system, it is important to take time to design it. A good design is the keystone to creating
2. Basic Relational Data Model
2. Basic Relational Data Model 2.1 Introduction Basic concepts of information models, their realisation in databases comprising data objects and object relationships, and their management by DBMS s that
DATABASE MANAGEMENT SYSTEMS. Question Bank:
DATABASE MANAGEMENT SYSTEMS Question Bank: UNIT 1 1. Define Database? 2. What is a DBMS? 3. What is the need for database systems? 4. Define tupule? 5. What are the responsibilities of DBA? 6. Define schema?
Lecture 6. SQL, Logical DB Design
Lecture 6 SQL, Logical DB Design Relational Query Languages A major strength of the relational model: supports simple, powerful querying of data. Queries can be written intuitively, and the DBMS is responsible
How To Write A Diagram
Data Model ing Essentials Third Edition Graeme C. Simsion and Graham C. Witt MORGAN KAUFMANN PUBLISHERS AN IMPRINT OF ELSEVIER AMSTERDAM BOSTON LONDON NEW YORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE
LiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen 2007-05-24
LiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen 2007-05-24 1. A database schema is a. the state of the db b. a description of the db using a
Topic 5.1: Database Tables and Normalization
Topic 5.1: Database Tables and Normalization What is Normalization? Normalization is a process for evaluating and correcting table structures to minimize data redundancies, thereby helping to eliminate
RELATIONAL DATABASE DESIGN. Basic Concepts
Basic Concepts a database is an collection of logically related records a relational database stores its data in 2-dimensional tables a table is a two-dimensional structure made up of rows (tuples, records)
Normalisation 1. Chapter 4.1 V4.0. Copyright @ Napier University
Normalisation 1 Chapter 4.1 V4.0 Copyright @ Napier University Normalisation Overview discuss entity integrity and referential integrity describe functional dependency normalise a relation to first formal
Normalization. Reduces the liklihood of anomolies
Normalization Normalization Tables are important, but properly designing them is even more important so the DBMS can do its job Normalization the process for evaluating and correcting table structures
Chapter 8. Database Design II: Relational Normalization Theory
Chapter 8 Database Design II: Relational Normalization Theory The E-R approach is a good way to start dealing with the complexity of modeling a real-world enterprise. However, it is only a set of guidelines
EECS 647: Introduction to Database Systems
EECS 647: Introduction to Database Systems Instructor: Luke Huan Spring 2013 Administrative Take home background survey is due this coming Friday The grader of this course is Ms. Xiaoli Li and her email
6.830 Lecture 3 9.16.2015 PS1 Due Next Time (Tuesday!) Lab 1 Out today start early! Relational Model Continued, and Schema Design and Normalization
6.830 Lecture 3 9.16.2015 PS1 Due Next Time (Tuesday!) Lab 1 Out today start early! Relational Model Continued, and Schema Design and Normalization Animals(name,age,species,cageno,keptby,feedtime) Keeper(id,name)
Relational Normalization Theory (supplemental material)
Relational Normalization Theory (supplemental material) CSE 532, Theory of Database Systems Stony Brook University http://www.cs.stonybrook.edu/~cse532 2 Quiz 8 Consider a schema S with functional dependencies:
Functional Dependencies
BCNF and 3NF Functional Dependencies Functional dependencies: modeling constraints on attributes stud-id name address course-id session-id classroom instructor Functional dependencies should be obtained
SQL DDL. DBS Database Systems Designing Relational Databases. Inclusion Constraints. Key Constraints
DBS Database Systems Designing Relational Databases Peter Buneman 12 October 2010 SQL DDL In its simplest use, SQL s Data Definition Language (DDL) provides a name and a type for each column of a table.
Database Management Systems. Redundancy and Other Problems. Redundancy
Database Management Systems Winter 2004 CMPUT 391: Database Design Theory or Relational Normalization Theory Dr. Osmar R. Zaïane Lecture 2 Limitations of Relational Database Designs Provides a set of guidelines,
Objectives, outcomes, and key concepts. Objectives: give an overview of the normal forms and their benefits and problems.
Normalization Page 1 Objectives, outcomes, and key concepts Tuesday, January 6, 2015 11:45 AM Objectives: give an overview of the normal forms and their benefits and problems. Outcomes: students should
COMP 378 Database Systems Notes for Chapter 7 of Database System Concepts Database Design and the Entity-Relationship Model
COMP 378 Database Systems Notes for Chapter 7 of Database System Concepts Database Design and the Entity-Relationship Model The entity-relationship (E-R) model is a a data model in which information stored
060010102 Database Management Systems 2015
Module 1- File Organization and Structure Short Questions: 1. How data differs from information? 2. What are the different types of cache memory? 3. List at least two devices where flash memory is used.