Normalisation “A formal technique for analysing relations based on their primary key and...
-
date post
20-Dec-2015 -
Category
Documents
-
view
217 -
download
3
Transcript of Normalisation “A formal technique for analysing relations based on their primary key and...
Normalisation
• “A formal technique for analysing relations based on their primary key and functional dependencies.” [Codd].
• Process– Analyse each relation using a set of rules– If a relation does meet a rule, decompose the
relation into two or more relations
Overview• Normalisation – Steps
• 1NF– Remove repeating groups
• 2NF– Remove partial dependencies
• 3NF– Remove transitive dependencies
Understanding the data
Normalisation
gives us a set of rules for determining whether we have grouped our data items correctly
BUT
it cannot, in itself, ensure that we have captured all the data the system may require, or that we have fully understood it.
Normal form
• Normal form means a convenient structure into which the data can be organized - in this case Codd’s Laws.
• Here we study only first, second and third normal forms.
Determinacy and Dependency
• If A determines B then B is dependent on A.
• A determines B if each value of A is always associated with only one value of B.
Un-normalised data
Staff-Development-Course: course-code (key)course-description(employee #nameblockroom #date-joined-courseallocated-hours)
First normal form (1NF)
• An entity is in 1NF if, and only if, it has an identifying key and there are no repeating attributes or groups of attributes.
• To remove repeating groups:– Leave non-repeating attributes alone ( as a 1NF entity
or table)– Remove repeating attributes to separate 1NF entity
whose key will be original key + key to repeating group
1NF
Course Emp-on-Course(table or entity) (table or entity)
course-code (key) course-code (key part 1)course-description employee # (key part 2)
nameblockroom #date-joined-courseallocated-hours
Second normal form (2NF)
An entity is in 2NF if, and only if, it is in
1NF and has no attributes which require only
part of the key to identify them uniquely.
To get into 2NF
• We remove part-key dependencies
• Where a key has attributes following, check that each attribute depends upon the whole key to determine it, not just part of the key.
• Where any part of a key identifies an attribute or set of attributes, create a new separate entity.
Dependencies
Attribute Depends on
name employee #block employee #room # employee #
But
date-joined-course course-code + employee #allocated-hours course-code + employee #
Keys
A Simple key is the unique identifier.
A Compound key is made up of two or more simple keys. This creates the link between the two entities.
A Foreign key is a non-key attribute in one entity which is a key attribute in another.
2NF entities
Course Emp-on-Course Employee
course-code course-code employee #
course-description employee # namedate-joined-course block
allocated-hours room #
Third normal form (3NF)
Definition. An entity is in 3NF if, and only if, it
is in 2NF and no non-key attribute depends on
any other non-key attribute.
To get into 3NF
• We must remove attributes that depend on other non-key attributes
• Decide on the direction of the dependency between the attributes
• If A depends on B, create a new entity, keyed by B, with A as an attribute (A may be a set of attributes).
• Leave B in the original entity and mark it as a foreign key, but remove A from the original entity
3NF entities
Employee (2NF) becomes Employee (3NF)employee # employee #name nameblock room #*room #
and
Locationroom #
block
The total list of 3NF entities is:
• Course (course-code, course-description)
• Emp-on-Course (course-code, employee #, date-joined-course, allocated-hours)
• Employee (employee #, name, room #*)
• Location (room #, block)