Chapter 6: Database Design Using the E-R

Model

Database System Concepts, 7th Ed.

©Silberschatz, Korth and Sudarshan
See www.db-book.com for conditions on re-use
 Outline

 Overview of the Design Process

 The Entity-Relationship Model
 Complex Attributes
 Mapping Cardinalities
 Primary Key
 Removing Redundant Attributes in Entity Sets
 Reducing ER Diagrams to Relational Schemas
 Extended E-R Features
 Entity-Relationship Design Issues
 Alternative Notations for Modeling Data
 Other Aspects of Database Design

Database System Concepts - 7th Edition 6.2 ©Silberschatz, Korth and Sudarshan
 Design Phases

 Initial phase -- Characterize fully the data needs of the

prospective database users.
 Second phase -- Choosing a data model
 Final Phase -- Moving from an abstract data model to the
implementation of the database

Database System Concepts - 7th Edition 6.3 ©Silberschatz, Korth and Sudarshan
 Logical versus Physical

 Logical Design – Deciding on the database schema.

Database design requires that we find a “good” collection of
relation schemas.
 Physical Design – Deciding on the physical layout of the
database

Database System Concepts - 7th Edition 6.4 ©Silberschatz, Korth and Sudarshan
 Logical Design

 Business decision – What attributes should we record in the

database?
 Computer Science decision – What relation schemas should
we have and how should the attributes be distributed among
the various relation schemas

Database System Concepts - 7th Edition 6.5 ©Silberschatz, Korth and Sudarshan
 Logical Design Alternatives

 Consider the information about the instructors.

 Schema one:
 Instructor = (ID, name, dept_name, salary)
 Schema two:
 In1 = (ID, name)
 In2 = (ID, dept_name)
 In3 = (ID, salary)
 Schema three:
 In1 = (ID, name)
 In2 = (name, dept_name, salary)
 They contain the same set of attributes
 What are the differences?

Database System Concepts - 7th Edition 6.6 ©Silberschatz, Korth and Sudarshan
 Design Pitfalls

 In designing a database schema, we must ensure that we avoid two

major pitfalls:
• Redundancy: a bad design may result in repeat information.
• Example:
Instructor = (name, ID, dept_name, number_of_instructors)
• Where is the redundancy in this scheme?
 Redundant representation of information may lead to data
inconsistency among the various copies of information
• Incompleteness: a bad design may make certain aspects of the
enterprise difficult or impossible to model. More later!
 Avoiding bad designs is not enough.
 There may be a large number of good designs from which we
must choose.

Database System Concepts - 7th Edition 6.7 ©Silberschatz, Korth and Sudarshan
 Design Approaches

 Entity Relationship Model (covered in this chapter)

• Models an enterprise as a collection of entities and relationships
• Represented diagrammatically by an entity-relationship diagram:
 Normalization Theory (Chapter 7)
• Formalize what designs are bad, and test for them

Database System Concepts - 7th Edition 6.8 ©Silberschatz, Korth and Sudarshan
Outline of the ER Model
 The ER model

 The ER data mode was developed to facilitate database design by

allowing specification of an enterprise schema that represents the
overall logical structure of a database.
 The ER data model employs three basic concepts:
 entity sets,
 relationship sets,
 attributes.
 The ER model also has an associated diagrammatic representation,
the ER diagram, which can express the overall logical structure of a
database graphically.

Database System Concepts - 7th Edition 6.10 ©Silberschatz, Korth and Sudarshan
 Entity Sets
 An entity is an object that exists and is distinguishable from other
objects.
 Example: specific person, company, event, plant
 An entity set is a set of entities of the same type that share the same
properties.
 Example: set of all persons, companies, trees, holidays
 An entity is represented by a set of attributes; i.e., descriptive properties
possessed by all members of an entity set.
 Example:
 instructor = (ID, name, salary )
 course= (course_id, title, credits)
 A subset of the attributes form a primary key of the entity set; i.e.,
uniquely identifying each member of the set.

Database System Concepts - 7th Edition 6.11 ©Silberschatz, Korth and Sudarshan
 Representing Entity sets in ER Diagram

 Rectangles represent entity sets.

 Attributes listed inside entity rectangle
 Underline indicates primary key attributes

Database System Concepts - 7th Edition 6.13 ©Silberschatz, Korth and Sudarshan
 Relationship Sets

 A relationship is an association among several entities

