Logical Database Design

and the Relational Model

Modern Database
Management
9th Edition
Jeffrey A. Hoffer, Mary B. Prescott,
Heikki Topi

1
 Objectives
 Definition of terms
 List five properties of relations
 State two properties of candidate keys
 Define first, second, and third normal form
 Describe problems from merging relations
 Transform E-R and EER diagrams to
relations
 Create tables with entity and relational
integrity constraints
 Use normalization to convert anomalous
tables to well-structured relations
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 2
 Relation
 Definition: A relation is a named, two-dimensional
table of data
 Table consists of rows (records) and columns
(attribute or field)
 Requirements for a table to qualify as a
relation:
 It must have a unique name
 Every attribute value must be atomic (not multivalued, not
composite)
 Every row must be unique (can’t have two rows with
exactly the same values for all their fields)
 Attributes (columns) in tables must have unique names
 The order of the columns must be irrelevant
 The order of the rows must be irrelevant

NOTE: all relations are in 1st Normal form

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 3
 Correspondence with E-R
Model
 Relations (tables) correspond with entity
types and with many-to-many relationship
types
 Rows correspond with entity instances and
with many-to-many relationship instances
 Columns correspond with attributes

 NOTE: The word relation (in relational

database) is NOT the same as the word
relationship (in E-R model)
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 4
 Key Fields
 Keys are special fields that serve two main
purposes:
 Primary keys are unique identifiers of the relation in
question. Examples include employee numbers, social
security numbers, etc. This is how we can guarantee
that all rows are unique
 Foreign keys are identifiers that enable a dependent
relation (on the many side of a relationship) to refer to
its parent relation (on the one side of the relationship)
 Keys can be simple (a single field) or composite
(more than one field)
 Keys usually are used as indexes to speed up the
response to user queries (More on this in Chapter
6)
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 5
Figure 5-3 Schema for four relations (Pine Valley Furniture Company

Primary Key
Foreign Key
(implements 1:N relationship
between customer and order)

Combined, these are a composite

primary key (uniquely identifies the
order line)…individually they are
foreign keys (implement M:N
relationship between order and product)

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 6

 Integrity Constraints
 Domain Constraints
 Allowable values for an attribute.
 Entity Integrity
 No primary key attribute may be null.
All primary key fields MUST have data
 Action Assertions
 Business rules.

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 7

 Domain definitions enforce domain integrity constraints

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 8

 Integrity Constraints
 Referential Integrity–rule states that any foreign key
value (on the relation of the many side) MUST match a
primary key value in the relation of the one side. (Or
the foreign key can be null)
 For example: Delete Rules
 Restrict–don’t allow delete of “parent” side if related rows
exist in “dependent” side
 Cascade–automatically delete “dependent” side rows that
correspond with the “parent” side row to be deleted
 Set-to-Null–set the foreign key in the dependent side to null
if deleting from the parent side  not allowed for weak
entities
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 9
 Figure 5-5
Referential integrity constraints (Pine Valley Furniture)

Referential
integrity
constraints are
drawn via arrows
from dependent to
parent table

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 10

 Figure 5-6 SQL table definitions

Referential
integrity
constraints are
implemented with
foreign key to
primary key
references

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 11

Transforming EER Diagrams
into Relations
Mapping Regular Entities to Relations
1. Simple attributes: E-R attributes map
directly onto the relation
2. Composite attributes: Use only their
simple, component attributes
3. Multivalued Attribute: Becomes a
separate relation with a foreign key
taken from the superior entity

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 12

 Figure 5-8 Mapping a regular entity

(a) CUSTOMER
entity type with
simple
attributes

(b) CUSTOMER relation

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 13

 Figure 5-9 Mapping a composite attribute

(a) CUSTOMER
entity type with
composite
attribute

(b) CUSTOMER relation with address detail

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 14

 Figure 5-10 Mapping an entity with a multivalued attribute

(a)

Multivalued attribute becomes a separate relation with foreign key

(b)

One–to–many relationship between original entity and new relation

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 15
Transforming EER Diagrams
into Relations (cont.)
Mapping Weak Entities
Becomes a separate relation with a
foreign key taken from the superior
entity
Primary key composed of:
Partial identifier of weak entity
Primary key of identifying relation
(strong entity)
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 16
 Figure 5-11 Example of mapping a weak entity

a) Weak entity DEPENDENT

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 17

 Figure 5-11 Example of mapping a weak entity (cont.)

