Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 94 views

    Lecture On Database Normalisation

    Uploaded by

    bachib
    This document discusses normalizing a database relation to Boyce-Codd normal form (BCNF). It begins with a review of normalization to third normal form (3NF) and introduces the concept of lossless decomposition. It then defines BCNF as a relation where every determinant in a non-trivial functional dependency is a super key. An example relation called "Stream" is given that is in 3NF but not BCNF due to a non-trivial FD where the determinant is not a super key. To normalize this relation to BCNF, it is decomposed into two relations, losing the original FD in the process. Higher normal forms beyond BCNF are mentioned. The document concludes with a brief discussion of

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    Lecture On Database Normalisation

    Uploaded by

    bachib
    94 views31 pages
    This document discusses normalizing a database relation to Boyce-Codd normal form (BCNF). It begins with a review of normalization to third normal form (3NF) and introduces the concept of lossless decomposition. It then defines BCNF as a relation where every determinant in a non-trivial functional dependency is a super key. An example relation called "Stream" is given that is in 3NF but not BCNF due to a non-trivial FD where the determinant is not a super key. To normalize this relation to BCNF, it is decomposed into two relations, losing the original FD in the process. Higher normal forms beyond BCNF are mentioned. The document concludes with a brief discussion of

    Original Description:

    Lecture on database Normalisation

    Original Title

    Lecture on database Normalisation

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses normalizing a database relation to Boyce-Codd normal form (BCNF). It begins with a review of normalization to third normal form (3NF) and introduces the concept of lossless decomposition. It then defines BCNF as a relation where every determinant in a non-trivial functional dependency is a super key. An example relation called "Stream" is given that is in 3NF but not BCNF due to a non-trivial FD where the determinant is not a super key. To normalize this relation to BCNF, it is decomposed into two relations, losing the original FD in the process. Higher normal forms beyond BCNF are mentioned. The document concludes with a brief discussion of

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    94 views31 pages

    Lecture On Database Normalisation

    Uploaded by

    bachib
    This document discusses normalizing a database relation to Boyce-Codd normal form (BCNF). It begins with a review of normalization to third normal form (3NF) and introduces the concept of lossless decomposition. It then defines BCNF as a relation where every determinant in a non-trivial functional dependency is a super key. An example relation called "Stream" is given that is in 3NF but not BCNF due to a non-trivial FD where the determinant is not a super key. To normalize this relation to BCNF, it is decomposed into two relations, losing the original FD in the process. Higher normal forms beyond BCNF are mentioned. The document concludes with a brief discussion of

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 31

    Normalisation to BCNF

    Database Systems Lecture 12 Natasha Alechina

    In This Lecture
    More normalisation
    Brief review of relational algebra Lossless decomposition Boyce-Codd normal form (BCNF) Higher normal forms Denormalisation

    For more information


    Connolly and Begg chapter 14 Ullman and Widom chapter 3.6

    Normalisation so Far
    First normal form
    All data values are atomic

    Third normal form


    In 2NF plus no non-key attribute depends transitively on a candidate key

    Second normal form


    In 1NF plus no non-key attribute is partially dependent on a candidate key

    Lossless decomposition
    To normalise a relation, we used projections If R(A,B,C) satisfies AB then we can project it on A,B and A,C without losing information Lossless decomposition: R = AB(R) AC(R) where AB(R) is projection of R on AB and is natural join. Reminder of projection:

    R
    A B C

    AB(R) A B

    Relational algebra reminder: selection


    R A 1 2 3 4 5 B x y z u w C c d a b c D c e a c d C=D(R) A B 1 x 3 z C D c c a a

    Relational algebra reminder: product


    R1 A B 1 2 x y R2 A C 1 2 3 w v u R1R2 A B A C 1 1 1 2 2 2 x x x y y y 1 2 3 1 2 3 w v u w v u

    While I am on the subject


    SELECT A,B FROM R1, R2, R3 WHERE (some property holds)
    translates into relational algebra

    A,B

    (R1R2R3)

    Relational algebra: natural join


    R1R2 = R1.A,B,C R1.A = R2.A (R1R2)
    R1 A B 1 2 x y R2 A C 1 2 3 w v u R1 R2 A B C 1 2 x w y v

    When is decomposition lossless: Module Lecturer


    R
    Module Lecturer
    DBS DBS RDB APS nza nza nza rcb

    Module,LecturerR
    Text
    CB UW UW B

    Module,TextR
    Module Text
    DBS DBS RDB APS CB UW UW B

    Module Lecturer
    DBS RDB APS nza nza rcb

    When is decomposition is not lossless: no fd


    S
    First
    John John Mary Tom

    First,LastS
    Last
    Smith Brown Smith Brown

    First,AgeS
    First
    John John Mary Tom

    Age
    20 30 20 10

    First
    John John Mary Tom

    Last
    Smith Brown Smith Brown

    Age
    20 30 20 10

    When is decomposition is not lossless: no fd


    First,Last S First,Last S
    First
    John John John John Mary Tom

    First,LastS
    First
    John John Mary Tom

    First,AgeS
    First
    John John Mary Tom

    Last
    Smith Smith Brown Brown Smith Brown

    Age
    20 30 20 30 20 10

    Last
    Smith Brown Smith Brown

    Age
    20 30 20 10

    Normalisation Example
    We have a table representing orders in an online store Each entry in the table represents an item on a particular order Columns
    Order Product Customer Address Quantity UnitPrice

    Primary key is {Order, Product}

    Functional Dependencies
    Each order is for a single customer Each customer has a single address Each product has a single price From FDs 1 and 2 and transitivity {Order} {Customer}
    {Customer}{Address} {Product} {UnitPrice} {Order} {Address}

    Normalisation to 2NF
    Second normal form means no partial dependencies on candidate keys
    {Order} {Customer, Address} {Product} {UnitPrice}

    To remove the first FD we project over


    {Order, Customer, Address} (R1)

    and
    {Order, Product, Quantity, UnitPrice} (R2)

    Normalisation to 2NF
    R1 is now in 2NF, but there is still a partial FD in R2
    {Product} {UnitPrice}

    To remove this we project over {Product, UnitPrice} (R3) and {Order, Product, Quantity} (R4)

    Normalisation to 3NF
    R has now been split into 3 relations - R1, R3, and R4
    R3 and R4 are in 3NF R1 has a transitive FD on its key

    To remove
    {Order} {Customer} {Address}

    we project R1 over
    {Order, Customer} {Customer, Address}

    Normalisation
    1NF:
    {Order, Product, Customer, Address, Quantity, UnitPrice}

    2NF:
    {Order, Customer, Address}, {Product, UnitPrice}, and {Order, Product, Quantity}

    3NF:
    {Product, UnitPrice}, {Order, Product, Quantity}, {Order, Customer}, and {Customer, Address}

    The Stream Relation


    Consider a relation, Stream, which stores information about times for various streams of courses For example: labs for first years Each course has several streams Only one stream (of any course at all) takes place at any given time Each student taking a course is assigned to a single stream for it

    The Stream Relation


    Student John Mary Richard Richard Mary Rebecca Course Databases Databases Databases Programming Programming Programming Time 12:00 12:00 15:00 10:00 10:00 13:00

    Candidate keys: {Student, Course} and {Student, Time}

    FDs in the Stream Relation


    Stream has the following non-trivial FDs {Student, Course}
    {Time}
    {Time} {Course}

    Since all attributes are key attributes, Stream is in 3NF

    Anomalies in Stream
    INSERT anomalies
    You cant add an empty stream Student John Mary Richard Richard Mary Rebecca Course Databases Databases Databases Programming Programming Programming Time 12:00 12:00 15:00 10:00 10:00 13:00

    UPDATE anomalies
    Moving the 12:00 class to 9:00 means changing two rows

    DELETE anomalies
    Deleting Rebecca removes a stream

    Boyce-Codd Normal Form


    A relation is in BoyceCodd normal form (BCNF) if for every FD A B either
    B is contained in A (the FD is trivial), or A contains a candidate key of the relation,

    The same as 3NF except in 3NF we only worry about non-key Bs If there is only one candidate key then 3NF and BCNF are the same

    In other words: every determinant in a nontrivial dependency is a (super) key.

    Stream and BCNF


    Stream is not in BCNF as the FD {Time} {Course} is non-trivial and {Time} does not contain a candidate key
    Student John Mary Richard Richard Mary Rebecca Course Databases Databases Databases Programming Programming Programming Time 12:00 12:00 15:00 10:00 10:00 13:00

    Conversion to BCNF
    Student Course Time

    Student Course

    Course Time

    Stream has been put into BCNF but we have lost the FD {Student, Course} {Time}

    Decomposition Properties
    Lossless: Data should not be lost or created when splitting relations up Dependency preservation: It is desirable that FDs are preserved when splitting relations up Normalisation to 3NF is always lossless and dependency preserving Normalisation to BCNF is lossless, but may not preserve all dependencies

    Higher Normal Forms


    BCNF is as far as we can go with FDs
    Higher normal forms are based on other sorts of dependency Fourth normal form removes multi-valued dependencies Fifth normal form removes join dependencies
    1NF Relations 2NF Relations 3NF Relations BCNF Relations 4NF Relations 5NF Relations

    Denormalisation
    Normalisation
    Removes data redundancy Solves INSERT, UPDATE, and DELETE anomalies This makes it easier to maintain the information in the database in a consistent state

    However
    It leads to more tables in the database Often these need to be joined back together, which is expensive to do So sometimes (not often) it is worth denormalising

    Denormalisation
    You might want to denormalise if
    Database speeds are unacceptable (not just a bit slow) There are going to be very few INSERTs, UPDATEs, or DELETEs There are going to be lots of SELECTs that involve the joining of tables Address Number Street City Postcode

    Not normalised since {Postcode} {City} Address1 Number Street Postcode

    Address2 Postcode

    City

    Normalisation in Exams
    Given a relation with scheme {ID, Name, Address, Postcode, CardType, CardNumber}, the candidate key {ID}, and the following functional dependencies: {ID} {Name, Address, Postcode, CardType, CardNumber} {Address} {Postcode} {CardNumber} {CardType} (i) Explain why this relation is in second normal form, but not in third normal form. (3 marks)

    Normalisation in Exams
    (ii) Show how this relation can be converted to third normal form. You should show what functional dependencies are being removed, explain why they need to be removed, and give the relation(s) that result. (4 marks) (iii) Give an example of a relation that is in third normal form, but that is not in Boyce-Codd normal form, and explain why it is in third, but not Boyce-Codd, normal form.

    (4 marks)

    Next Lecture
    Physical DB Issues
    RAID arrays for recovery and speed Indexes and query efficiency

    Query optimisation
    Query trees

    For more information


    Connolly and Begg chapter 21 and appendix C.5, Ullman and Widom 5.2.8

    You might also like