Example:

44553 (Peltier) advisor 22222 (Einstein)

student entity relationship set instructor entity

 A relationship set is a mathematical relation among n  2 entities,

each taken from entity sets
{(e1, e2, … en) | e1  E1, e2  E2, …, en  En}

where (e1, e2, …, en) is a relationship

 Example:
(44553,22222)  advisor

Database System Concepts - 7th Edition 6.14 ©Silberschatz, Korth and Sudarshan
 Relationship Sets (Cont.)

 Example: we define the relationship set advisor to denote the

associations between students and the instructors who act as their
advisors.
 Pictorially, we draw a line between related entities.

Database System Concepts - 7th Edition 6.15 ©Silberschatz, Korth and Sudarshan
 Representing Relationship Sets via ER Diagrams

 Diamonds represent relationship sets.

Database System Concepts - 7th Edition 6.16 ©Silberschatz, Korth and Sudarshan
 Relationship Sets (Cont.)

 An attribute can also be associated with a relationship set.

 For instance, the advisor relationship set between entity sets instructor
and student may have the attribute date which tracks when the student
started being associated with the advisor

Database System Concepts - 7th Edition 6.17 ©Silberschatz, Korth and Sudarshan
 Relationship Sets with Attributes

Database System Concepts - 7th Edition 6.18 ©Silberschatz, Korth and Sudarshan
 Roles

 Entity sets of a relationship need not be distinct

 Each occurrence of an entity set plays a “role” in the relationship
 The labels “course_id” and “prereq_id” are called roles.

Database System Concepts - 7th Edition 6.19 ©Silberschatz, Korth and Sudarshan
 Degree of a Relationship Set

 Binary relationship
 Involve two entity sets (or degree two).
 Most relationship sets in a database system are binary.
 Non-binary relationship
 Example: students work on research projects under the
guidance of an instructor.
 Relationship proj_guide is a ternary relationship between
instructor, student, and project

Database System Concepts - 7th Edition 6.20 ©Silberschatz, Korth and Sudarshan
 Non-binary Relationship Sets

 E-R Diagram with a Ternary Relationship

Database System Concepts - 7th Edition 6.21 ©Silberschatz, Korth and Sudarshan
 Attributes

 Attribute types:
 Simple and composite attributes.
 Allow us to divided attributes into subparts (other attributes).
 Single-valued and multivalued attributes
 Example: multivalued attribute: phone_numbers
 Derived attributes
 Can be computed from other attributes
 Example: age -- can be derived from given date_of_birth
 Domain – the set of permitted values for each attribute

Database System Concepts - 7th Edition 6.22 ©Silberschatz, Korth and Sudarshan
 Composite Attributes

 Composite attributes allow us to divided attributes into subparts (other

attributes).

Database System Concepts - 7th Edition 6.23 ©Silberschatz, Korth and Sudarshan
 Representing Complex Attributes in ER Diagram

Database System Concepts - 7th Edition 6.24 ©Silberschatz, Korth and Sudarshan
 Mapping Cardinality Constraints

 Express the number of entities to which another entity can be associated

via a relationship set.
 Most useful in describing binary relationship sets.
 For a binary relationship set the mapping cardinality must be one of the
following types:
 One to one
 One to many
 Many to one
 Many to many

Database System Concepts - 7th Edition 6.25 ©Silberschatz, Korth and Sudarshan
 Mapping Cardinalities

One to one One to many

Note: Some elements in A and B may not be mapped to any

elements in the other set

Database System Concepts - 7th Edition 6.26 ©Silberschatz, Korth and Sudarshan
 Mapping Cardinalities

Many to one Many to many

Note: Some elements in A and B may not be mapped to any

elements in the other set

Database System Concepts - 7th Edition 6.27 ©Silberschatz, Korth and Sudarshan
 Cardinality Constraints in ER Diagram

 We express cardinality constraints by drawing either a directed line (),

signifying “one,” or an undirected line (—), signifying “many,” between
the relationship set and the entity set.
 One-to-one relationship between an instructor and a student :
 A student is associated with at most one instructor via the
relationship advisor
 A student is associated with at most one department via stud_dept

Database System Concepts - 7th Edition 6.28 ©Silberschatz, Korth and Sudarshan
 One-to-Many Relationship

 One-to-many relationship between an instructor and a student

 An instructor is associated with several (including 0) students via