b) Relations resulting from weak entity

NOTE: the domain

constraint for the foreign key
should NOT allow null value
if DEPENDENT is a weak
entity
Foreign key

Composite primary key

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 18

Transforming EER Diagrams
into Relations (cont.)
Mapping Binary Relationships
 One-to-Many–Primary key on the one
side becomes a foreign key on the many
side
 Many-to-Many–Create a new relation
with the primary keys of the two entities
as its primary key
 One-to-One–Primary key on the
mandatory side becomes a foreign key
Chapteron
1 ©the optional
2009 Pearson side
Education, Inc. Publishing as Prentice Hall 19
 Figure 5-12 Example of mapping a 1:M relationship
a) Relationship between customers and orders

Note the mandatory one

b) Mapping the relationship

Again, no null value in the

foreign key…this is because
of the mandatory minimum
cardinality
Foreign key

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 20

 Figure 5-13 Example of mapping an M:N relationship
a) Completes relationship (M:N)

The Completes relationship will need to become a separate relation

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 21

 Figure 5-13 Example of mapping an M:N relationship (cont.)
b) Three resulting relations

Composite primary key

Foreign key
New
Foreign key
intersection
relation

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 22

 Figure 5-14 Example of mapping a binary 1:1 relationship
a) In_charge relationship (1:1)

Often in 1:1 relationships, one direction is optional

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 23

Figure 5-14 Example of mapping a binary 1:1 relationship (cont.)
b) Resulting relations

Foreign key goes in the relation on the optional side,

matching the primary key on the mandatory side

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 24

Transforming EER Diagrams
into Relations (cont.)
Mapping Associative Entities
Identifier Not Assigned
Default primary key for the
association relation is composed of
the primary keys of the two entities
(as in M:N relationship)
Identifier Assigned
It is natural and familiar to end-users
Default identifier may not be unique
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 25
 Figure 5-15 Example of mapping an associative entity
a) An associative entity

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 26

Figure 5-15 Example of mapping an associative entity (cont.)
b) Three resulting relations

Composite primary key formed from the two foreign keys

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 27

 Figure 5-16 Example of mapping an associative entity with
an identifier
a) SHIPMENT associative entity

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 28

 Figure 5-16 Example of mapping an associative entity with
an identifier (cont.)
b) Three resulting relations

Primary key differs from foreign keys

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 29

Transforming EER Diagrams
into Relations (cont.)
Mapping Unary Relationships
 One-to-Many–Recursive foreign key in
the same relation
 Many-to-Many–Two relations:
One for the entity type
One for an associative relation in
which the primary key has two
attributes, both taken from the
primary key of the entity
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 30
 Figure 5-17 Mapping a unary 1:N relationship

(a) EMPLOYEE entity with

unary relationship

(b) EMPLOYEE
relation with
recursive foreign
key

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 31

 Figure 5-18 Mapping a unary M:N relationship

(a) Bill-of-materials
relationships (M:N)

(b) ITEM and

COMPONENT
relations

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 32

Transforming EER Diagrams
into Relations (cont.)
Mapping Ternary (and n-ary)
Relationships
One relation for each entity
and one for the associative
entity
Associative entity has foreign
keys to each entity in the
Chapterrelationship
1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 33
 Figure 5-19 Mapping a ternary relationship

a) PATIENT TREATMENT Ternary relationship with

associative entity

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 34

 Figure 5-19 Mapping a ternary relationship (cont.)

b) Mapping the ternary relationship PATIENT TREATMENT

Remember This is why But this makes a It would be

that the treatment date very better to create a
primary key and time are cumbersome surrogate key
MUST be included in the key… like Treatment#
unique composite
primary
Chapter 1 © 2009 Pearsonkey
Education, Inc. Publishing as Prentice Hall 35
 Transforming EER
Diagrams into Relations
(cont.)
Mapping Supertype/Subtype Relationships
 One relation for supertype and for each
subtype
 Supertype attributes (including identifier
and subtype discriminator) go into
supertype relation
 Subtype attributes go into each subtype;
primary key of supertype relation also
becomes primary key of subtype relation
 1:1 relationship established between
