Informationslogistik Unit 7: Conceptual Design of Databases Normalization
|
|
- Mary Cameron
- 6 years ago
- Views:
Transcription
1 Informationslogistik Unit 7: Conceptual Design of Databases Normalization 17. V. 2011
2 Outline 1 Organization 2 SQL: Regular Expressions and Date Functions 3 Reminder and Overview 4 Normalization First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Fourth Normal Form
3 Organization nächste Woche 2. Zwischentest (Stoff bis inkl. korrel. Subqueries) zusätzliche Unterlagen zu Normalisierung: Kapitel 2 von Andreas Meier: Relationale und postrelationale Datenbanken, Springer (innerhalb der Uni online verfügbar)
4 SQL-Lesson 7 Today: Self-Joins
5 Reminder and Overview In Unit 3 (The Relational Model) we already had some guidelines on how to design a relational database: start with entities, relations, and attributes put them in relational database (cf. slides of Unit 3) Now we deal with some refinements. The base for these refinements is the notion of functional dependency.
6 Normalization: Outlook We know about: functional dependencies (Unit 5) properties of good decompositions (Unit 6)
7 Normalization: Outlook We know about: functional dependencies (Unit 5) properties of good decompositions (Unit 6) We want: a good way to decompose a given relation R
8 Normalization: Outlook We know about: functional dependencies (Unit 5) properties of good decompositions (Unit 6) We want: a good way to decompose a given relation R We do this by: step-by-step normalization with each step we reach a higher level of normalization (1 to 4)
9 First Normal Form Outline 1 Organization 2 SQL: Regular Expressions and Date Functions 3 Reminder and Overview 4 Normalization First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Fourth Normal Form
10 First Normal Form First Normal Form Definition (1NF) A relation is in 1NF, if all attributes are atomic. We have made this assumption already before. Example of table/relation not in 1NF: Father Mother Cildren Rene Mara {Kalle, Jakob} Ronald Elisabeth {Hannes, Kathrin} Andreas Marianne {Sophia}
11 First Normal Form First Normal Form An Example Example of table/relation not in 1NF: Father Mother Cildren Rene Mara {Kalle, Jakob} Ronald Elisabeth {Hannes, Kathrin} Andreas Marianne {Sophia} can easily be converted to 1NF: Father Mother Cild Rene Mara Kalle Rene Mara Jakob Ronald Elisabeth Hannes Ronald Elisabeth Kathrin Andreas Marianne Sophia
12 Second Normal Form Outline 1 Organization 2 SQL: Regular Expressions and Date Functions 3 Reminder and Overview 4 Normalization First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Fourth Normal Form
13 Second Normal Form Second Normal Form Definition (2NF) A relation is in 2NF, if it is in 1NF and each non-key attribute is fully functionally dependent on each candidate key. (Recall: β is fully FD from α if α β and α minimal.) Intuition: Each attribute in the key matters.
14 Second Normal Form Second Normal Form An Example Consider the following table containing student information: (Assumption: only one study per student) fname sname mnr stkz study c_no course date mark List dependencies of non-key attributes: fname: sname: stkz: study: course: mark: table not in 2NF
15 Second Normal Form Second Normal Form An Example Consider the following table containing student information: (Assumption: only one study per student) fname sname mnr stkz study c_no course date mark List dependencies of non-key attributes: fname: mnr sname: stkz: study: course: mark: table not in 2NF
16 Second Normal Form Second Normal Form An Example Consider the following table containing student information: (Assumption: only one study per student) fname sname mnr stkz study c_no course date mark List dependencies of non-key attributes: fname: mnr sname: mnr stkz: study: course: mark: table not in 2NF
17 Second Normal Form Second Normal Form An Example Consider the following table containing student information: (Assumption: only one study per student) fname sname mnr stkz study c_no course date mark List dependencies of non-key attributes: fname: mnr sname: mnr stkz: mnr study: course: mark: table not in 2NF
18 Second Normal Form Second Normal Form An Example Consider the following table containing student information: (Assumption: only one study per student) fname sname mnr stkz study c_no course date mark List dependencies of non-key attributes: fname: mnr sname: mnr stkz: mnr study: mnr course: mark: table not in 2NF
19 Second Normal Form Second Normal Form An Example Consider the following table containing student information: (Assumption: only one study per student) fname sname mnr stkz study c_no course date mark List dependencies of non-key attributes: fname: mnr sname: mnr stkz: mnr study: mnr course: c_no mark: table not in 2NF
20 Second Normal Form Second Normal Form An Example Consider the following table containing student information: (Assumption: only one study per student) fname sname mnr stkz study c_no course date mark List dependencies of non-key attributes: fname: mnr sname: mnr stkz: mnr study: mnr course: c_no mark: mnr, c_no, date table not in 2NF
21 Second Normal Form Second Normal Form An Example fname sname mnr stkz study c_no course date mark Table can be turned into 2NF by summarizing attributes that depend on the same key attributes into a new table: mnr fname surname stkz study c_no course mnr c_no date_exam mark
22 Third Normal Form Outline 1 Organization 2 SQL: Regular Expressions and Date Functions 3 Reminder and Overview 4 Normalization First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Fourth Normal Form
23 Third Normal Form Third Normal Form Definition (3NF) A relation is in 3NF, if it is in 1NF and for each FD α B at least one of the following conditions holds: 1 B α, i.e. the FD α B is trivial, 2 B is contained in a candidate key, 3 α is a superkey. In particular, a relation is not in 3NF, if there is a FD between attributes that are not part of a (candidate/super-) key.
24 Third Normal Form Third Normal Form An Example Example. mnr fname surname stkz study c_no course mnr c_no date_exam mark
25 Third Normal Form Third Normal Form An Example Example. mnr fname surname stkz study c_no course mnr c_no date_exam mark The functional dependency stkz study does not satisfy any of the above conditions.
26 Third Normal Form Third Normal Form An Example Example. mnr fname surname stkz stkz study c_no course mnr c_no date_exam mark
27 Third Normal Form The Synthesis Algorithm for 3NF Given: relation R, set F of FDs We want: lossless decomposition R 1,..., R n that conserves FDs, such that each R i is in 3NF Algorithm: 1 Determine canonical covering F c of F (see algorithm in Unit 6) 2 Create for each FD α β in F c a relation R α := α β (and determine corresponding set of FDs F α ) 3 If one of the R α s contains candidate key of R, we are done. Otherwise create relation R κ for a candidate key κ of R (with F κ = ). 4 Delete relations R α that are contained in other relations R α, i.e. R α R α
28 Boyce-Codd Normal Form Outline 1 Organization 2 SQL: Regular Expressions and Date Functions 3 Reminder and Overview 4 Normalization First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Fourth Normal Form
29 Boyce-Codd Normal Form Boyce-Codd Normal Form Definition (BCNF) A relation is in BCNF, if it is in 1NF and for each FD α β at least one of the following two conditions holds: 1 β α, i.e. the FD α β is trivial, 2 α is a superkey. Difference to 3NF: β is not allowed to be part of candidate key
30 Boyce-Codd Normal Form Boyce-Codd Normal Form An Example Example. mnr c_no c_term c_term_abbrv date_exam mark WS 2008/09 W08 As the relation between c_term and c_term_abbrv is 1:1, another candidate key is { mnr, c_no, c_term, date_exam }. We have FDs: {c_term} {c_term_abbrv} and {c_term_abbrv} {c_term} However, neither attribute c_term and c_term_abbrv is superkey, nor is the FD trivial. table is not in BCNF
31 Boyce-Codd Normal Form Boyce-Codd Normal Form An Example Obvious solution: new table for c_term mnr c_no c_term_abbrv date_exam mark c_term_abbrv c_term
32 Boyce-Codd Normal Form Decomposition Algorithm for BCNF Given: relation R, set F of FDs We want: decomposition R 1,..., R n in BCNF Decomposition Algorithm: Initialize Z := {R}; while (there is R i in Z not in BCNF) do{ 1 find FD α β for R i with α β = and α R i ; 2 decompose R i into R i1 := α β and R i2 := R i β; 3 replace R i in Z with R i1 and R i2, i.e. Z := (Z {R i }) {R i1, R i2 }.
33 Boyce-Codd Normal Form 3NF vs. BCNF The Synthesis Algorithm guarantees decomposition that is lossless, conserves FDs is in 3NF The Decomposition Algorithm guarantees decomposition that is lossless, is in BCNF
34 Boyce-Codd Normal Form 3NF vs. BCNF The Synthesis Algorithm guarantees decomposition that is lossless, conserves FDs is in 3NF The Decomposition Algorithm guarantees decomposition that is lossless, is in BCNF Unfortunately: In some cases a BCNF decomposition does not conserve FDs. be content with 3NF in these cases
35 Fourth Normal Form Outline 1 Organization 2 SQL: Regular Expressions and Date Functions 3 Reminder and Overview 4 Normalization First Normal Form Second Normal Form Third Normal Form Boyce-Codd Normal Form Fourth Normal Form
36 Fourth Normal Form Fourth Normal Form and Multivalued Dependencies An Example: We want to store language and sports courses for students: matrnr language sports Italian skiing Italian fencing Italian soccer Spanish skiing Spanish fencing Spanish soccer
37 Fourth Normal Form Multivalued Dependencies The dependencies {matrnr} {language} and {matrnr} {sports} are so-called multivalued dependencies (MVDs). Definition (MVD) β is multivalued dependent from α (Notation: α β), if for each tuples with identical α-values there are further tuples with swapped β-values. (MVDs are generalization of FDs.)
38 Fourth Normal Form Multivalued Dependencies Definition (MVD) β is multivalued dependent from α (Notation: α β), if for each tuples with identical α-values there are further tuples with swapped β-values. In example: If there are rows , Italian, fencing and , Spanish, soccer, there also must be rows , Spanish, fencing and , Italian, soccer.
39 Fourth Normal Form Fourth Normal Form Idea: no table contains more than one multivalued relation Definition (4NF) A relation R is in 4NF, if it is in 1NF and for each MVD α β at least one of the following two conditions holds: 1 the MVD α β is trivial, i.e. either β α or β = R α, 2 α is a superkey of R. Note: Each relation in 4NF is also in BCNF.
40 Fourth Normal Form Fourth Normal Form An Example matrnr language sports Italian skiing Italian fencing Italian soccer Spanish skiing Spanish fencing Spanish soccer MVDs: {matrnr} {language} and {matrnr} {sports} table not in 4NF
41 Fourth Normal Form Fourth Normal Form An Example Example. matrnr language Italian Spanish matrnr sports skiing fencing soccer
42 Fourth Normal Form Generalized Decomposition Algorithm for 4NF Given: relation R, set F of MVDs We want: decomposition R 1,..., R n in 4NF Generalized Decomposition Algorithm: Initialize Z := {R}; while (there is R i in Z not in 4NF) do{ 1 find MVD α β for R i with α β = and α R i ; 2 decompose R i into R i1 := α β and R i2 := R i β; 3 replace R i in Z with R i1 and R i2, i.e. Z := (Z {R i }) {R i1, R i2 }. (As each relation in 4NF is in BCNF, in some cases 4NF decomposition does not conserve FDs.)
43 Fourth Normal Form Another Example Human resources database: pers_no name salary dept boss project course FDs: {pers_no} {name, salary, dept, boss} {dept} {boss} {boss} {dept} MVDs: {pers_no} {project} {pers_no} {course}
44 Fourth Normal Form Another Example Apply decomposition algorithm: FD {pers_no} {name, salary, dept, boss} gives decomposition pers_no name salary dept boss pers_no project course
45 Fourth Normal Form Another Example Apply decomposition algorithm: FD {dept} {boss} gives decomposition pers_no name salary dept dept boss pers_no project course
46 Fourth Normal Form Another Example Apply decomposition algorithm: MVDs {pers_no} {project} and {pers_no} {course} give decomposition pers_no name salary dept dept boss pers_no project pers_no course
47 Fourth Normal Form Another Example Apply decomposition algorithm: MVDs {pers_no} {project} and {pers_no} {course} give decomposition pers_no name salary dept dept boss pers_no project pers_no course is in 4NF
48 Fourth Normal Form Another Example When there is more information about projects and courses to store: pers_no name salary dept dept boss pers_no project_no pers_no course_no project_no name... course_no name...
Relational Database Design
Relational Database Design Jan Chomicki University at Buffalo Jan Chomicki () Relational database design 1 / 16 Outline 1 Functional dependencies 2 Normal forms 3 Multivalued dependencies Jan Chomicki
Chapter 10. Normalization Ext (from E&N and my editing)
Chapter 10 Normalization Ext (from E&N and my editing) Outline BCNF Multivalued Dependencies and Fourth Normal Form 2 BCNF A relation schema R is in Boyce-Codd Normal Form (BCNF) if whenever an FD X ->
CS322: Database Systems Normalization
CS322: Database Systems Normalization Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Introduction The normalization process takes a relation schema through
Functional Dependency Theory II. Winter Lecture 21
Functional Dependency Theory II Winter 2006-2007 Lecture 21 Last Time Introduced Third Normal Form A weakened version of BCNF that preserves more functional dependencies Allows non-trivial dependencies
Databases 2012 Normalization
Databases 2012 Christian S. Jensen Computer Science, Aarhus University Overview Review of redundancy anomalies and decomposition Boyce-Codd Normal Form Motivation for Third Normal Form Third Normal Form
Constraints: Functional Dependencies
Constraints: Functional Dependencies Fall 2017 School of Computer Science University of Waterloo Databases CS348 (University of Waterloo) Functional Dependencies 1 / 42 Schema Design When we get a relational
Schema Refinement: Other Dependencies and Higher Normal Forms
Schema Refinement: Other Dependencies and Higher Normal Forms Spring 2018 School of Computer Science University of Waterloo Databases CS348 (University of Waterloo) Higher Normal Forms 1 / 14 Outline 1
Relational Design: Characteristics of Well-designed DB
Relational Design: Characteristics of Well-designed DB 1. Minimal duplication Consider table newfaculty (Result of F aculty T each Course) Id Lname Off Bldg Phone Salary Numb Dept Lvl MaxSz 20000 Cotts
FUNCTIONAL DEPENDENCY THEORY II. CS121: Relational Databases Fall 2018 Lecture 20
FUNCTIONAL DEPENDENCY THEORY II CS121: Relational Databases Fall 2018 Lecture 20 Canonical Cover 2 A canonical cover F c for F is a set of functional dependencies such that: F logically implies all dependencies
Relational Database Design Theory Part II. Announcements (October 12) Review. CPS 116 Introduction to Database Systems
Relational Database Design Theory Part II CPS 116 Introduction to Database Systems Announcements (October 12) 2 Midterm graded; sample solution available Please verify your grades on Blackboard Project
Relational Database Design
CSL 451 Introduction to Database Systems Relational Database Design Department of Computer Science and Engineering Indian Institute of Technology Ropar Narayanan (CK) Chatapuram Krishnan! Recap - Boyce-Codd
Database Design and Normalization
Database Design and Normalization Chapter 12 (Week 13) EE562 Slides and Modified Slides from Database Management Systems, R. Ramakrishnan 1 Multivalued Dependencies Employee Child Salary Year Hilbert Hubert
Constraints: Functional Dependencies
Constraints: Functional Dependencies Spring 2018 School of Computer Science University of Waterloo Databases CS348 (University of Waterloo) Functional Dependencies 1 / 32 Schema Design When we get a relational
Relational Design Theory
Relational Design Theory CSE462 Database Concepts Demian Lessa/Jan Chomicki Department of Computer Science and Engineering State University of New York, Buffalo Fall 2013 Overview How does one design a
Information Systems for Engineers. Exercise 8. ETH Zurich, Fall Semester Hand-out Due
Information Systems for Engineers Exercise 8 ETH Zurich, Fall Semester 2017 Hand-out 24.11.2017 Due 01.12.2017 1. (Exercise 3.3.1 in [1]) For each of the following relation schemas and sets of FD s, i)
CS54100: Database Systems
CS54100: Database Systems Keys and Dependencies 18 January 2012 Prof. Chris Clifton Functional Dependencies X A = assertion about a relation R that whenever two tuples agree on all the attributes of X,
Lossless Joins, Third Normal Form
Lossless Joins, Third Normal Form FCDB 3.4 3.5 Dr. Chris Mayfield Department of Computer Science James Madison University Mar 19, 2018 Decomposition wish list 1. Eliminate redundancy and anomalies 2. Recover
Information Systems (Informationssysteme)
Information Systems (Informationssysteme) Jens Teubner, TU Dortmund jens.teubner@cs.tu-dortmund.de Summer 2015 c Jens Teubner Information Systems Summer 2015 1 Part VII Schema Normalization c Jens Teubner
Schema Refinement and Normal Forms. Why schema refinement?
Schema Refinement and Normal Forms Why schema refinement? Consider relation obtained from Hourly_Emps: Hourly_Emps (sin,rating,hourly_wages,hourly_worked) Problems: Update Anomaly: Can we change the wages
CSE 344 AUGUST 6 TH LOSS AND VIEWS
CSE 344 AUGUST 6 TH LOSS AND VIEWS ADMINISTRIVIA WQ6 due tonight HW7 due Wednesday DATABASE DESIGN PROCESS Conceptual Model: name product makes company price name address Relational Model: Tables + constraints
Introduction. Normalization. Example. Redundancy. What problems are caused by redundancy? What are functional dependencies?
Normalization Introduction What problems are caused by redundancy? UVic C SC 370 Dr. Daniel M. German Department of Computer Science What are functional dependencies? What are normal forms? What are the
CSC 261/461 Database Systems Lecture 8. Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101
CSC 261/461 Database Systems Lecture 8 Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101 Agenda 1. Database Design 2. Normal forms & functional dependencies 3. Finding functional dependencies
CSC 261/461 Database Systems Lecture 10 (part 2) Spring 2018
CSC 261/461 Database Systems Lecture 10 (part 2) Spring 2018 Announcement Read Chapter 14 and 15 You must self-study these chapters Too huge to cover in Lectures Project 2 Part 1 due tonight Agenda 1.
Databases Lecture 8. Timothy G. Griffin. Computer Laboratory University of Cambridge, UK. Databases, Lent 2009
Databases Lecture 8 Timothy G. Griffin Computer Laboratory University of Cambridge, UK Databases, Lent 2009 T. Griffin (cl.cam.ac.uk) Databases Lecture 8 DB 2009 1 / 15 Lecture 08: Multivalued Dependencies
Schema Refinement and Normal Forms
Schema Refinement and Normal Forms UMass Amherst Feb 14, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke, Dan Suciu 1 Relational Schema Design Conceptual Design name Product buys Person price name
Schema Refinement and Normal Forms. The Evils of Redundancy. Schema Refinement. Yanlei Diao UMass Amherst April 10, 2007
Schema Refinement and Normal Forms Yanlei Diao UMass Amherst April 10, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke 1 The Evils of Redundancy Redundancy is at the root of several problems associated
Chapter 8: Relational Database Design
Chapter 8: Relational Database Design Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Chapter 8: Relational Database Design Features of Good Relational Design Atomic Domains
INF1383 -Bancos de Dados
INF1383 -Bancos de Dados Prof. Sérgio Lifschitz DI PUC-Rio Eng. Computação, Sistemas de Informação e Ciência da Computação Projeto de BD e Formas Normais Alguns slides são baseados ou modificados dos originais
SCHEMA NORMALIZATION. CS 564- Fall 2015
SCHEMA NORMALIZATION CS 564- Fall 2015 HOW TO BUILD A DB APPLICATION Pick an application Figure out what to model (ER model) Output: ER diagram Transform the ER diagram to a relational schema Refine the
CSC 261/461 Database Systems Lecture 11
CSC 261/461 Database Systems Lecture 11 Fall 2017 Announcement Read the textbook! Chapter 8: Will cover later; But self-study the chapter Everything except Section 8.4 Chapter 14: Section 14.1 14.5 Chapter
Normalization. October 5, Chapter 19. CS445 Pacific University 1 10/05/17
Normalization October 5, 2017 Chapter 19 Pacific University 1 Description A Real Estate agent wants to track offers made on properties. Each customer has a first and last name. Each property has a size,
DESIGN THEORY FOR RELATIONAL DATABASES. csc343, Introduction to Databases Renée J. Miller and Fatemeh Nargesian and Sina Meraji Winter 2018
DESIGN THEORY FOR RELATIONAL DATABASES csc343, Introduction to Databases Renée J. Miller and Fatemeh Nargesian and Sina Meraji Winter 2018 1 Introduction There are always many different schemas for a given
Lectures 6. Lecture 6: Design Theory
Lectures 6 Lecture 6: Design Theory Lecture 6 Announcements Solutions to PS1 are posted online. Grades coming soon! Project part 1 is out. Check your groups and let us know if you have any issues. We have
Relational Design Theory II. Detecting Anomalies. Normal Forms. Normalization
Relational Design Theory II Normalization Detecting Anomalies SID Activity Fee Tax 1001 Piano $20 $2.00 1090 Swimming $15 $1.50 1001 Swimming $15 $1.50 Why is this bad design? Can we capture this using
Chapter 7: Relational Database Design
Chapter 7: Relational Database Design Chapter 7: Relational Database Design! First Normal Form! Pitfalls in Relational Database Design! Functional Dependencies! Decomposition! Boyce-Codd Normal Form! Third
Schema Refinement & Normalization Theory
Schema Refinement & Normalization Theory Functional Dependencies Week 13 1 What s the Problem Consider relation obtained (call it SNLRHW) Hourly_Emps(ssn, name, lot, rating, hrly_wage, hrs_worked) What
Normal Forms 1. ICS 321 Fall Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa
ICS 321 Fall 2013 Normal Forms 1 Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 9/16/2013 Lipyeow Lim -- University of Hawaii at Manoa 1 The Problem with
CS122A: Introduction to Data Management. Lecture #13: Relational DB Design Theory (II) Instructor: Chen Li
CS122A: Introduction to Data Management Lecture #13: Relational DB Design Theory (II) Instructor: Chen Li 1 Third Normal Form (3NF) v Relation R is in 3NF if it is in 2NF and it has no transitive dependencies
UVA UVA UVA UVA. Database Design. Relational Database Design. Functional Dependency. Loss of Information
Relational Database Design Database Design To generate a set of relation schemas that allows - to store information without unnecessary redundancy - to retrieve desired information easily Approach - design
Functional Dependencies
Functional Dependencies Functional Dependencies Framework for systematic design and optimization of relational schemas Generalization over the notion of Keys Crucial in obtaining correct normalized schemas
Schema Refinement and Normal Forms. Chapter 19
Schema Refinement and Normal Forms Chapter 19 1 Review: Database Design Requirements Analysis user needs; what must the database do? Conceptual Design high level descr. (often done w/er model) Logical
Normal Forms. Dr Paolo Guagliardo. University of Edinburgh. Fall 2016
Normal Forms Dr Paolo Guagliardo University of Edinburgh Fall 2016 Example of bad design BAD Title Director Theatre Address Time Price Inferno Ron Howard Vue Omni Centre 20:00 11.50 Inferno Ron Howard
L14: Normalization. CS3200 Database design (sp18 s2) 3/1/2018
L14: Normalization CS3200 Database design (sp18 s2) https://course.ccs.neu.edu/cs3200sp18s2/ 3/1/2018 367 Announcements! Keep bringing your name plates J Outline today - More Normalization - Project 1
Introduction to Data Management. Lecture #7 (Relational DB Design Theory II)
Introduction to Data Management Lecture #7 (Relational DB Design Theory II) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Announcements v Homework
Chapter 7: Relational Database Design. Chapter 7: Relational Database Design
Chapter 7: Relational Database Design Chapter 7: Relational Database Design First Normal Form Pitfalls in Relational Database Design Functional Dependencies Decomposition Boyce-Codd Normal Form Third Normal
Normal Forms Lossless Join.
Normal Forms Lossless Join http://users.encs.concordia.ca/~m_oran/ 1 Types of Normal Forms A relation schema R is in the first normal form (1NF) if the domain of its each attribute has only atomic values
Lecture #7 (Relational Design Theory, cont d.)
Introduction to Data Management Lecture #7 (Relational Design Theory, cont d.) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Announcements
Chapter 3 Design Theory for Relational Databases
1 Chapter 3 Design Theory for Relational Databases Contents Functional Dependencies Decompositions Normal Forms (BCNF, 3NF) Multivalued Dependencies (and 4NF) Reasoning About FD s + MVD s 2 Remember our
Schema Refinement. Feb 4, 2010
Schema Refinement Feb 4, 2010 1 Relational Schema Design Conceptual Design name Product buys Person price name ssn ER Model Logical design Relational Schema plus Integrity Constraints Schema Refinement
Design Theory for Relational Databases. Spring 2011 Instructor: Hassan Khosravi
Design Theory for Relational Databases Spring 2011 Instructor: Hassan Khosravi Chapter 3: Design Theory for Relational Database 3.1 Functional Dependencies 3.2 Rules About Functional Dependencies 3.3 Design
Functional Dependencies. Applied Databases. Not all designs are equally good! An example of the bad design
Applied Databases Handout 2a. Functional Dependencies and Normal Forms 20 Oct 2008 Functional Dependencies This is the most mathematical part of the course. Functional dependencies provide an alternative
Functional Dependencies and Normalization. Instructor: Mohamed Eltabakh
Functional Dependencies and Normalization Instructor: Mohamed Eltabakh meltabakh@cs.wpi.edu 1 Goal Given a database schema, how do you judge whether or not the design is good? How do you ensure it does
Design Theory. Design Theory I. 1. Normal forms & functional dependencies. Today s Lecture. 1. Normal forms & functional dependencies
Design Theory BBM471 Database Management Systems Dr. Fuat Akal akal@hacettepe.edu.tr Design Theory I 2 Today s Lecture 1. Normal forms & functional dependencies 2. Finding functional dependencies 3. Closures,
Schema Refinement and Normal Forms. Case Study: The Internet Shop. Redundant Storage! Yanlei Diao UMass Amherst November 1 & 6, 2007
Schema Refinement and Normal Forms Yanlei Diao UMass Amherst November 1 & 6, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke 1 Case Study: The Internet Shop DBDudes Inc.: a well-known database consulting
Database Design and Normalization
Database Design and Normalization Chapter 11 (Week 12) EE562 Slides and Modified Slides from Database Management Systems, R. Ramakrishnan 1 1NF FIRST S# Status City P# Qty S1 20 London P1 300 S1 20 London
Schema Refinement and Normal Forms
Schema Refinement and Normal Forms Yanlei Diao UMass Amherst April 10 & 15, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke 1 Case Study: The Internet Shop DBDudes Inc.: a well-known database consulting
Lecture 6 Relational Database Design
Lecture 6 Relational Database Design Shuigeng Zhou October 21/27, 2009 School of Computer Science Fudan University Relational Database Design First Normal Form Pitfalls in Relational Database Design Functional
DECOMPOSITION & SCHEMA NORMALIZATION
DECOMPOSITION & SCHEMA NORMALIZATION CS 564- Spring 2018 ACKs: Dan Suciu, Jignesh Patel, AnHai Doan WHAT IS THIS LECTURE ABOUT? Bad schemas lead to redundancy To correct bad schemas: decompose relations
Schema Refinement and Normal Forms
Schema Refinement and Normal Forms Chapter 19 Database Management Systems, 3ed, R. Ramakrishnan and J. Gehrke 1 The Evils of Redundancy Redundancy is at the root of several problems associated with relational
The Evils of Redundancy. Schema Refinement and Normalization. Functional Dependencies (FDs) Example: Constraints on Entity Set. Refining an ER Diagram
The Evils of Redundancy Schema Refinement and Normalization Chapter 1 Nobody realizes that some people expend tremendous energy merely to be normal. Albert Camus Redundancy is at the root of several problems
Database Design and Implementation
Database Design and Implementation CS 645 Schema Refinement First Normal Form (1NF) A schema is in 1NF if all tables are flat Student Name GPA Course Student Name GPA Alice 3.8 Bob 3.7 Carol 3.9 Alice
Database Design: Normal Forms as Quality Criteria. Functional Dependencies Normal Forms Design and Normal forms
Database Design: Normal Forms as Quality Criteria Functional Dependencies Normal Forms Design and Normal forms Design Quality: Introduction Good conceptual model: - Many alternatives - Informal guidelines
Chapter 11, Relational Database Design Algorithms and Further Dependencies
Chapter 11, Relational Database Design Algorithms and Further Dependencies Normal forms are insufficient on their own as a criteria for a good relational database schema design. The relations in a database
CS 186, Fall 2002, Lecture 6 R&G Chapter 15
Schema Refinement and Normalization CS 186, Fall 2002, Lecture 6 R&G Chapter 15 Nobody realizes that some people expend tremendous energy merely to be normal. Albert Camus Functional Dependencies (Review)
CAS CS 460/660 Introduction to Database Systems. Functional Dependencies and Normal Forms 1.1
CAS CS 460/660 Introduction to Database Systems Functional Dependencies and Normal Forms 1.1 Review: Database Design Requirements Analysis user needs; what must database do? Conceptual Design high level
Functional Dependencies and Normalization
Functional Dependencies and Normalization There are many forms of constraints on relational database schemata other than key dependencies. Undoubtedly most important is the functional dependency. A functional
The Evils of Redundancy. Schema Refinement and Normal Forms. Example: Constraints on Entity Set. Functional Dependencies (FDs) Example (Contd.
The Evils of Redundancy Schema Refinement and Normal Forms Chapter 19 Database Management Systems, 3ed, R. Ramakrishnan and J. Gehrke 1 Redundancy is at the root of several problems associated with relational
The Evils of Redundancy. Schema Refinement and Normal Forms. Example: Constraints on Entity Set. Functional Dependencies (FDs) Refining an ER Diagram
Schema Refinement and Normal Forms Chapter 19 Database Management Systems, R. Ramakrishnan and J. Gehrke 1 The Evils of Redundancy Redundancy is at the root of several problems associated with relational
10/12/10. Outline. Schema Refinements = Normal Forms. First Normal Form (1NF) Data Anomalies. Relational Schema Design
Outline Introduction to Database Systems CSE 444 Design theory: 3.1-3.4 [Old edition: 3.4-3.6] Lectures 6-7: Database Design 1 2 Schema Refinements = Normal Forms 1st Normal Form = all tables are flat
CSC 261/461 Database Systems Lecture 12. Spring 2018
CSC 261/461 Database Systems Lecture 12 Spring 2018 Announcement Project 1 Milestone 2 due tonight! Read the textbook! Chapter 8: Will cover later; But self-study the chapter Chapter 14: Section 14.1 14.5
Design Theory for Relational Databases
Design Theory for Relational Databases Keys: formal definition K is a superkey for relation R if K functionally determines all attributes of R K is a key for R if K is a superkey, but no proper subset
Introduction to Data Management CSE 344
Introduction to Data Management CSE 344 Lectures 18: BCNF 1 What makes good schemas? 2 Review: Relation Decomposition Break the relation into two: Name SSN PhoneNumber City Fred 123-45-6789 206-555-1234
CSE 544 Principles of Database Management Systems
CSE 544 Principles of Database Management Systems Lecture 3 Schema Normalization CSE 544 - Winter 2018 1 Announcements Project groups due on Friday First review due on Tuesday (makeup lecture) Run git
Functional Dependency and Algorithmic Decomposition
Functional Dependency and Algorithmic Decomposition In this section we introduce some new mathematical concepts relating to functional dependency and, along the way, show their practical use in relational
CSE 132B Database Systems Applications
CSE 132B Database Systems Applications Alin Deutsch Database Design and Normal Forms Some slides are based or modified from originals by Sergio Lifschitz @ PUC Rio, Brazil and Victor Vianu @ CSE UCSD and
Schema Refinement & Normalization Theory: Functional Dependencies INFS-614 INFS614, GMU 1
Schema Refinement & Normalization Theory: Functional Dependencies INFS-614 INFS614, GMU 1 Background We started with schema design ER model translation into a relational schema Then we studied relational
Shuigeng Zhou. April 6/13, 2016 School of Computer Science Fudan University
Lecture 6 Relational Database Design Shuigeng Zhou April 6/13, 2016 School of Computer Science Fudan University Relational Database Design p First Normal Form p Pitfalls in Relational Database Design p
BCNF revisited: 40 Years Normal Forms
Full set of slides BCNF revisited: 40 Years Normal Forms Faculty of Computer Science Technion - IIT, Haifa janos@cs.technion.ac.il www.cs.technion.ac.il/ janos 1 Full set of slides Acknowledgements Based
Schema Refinement and Normal Forms Chapter 19
Schema Refinement and Normal Forms Chapter 19 Instructor: Vladimir Zadorozhny vladimir@sis.pitt.edu Information Science Program School of Information Sciences, University of Pittsburgh Database Management
Design Theory for Relational Databases
Design Theory for Relational Databases FUNCTIONAL DEPENDENCIES DECOMPOSITIONS NORMAL FORMS 1 Functional Dependencies X ->Y is an assertion about a relation R that whenever two tuples of R agree on all
Introduction to Database Systems CSE 414. Lecture 20: Design Theory
Introduction to Database Systems CSE 414 Lecture 20: Design Theory CSE 414 - Spring 2018 1 Class Overview Unit 1: Intro Unit 2: Relational Data Models and Query Languages Unit 3: Non-relational data Unit
Functional Dependencies & Normalization. Dr. Bassam Hammo
Functional Dependencies & Normalization Dr. Bassam Hammo Redundancy and Normalisation Redundant Data Can be determined from other data in the database Leads to various problems INSERT anomalies UPDATE
FUNCTIONAL DEPENDENCY THEORY. CS121: Relational Databases Fall 2017 Lecture 19
FUNCTIONAL DEPENDENCY THEORY CS121: Relational Databases Fall 2017 Lecture 19 Last Lecture 2 Normal forms specify good schema patterns First normal form (1NF): All attributes must be atomic Easy in relational
But RECAP. Why is losslessness important? An Instance of Relation NEWS. Suppose we decompose NEWS into: R1(S#, Sname) R2(City, Status)
So far we have seen: RECAP How to use functional dependencies to guide the design of relations How to modify/decompose relations to achieve 1NF, 2NF and 3NF relations But How do we make sure the decompositions
Schema Refinement and Normal Forms. The Evils of Redundancy. Functional Dependencies (FDs) [R&G] Chapter 19
Schema Refinement and Normal Forms [R&G] Chapter 19 CS432 1 The Evils of Redundancy Redundancy is at the root of several problems associated with relational schemas: redundant storage, insert/delete/update
The Evils of Redundancy. Schema Refinement and Normal Forms. Functional Dependencies (FDs) Example: Constraints on Entity Set. Example (Contd.
The Evils of Redundancy Schema Refinement and Normal Forms INFO 330, Fall 2006 1 Redundancy is at the root of several problems associated with relational schemas: redundant storage, insert/delete/update
COSC 430 Advanced Database Topics. Lecture 2: Relational Theory Haibo Zhang Computer Science, University of Otago
COSC 430 Advanced Database Topics Lecture 2: Relational Theory Haibo Zhang Computer Science, University of Otago Learning objectives and references You should be able to: define the elements of the relational
Schema Refinement and Normal Forms. The Evils of Redundancy. Functional Dependencies (FDs) CIS 330, Spring 2004 Lecture 11 March 2, 2004
Schema Refinement and Normal Forms CIS 330, Spring 2004 Lecture 11 March 2, 2004 1 The Evils of Redundancy Redundancy is at the root of several problems associated with relational schemas: redundant storage,
Database Normaliza/on. Debapriyo Majumdar DBMS Fall 2016 Indian Statistical Institute Kolkata
Database Normaliza/on Debapriyo Majumdar DBMS Fall 2016 Indian Statistical Institute Kolkata Problems with redundancy Data (attributes) being present in multiple tables Potential problems Increase of storage
Review: Keys. What is a Functional Dependency? Why use Functional Dependencies? Functional Dependency Properties
Review: Keys Superkey: set of attributes whose values are unique for each tuple Note: a superkey isn t necessarily minimal. For example, for any relation, the entire set of attributes is always a superkey.
Kapitel 3: Formal Design
Theory I: Database Foundations 3. Formal Design 3. Kapitel 3: Formal Design We want to distinguish good from bad database design. What kind of additional information do we need? Can we transform a bad
Plan of the lecture. G53RDB: Theory of Relational Databases Lecture 9. Informal exercise from last lecture. Example (from Stanczyk et al.
Plan of the lecture G53RDB: Theory of Relational Databases Lecture 9 Answers to informal coursework Multivalued dependencies 4NF Join dependencies 5NF Natasha Alechina School of Computer Science & IT nza@cs.nott.ac.uk
Exam 1 Solutions Spring 2016
Exam 1 Solutions Spring 2016 Problem 1 1. R 1 := σ color= red OR color= green (P arts) Result := Π sid (R 1 Catalog) 2. R 1 := σ sname= Y osemitesham (Suppliers) R 2 := Π pid,cost (R 1 Catalog) R 3 (pid1,
Schema Refinement and Normal Forms
Schema Refinement and Normal Forms Chapter 19 Quiz #2 Next Thursday Comp 521 Files and Databases Fall 2012 1 The Evils of Redundancy v Redundancy is at the root of several problems associated with relational
Introduction to Data Management CSE 344
Introduction to Data Management CSE 344 Lecture 18: Design Theory Wrap-up 1 Announcements WQ6 is due on Tuesday Homework 6 is due on Thursday Be careful about your remaining late days. Today: Midterm review
Design theory for relational databases
Design theory for relational databases 1. Consider a relation with schema R(A,B,C,D) and FD s AB C, C D and D A. a. What are all the nontrivial FD s that follow from the given FD s? You should restrict
CMPT 354: Database System I. Lecture 9. Design Theory
CMPT 354: Database System I Lecture 9. Design Theory 1 Design Theory Design theory is about how to represent your data to avoid anomalies. Design 1 Design 2 Student Course Room Mike 354 AQ3149 Mary 354
Schema Refinement. Yanlei Diao UMass Amherst. Slides Courtesy of R. Ramakrishnan and J. Gehrke
Schema Refinement Yanlei Diao UMass Amherst Slides Courtesy of R. Ramakrishnan and J. Gehrke 1 Revisit a Previous Example ssn name Lot Employees rating hourly_wages hours_worked ISA contractid Hourly_Emps
11/1/12. Relational Schema Design. Relational Schema Design. Relational Schema Design. Relational Schema Design (or Logical Design)
Relational Schema Design Introduction to Management CSE 344 Lectures 16: Database Design Conceptual Model: Relational Model: plus FD s name Product buys Person price name ssn Normalization: Eliminates
CSC 261/461 Database Systems Lecture 13. Spring 2018
CSC 261/461 Database Systems Lecture 13 Spring 2018 BCNF Decomposition Algorithm BCNFDecomp(R): Find X s.t.: X + X and X + [all attributes] if (not found) then Return R let Y = X + - X, Z = (X + ) C decompose