advisor
 A student is associated with at most one instructor via advisor,

Database System Concepts - 7th Edition 6.29 ©Silberschatz, Korth and Sudarshan
 Many-to-One Relationships

 Many-to-one relationship between an instructor and a student

 An instructor is associated with at most one student via advisor,
 A student is associated with several (including 0) instructors via advisor

Database System Concepts - 7th Edition 6.30 ©Silberschatz, Korth and Sudarshan
 Many-to-Many Relationship

 An instructor is associated with several (possibly 0) students via advisor

 A student is associated with several (possibly 0) instructors via advisor

Database System Concepts - 7th Edition 6.31 ©Silberschatz, Korth and Sudarshan
 Total and Partial Participation

 Total participation (indicated by double line): every entity in the entity

set participates in at least one relationship in the relationship set

participation of student in advisor relation is total

 Every student must have an associated instructor
 Partial participation: some entities may not participate in any
relationship in the relationship set
• Example: participation of instructor in advisor is partial

Database System Concepts - 7th Edition 6.32 ©Silberschatz, Korth and Sudarshan
 Expressing More Complex Constraints

 A line may have an associated minimum and maximum cardinality, shown

in the form l..h, where l is the minimum and h the maximum cardinality
• A minimum value of 1 indicates total participation.
• A maximum value of 1 indicates that the entity participates in at most
one relationship
• A maximum value of * indicates no limit.
 Example

• Instructor can advise 0 or more students. A student must have 1

advisor; cannot have multiple advisors

Database System Concepts - 7th Edition 6.33 ©Silberschatz, Korth and Sudarshan
 Cardinality Constraints on Ternary Relationship

 We allow at most one arrow out of a ternary (or greater degree)

relationship to indicate a cardinality constraint
 For example, an arrow from proj_guide to instructor indicates each
student has at most one guide for a project

Database System Concepts - 7th Edition 6.34 ©Silberschatz, Korth and Sudarshan
 Ternary Relationship (Cont.)

 If there is more than one arrow, there are two ways of defining the
meaning.
 For example, a ternary relationship R between A, B and C with
arrows to B and C could mean
1. Each A entity is associated with a unique entity
from B
and C or
2. Each pair of entities from (A, B) is associated with a
unique C entity, and each pair (A, C) is associated
with a unique B
 Each alternative has been used in different formalisms
 To avoid confusion, we outlaw more than one arrow

Database System Concepts - 7th Edition 6.35 ©Silberschatz, Korth and Sudarshan
 Primary Keys in ER model

 Primary keys provide a way to specify how entities and relations are
distinguished. We will consider:
 Entity sets
 Relationship sets.
 Weak entity sets

Database System Concepts - 7th Edition 6.36 ©Silberschatz, Korth and Sudarshan
 Primary key for Entity Sets

 By definition, individual entities are distinct.

 From database perspective, the differences among them must be
expressed in terms of their attributes.
 The values of the attribute of an entity must be such that they can
uniquely identify the entity.
 No two entities in an entity set are allowed to have exactly the
same value for all attributes.
 A key for an entity is a set of attributes that suffice to distinguish entities
from each other

Database System Concepts - 7th Edition 6.37 ©Silberschatz, Korth and Sudarshan
 Primary Key for Relationship Sets

 To distinguish among the various relationships of a relationship set we use

the individual primary keys of the entities in the relationship set.
 Let R be a relationship set involving entity sets E1, E2, .. En
 The primary key for R consists of the union of the primary keys of
entity sets E1, E2, ..En
 If the relationship set R has attributes a1, a2, .., am associated with it,
then the primary key of R also includes the attributes a1, a2, .., am
 Example: relationship set “advisor”.
 The primary key consists of instructor.ID and student.ID
 The choice of the primary key for a relationship set depends on the
mapping cardinality of the relationship set.

Database System Concepts - 7th Edition 6.38 ©Silberschatz, Korth and Sudarshan
 Weak Entity Sets

 There are some entities that are totally dependent on other entities.
 For example, consider the entity sets
 employee (ID, name)
 children (name, age)
 The entity set children is related to the entity set employee. Clearly,
without an employee entity there will not be a children entity.
 The primary key of the employee entity set is ID.
 A children entity set does not have a primary key. The attribute name