supertype and each subtype, with
supertype as primary table
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 36
 Figure 5-20 Supertype/subtype relationships

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 37

 Figure 5-21
Mapping Supertype/subtype relationships to relations

These are implemented as one-to-one

relationships

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 38

 Data Normalization
 Primarily a tool to validate and
improve a logical design so that it
satisfies certain constraints that
avoid unnecessary
duplication of data
 The process of decomposing
relations with anomalies to
produce smaller, well-
structured relations
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 39
 Well-Structured Relations
 A relation that contains minimal data
redundancy and allows users to insert, delete,
and update rows without causing data
inconsistencies
 Goal is to avoid anomalies
 Insertion Anomaly–adding new rows forces user to
create duplicate data
 Deletion Anomaly–deleting rows may cause a loss
of data that would be needed for other future rows
 Modification Anomaly–changing data in a row
forces changes to other rows because of duplication
General rule of thumb: A table should not pertain to
more than one entity type
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 40
 Example–Figure 5-2b

Question–Is this a relation? Answer–Yes: Unique rows and no

multivalued attributes

Question–What’s the primary key? Answer–Composite: Emp_ID, Course_Title

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 41

 Anomalies in this Table
 Insertion–can’t enter a new employee
without having the employee take a class
 Deletion–if we remove employee 140, we
lose information about the existence of a Tax
Acc class
 Modification–giving a salary increase to
employee 100 forces us to update multiple
records Why do these anomalies exist?
Because there are two themes (entity types) in this
one relation. This results in data duplication and an
unnecessary dependency between the entities
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 42
 Functional Dependencies and
Keys
 Functional Dependency: The value
of one attribute (the
determinant) determines the
value of another attribute
 Candidate Key:
 A unique identifier. One of the
candidate keys will become the
primary key
E.g. perhaps there is both credit card
number and SS# in a table…in this case
both are candidate keys
 Each non-key field is functionally
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall
dependent on every candidate key 43
 Figure 5.22 Steps in normalization

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 44

 First Normal Form
No multivalued attributes
Every attribute value is atomic
Fig. 5-25 is not in 1st Normal
Form (multivalued attributes)
 it is not a relation
Fig. 5-26 is in 1st Normal form
All relations are in 1st
Normal Form
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 45
 Table with multivalued attributes, not in 1st normal form

Note: this is NOT a relation

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 46

 Table with no multivalued attributes and unique rows, in 1st
normal form

Note: this is a relation, but not a well-structured one

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 47

 Anomalies in this Table
 Insertion–if new product is ordered for order
1007 of existing customer, customer data
must be re-entered, causing duplication
 Deletion–if we delete the Dining Table from
Order 1006, we lose information concerning
this item's finish and price
 Update–changing the price of product ID 4
requires update in several records
Why do these anomalies exist?
Because there are multiple themes (entity types) in
one relation. This results in duplication and an
unnecessary dependency between the entities
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 48
 Second Normal Form
1NF PLUS every non-key
attribute is fully functionally
dependent on the ENTIRE
primary key
Every non-key attribute must be
defined by the entire key, not by only
part of the key
No partial functional dependencies

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 49

 Figure 5-27 Functional dependency diagram for INVOICE

Order_ID  Order_Date, Customer_ID, Customer_Name, Customer_Address

Customer_ID  Customer_Name, Customer_Address
Product_ID  Product_Description, Product_Finish, Unit_Price
Order_ID, Product_ID  Order_Quantity

Therefore, NOT in 2nd Normal Form

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 50
 Figure 5-28 Removing partial dependencies

Getting it into
Second Normal
Form

Partial dependencies are removed, but there

are still transitive dependencies
Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall
51
 Third Normal Form
 2NF PLUS no transitive
dependencies (functional
dependencies on non-primary-key
attributes)
 Note: This is called transitive, because the
primary key is a determinant for another
attribute, which in turn is a determinant
for a third
 Solution: Non-key determinant with
transitive dependencies go into a new
table; non-key determinant becomes
primary key in the new table and stays as
foreign
Chapter key
1 © 2009 inEducation,
Pearson the old Inc. table
Publishing as Prentice Hall 52
 Figure 5-29 Removing partial dependencies

Getting it into
Third Normal
Form

Transitive dependencies are removed

Chapter 1 © 2009 Pearson Education, Inc. Publishing as Prentice Hall 53