does not uniquely identify a particular child.
 A weak entity set is one whose existence is dependent on another
entity set.
 Instead of associating a primary key with a weak entity, we use the
identifying entity, along with extra attributes called discriminator to
uniquely identify a weak entity.

Database System Concepts - 7th Edition 6.39 ©Silberschatz, Korth and Sudarshan
 University Example of Weak Entity Sets

 The section entities are related to course entities and without course
there will not be sections.
 A section entity is uniquely identified by a course_id, semester, year,
and sec_id.
 The section entities are related to course entities via a relationship set
sec_course
 The information in sec_course is redundant, since section already has
an attribute course_id, which identifies the course with which the section
is related.

Database System Concepts - 7th Edition 6.40 ©Silberschatz, Korth and Sudarshan
 Weak Entity Sets (Cont.)

 An entity set that is not a weak entity set is termed a strong

entity set.
 Every weak entity must be associated with an identifying entity;
that is, the weak entity set is said to be existence dependent on
the identifying entity set.
 The identifying entity set is said to own the weak entity set that it
identifies.
 The relationship associating the weak entity set with the
identifying entity set is called the identifying relationship.

Database System Concepts - 7th Edition 6.41 ©Silberschatz, Korth and Sudarshan
 Expressing Weak Entity Sets

 In E-R diagrams, a weak entity set is depicted via a double rectangle.

 We underline the discriminator of a weak entity set with a dashed line.
 The relationship set connecting the weak entity set to the identifying
strong entity set is depicted by a double diamond.
 Primary key for section – (course_id, sec_id, semester, year)

Database System Concepts - 7th Edition 6.42 ©Silberschatz, Korth and Sudarshan
 Redundant Attributes

 Suppose we have entity sets:

 instructor, with attributes: ID, name, dept_name, salary
 department, with attributes: dept_name, building, budget
 We model the fact that each instructor has an associated department
using a relationship set inst_dept

 The attribute dept_name in instructor replicates information present in

the relationship and is therefore redundant and needs to be removed.
 BUT: when converting back to tables, in some cases the attribute gets
reintroduced, as we will see later.

Database System Concepts - 7th Edition 6.43 ©Silberschatz, Korth and Sudarshan
 E-R Diagram for a University Enterprise

Database System Concepts - 7th Edition 6.44 ©Silberschatz, Korth and Sudarshan
Reduction to Relation Schemas
 Reduction to Relation Schemas

 Entity sets and relationship sets can be expressed uniformly as

relation schemas that represent the contents of the database.
 A database which conforms to an E-R diagram can be represented
by a collection of schemas.
 For each entity set and relationship set there is a unique schema that
is assigned the name of the corresponding entity set or relationship
set.
 Each schema has a number of columns (generally corresponding to
attributes), which have unique names.

Database System Concepts - 7th Edition 6.46 ©Silberschatz, Korth and Sudarshan
 Representing Strong Entity Sets

 A strong entity set reduces to a schema with the same set of attributes

 Example
instructor (ID, name, salary)
student (ID, name, tot_cred)

Database System Concepts - 7th Edition 6.47 ©Silberschatz, Korth and Sudarshan
 Representing Weak Entity Sets

 A weak entity set becomes a table that includes a column for the primary key
of the identifying strong entity set

 Example

section ( course_id, sec_id, sem, year )

Database System Concepts - 7th Edition 6.48 ©Silberschatz, Korth and Sudarshan
 Representation of Composite Attributes

 Composite attributes are flattened out by creating a

separate attribute for each component attribute
 Ignoring multivalued attributes, the extended instructor
schema is
• instructor(ID,
first_name,
middle_initial,
last_name,
street_number,
street_name,
apt_number,
city,
state,
zip_code,
date_of_birth)

Database System Concepts - 7th Edition 6.49 ©Silberschatz, Korth and Sudarshan
 Multivalued Attributes

 A multivalued attribute M of an entity set E is represented by a

separate schema EM
 Schema EM has attributes corresponding to the primary key of E
and an attribute corresponding to multivalued attribute M
 Example:
Multivalued attribute phone_number of instructor is represented

by a schema:
inst_phone= ( ID, phone_number )
 Each value of the multivalued attribute maps to a separate tuple of
the relation on schema EM
• For example, an instructor entity with primary key 22222 and
phone numbers 456-7890 and 123-4567 maps to two tuples:
• (22222, 456-7890)
• (22222, 123-4567)

Database System Concepts - 7th Edition 6.50 ©Silberschatz, Korth and Sudarshan
 Representing Relationship Sets

 A many-to-many relationship set is represented as a schema with

attributes for the primary keys of the two participating entity sets, and
any descriptive attributes of the relationship set.
 Example: relationship set advisor

 Corresponding schema:
advisor = (s_id, i_id)

Database System Concepts - 7th Edition 6.51 ©Silberschatz, Korth and Sudarshan
 Representing Relationship Sets (Cont.)

 Many-to-one and one-to-many relationship sets that are total on the many-
side can be represented by adding an extra attribute to the “many” side,
containing the primary key of the “one” side. No schema is created for the
relationship set.
 Example:

• Instead of creating a schema for relationship set inst_dept, add an

attribute dept_name to the schema arising from entity set instructor

Database System Concepts - 7th Edition 6.52 ©Silberschatz, Korth and Sudarshan
 Representing Relationship Sets (cont.)

 For one-to-one relationship sets, either side can be chosen to

act as the “many” side
• That is, an extra attribute can be added to either of the
tables corresponding to the two entity sets
 If participation is partial on the “many” side, replacing a schema
by an extra attribute in the schema corresponding to the “many”
side could result in null values

Database System Concepts - 7th Edition 6.53 ©Silberschatz, Korth and Sudarshan
 Redundancy of Schemas

 The schema corresponding to a relationship set linking a weak entity set

to its identifying strong entity set is redundant and can be eliminated
 Example: The section schema already contains the attributes that would
appear in the sec_course schema

Database System Concepts - 7th Edition 6.54 ©Silberschatz, Korth and Sudarshan
Extended E-R Features
 Specialization

 Top-down design process; we designate sub-groupings within an

entity set that are distinctive from other entities in the set.
 These sub-groupings become lower-level entity sets that have
attributes or participate in relationships that do not apply to the
higher-level entity set.
 Depicted by a triangle component labeled ISA (e.g., instructor “is a”
person).
 Attribute inheritance – a lower-level entity set inherits all the
attributes and relationship participation of the higher-level entity set
to which it is linked.

Database System Concepts - 7th Edition 6.56 ©Silberschatz, Korth and Sudarshan
 Specialization Example
 Overlapping – employee and student
 Disjoint – instructor and secretary
 Total and partial

Database System Concepts - 7th Edition 6.57 ©Silberschatz, Korth and Sudarshan
 Representing Specialization via Schemas

 Method 1:
• Form a schema for the higher-level entity
• Form a schema for each lower-level entity set, include primary key
of higher-level entity set and local attributes

• Drawback: getting full information about an employee requires

accessing two relations, the one corresponding to the low-level
schema and the one corresponding to the high-level schema

Database System Concepts - 7th Edition 6.58 ©Silberschatz, Korth and Sudarshan
 Representing Specialization as Schemas
(Cont.)

 Method 2:
• Form a schema for each entity set with all local and inherited
attributes

• Drawback: name, street and city may be stored redundantly for

people who are both students and employees

Database System Concepts - 7th Edition 6.59 ©Silberschatz, Korth and Sudarshan
 Generalization

 A bottom-up design process – combine a number of entity sets

that share the same features into a higher-level entity set.
 Specialization and generalization are simple inversions of each
other; they are represented in an E-R diagram in the same way.
 The terms specialization and generalization are used
interchangeably.

Database System Concepts - 7th Edition 6.60 ©Silberschatz, Korth and Sudarshan
 Completeness constraint

 Specifies whether an entity in the higher-level entity set must belong

to at least one of the lower-level entity sets within a generalization.
 total: an entity must belong to one of the lower-level entity sets
 partial: an entity need not belong to one of the lower-level entity
sets

Database System Concepts - 7th Edition 6.61 ©Silberschatz, Korth and Sudarshan
 Completeness constraint (Cont.)

 Partial generalization is the default.

 We can specify total generalization in an ER diagram by adding the
keyword total in the diagram and drawing a dashed line from the
keyword to the corresponding hollow arrow-head to which it applies
(for a total generalization), or to the set of hollow arrow-heads to
which it applies (for an overlapping generalization).
 The student generalization is total: All student entities must be either
graduate or undergraduate. Because the higher-level entity set
arrived at through generalization is generally composed of only those
entities in the lower-level entity sets, the completeness constraint for a
generalized higher-level entity set is usually total

Database System Concepts - 7th Edition 6.62 ©Silberschatz, Korth and Sudarshan
 Aggregation

 Consider the ternary relationship proj_guide, which we saw earlier

 Suppose we want to record evaluations of a student by a guide on a
project

Database System Concepts - 7th Edition 6.63 ©Silberschatz, Korth and Sudarshan
 Aggregation (Cont.)

 Relationship sets eval_for and proj_guide represent overlapping

information
 Every eval_for relationship corresponds to a proj_guide relationship
 However, some proj_guide relationships may not correspond to any
eval_for relationships
 So we can’t discard the proj_guide relationship
 Eliminate this redundancy via aggregation
 Treat relationship as an abstract entity
 Allows relationships between relationships
 Abstraction of relationship into new entity

Database System Concepts - 7th Edition 6.64 ©Silberschatz, Korth and Sudarshan
 Aggregation (Cont.)

 Eliminate this redundancy via aggregation without introducing redundancy,

the following diagram represents:
• A student is guided by a particular instructor on a particular project
• A student, instructor, project combination may have an associated
evaluation

Database System Concepts - 7th Edition 6.65 ©Silberschatz, Korth and Sudarshan
 Aggregation -- Reduction to Relational Schemas

 To represent aggregation, create a schema containing

• Primary key of the aggregated relationship,
• The primary key of the associated entity set
• Any descriptive attributes
 In our example:
• The schema eval_for is:
eval_for (s_ID, project_id, i_ID, evaluation_id)
• The schema proj_guide is redundant.

Database System Concepts - 7th Edition 6.66 ©Silberschatz, Korth and Sudarshan
Design Issues
 Entities vs. Attributes

 Use of entity sets vs. attributes

 Use of phone as an entity allows extra information about phone numbers

(plus multiple phone numbers)

Database System Concepts - 7th Edition 6.68 ©Silberschatz, Korth and Sudarshan
 Entities vs. Relationship sets

 Use of entity sets vs. relationship sets

Possible guideline is to designate a relationship set to describe
an action that occurs between entities

 Placement of relationship attributes

For example, attribute date as attribute of advisor or as attribute
of student

Database System Concepts - 7th Edition 6.69 ©Silberschatz, Korth and Sudarshan
 Binary Vs. Non-Binary Relationships

 Although it is possible to replace any non-binary (n-ary, for n > 2)

relationship set by a number of distinct binary relationship sets, a
n-ary relationship set shows more clearly that several entities
participate in a single relationship.
 Some relationships that appear to be non-binary may be better
represented using binary relationships
 For example, a ternary relationship parents, relating a child to
his/her father and mother, is best replaced by two binary
relationships, father and mother
 Using two binary relationships allows partial information
(e.g., only mother being known)
 But there are some relationships that are naturally non-binary
 Example: proj_guide

Database System Concepts - 7th Edition 6.70 ©Silberschatz, Korth and Sudarshan
 Converting Non-Binary Relationships to Binary Form

 In general, any non-binary relationship can be represented using binary

relationships by creating an artificial entity set.
 Replace R between entity sets A, B and C by an entity set E, and
three relationship sets:
1. RA, relating E and A 2. RB, relating E and B
3. RC, relating E and C
 Create an identifying attribute for E and add any attributes of R to E
 For each relationship (ai , bi , ci) in R, create
1. a new entity ei in the entity set E 2. add (ei , ai ) to RA
3. add (ei , bi ) to RB 4. add (ei , ci ) to RC.
 Resulting ER diagram

Database System Concepts - 7th Edition 6.71 ©Silberschatz, Korth and Sudarshan
 Converting Non-Binary Relationships (Cont.)

 Also need to translate constraints

 Translating all constraints may not be possible
 There may be instances in the translated schema that
cannot correspond to any instance of R
 Exercise: add constraints to the relationships RA, RB and
RC to ensure that a newly created entity corresponds to
exactly one entity in each of entity sets A, B and C
 We can avoid creating an identifying attribute by making E a
weak entity set (described shortly) identified by the three
relationship sets

Database System Concepts - 7th Edition 6.72 ©Silberschatz, Korth and Sudarshan
 E-R Design Decisions

 The use of an attribute or entity set to represent an object.

 Whether a real-world concept is best expressed by an entity set
or a relationship set.
 The use of a ternary relationship versus a pair of binary
relationships.
 The use of a strong or weak entity set.
 The use of specialization/generalization – contributes to
modularity in the design.
 The use of aggregation – can treat the aggregate entity set as a
single unit without concern for the details of its internal structure.

Database System Concepts - 7th Edition 6.73 ©Silberschatz, Korth and Sudarshan
 Summary of Symbols Used in E-R Notation

Database System Concepts - 7th Edition 6.74 ©Silberschatz, Korth and Sudarshan
 Symbols Used in E-R Notation (Cont.)

Database System Concepts - 7th Edition 6.75 ©Silberschatz, Korth and Sudarshan
 Alternative ER Notations

 Chen, IDE1FX, …

Database System Concepts - 7th Edition 6.76 ©Silberschatz, Korth and Sudarshan
 Alternative ER Notations (Cont.)

Chen IDE1FX (Crows feet notation)

Database System Concepts - 7th Edition 6.77 ©Silberschatz, Korth and Sudarshan
 Unified Modeling Language (UML)

 UML has many components to graphically model different aspects

of an entire software system
 UML Class Diagrams correspond to E-R Diagram, but several
differences.

Database System Concepts - 7th Edition 6.78 ©Silberschatz, Korth and Sudarshan
 ER vs. UML Class Diagrams

* Note reversal of position in cardinality constraint depiction

Database System Concepts - 7th Edition 6.79 ©Silberschatz, Korth and Sudarshan
 ER vs. UML Class Diagrams

ER Diagram Notation Equivalent in UML

* Generalization can use merged or separate arrows independent

of disjoint/overlapping

Database System Concepts - 7th Edition 6.80 ©Silberschatz, Korth and Sudarshan
 UML Class Diagrams (Cont.)

 Binary relationship sets are represented in UML by just drawing

a line connecting the entity sets. The relationship set name is
written adjacent to the line.
 The role played by an entity set in a relationship set may also be
specified by writing the role name on the line, adjacent to the
entity set.
 The relationship set name may alternatively be written in a box,
along with attributes of the relationship set, and the box is
connected, using a dotted line, to the line depicting the
relationship set.

Database System Concepts - 7th Edition 6.81 ©Silberschatz, Korth and Sudarshan
 ER vs. UML Class Diagrams

Database System Concepts - 7th Edition 6.82 ©Silberschatz, Korth and Sudarshan
 Other Aspects of Database Design

 Functional Requirements
 Data Flow, Workflow
 Schema Evolution

Database System Concepts - 7th Edition 6.83 ©Silberschatz, Korth and Sudarshan
 End of Chapter 6

Database System Concepts, 7th Ed.

©Silberschatz, Korth and Sudarshan
See www.db-book.com for conditions on re-use
 Design Phases – choosing a data model

 Applying the concepts of the chosen data model

 Translating these requirements into a conceptual schema of the
database.
 A fully developed conceptual schema indicates the functional
requirements of the enterprise.
 Describe the kinds of operations (or transactions) that will be
performed on the data.

Database System Concepts - 7th Edition 6.85 ©Silberschatz, Korth and Sudarshan
 Design Phases (Cont.)

 Final Phase -- Moving from an abstract data model to the

implementation of the database
 Logical Design – Deciding on the database schema.
Database design requires that we find a “good” collection
of relation schemas.
 Physical Design – Deciding on the physical layout of the
database

Database System Concepts - 7th Edition 6.86 ©Silberschatz, Korth and Sudarshan
 Cardinality Constraints on Ternary Relationship

 We allow at most one arrow out of a ternary (or greater degree)

relationship to indicate a cardinality constraint
 For example, an arrow from proj_guide to instructor indicates each
student has at most one guide for a project
 If there is more than one arrow, there are two ways of defining the
meaning.
 For example, a ternary relationship R between A, B and C with
arrows to B and C could mean
1. Each A entity is associated with a unique entity
from B
and C or
2. Each pair of entities from (A, B) is associated with a
unique C entity, and each pair (A, C) is associated
with a unique B
 Each alternative has been used in different formalisms
 To avoid confusion, we outlaw more than one arrow

Database System Concepts - 7th Edition 6.87 ©Silberschatz, Korth and Sudarshan