Professional Documents
Culture Documents
ER Diagrams
ER Diagrams
Design Process
Modeling
Constraints
E-R Diagram
Design Issues
Weak Entity Sets
Extended E-R Features
Design of the Bank Database
Reduction to Relation Schemas
Database Design
Database System Concepts - 5th Edition, July 11, 2005 2 ©Silberschatz, Korth and Sudarshan
Modeling
Database System Concepts - 5th Edition, July 11, 2005 3 ©Silberschatz, Korth and Sudarshan
Entity Sets customer and loan
Database System Concepts - 5th Edition, July 11, 2005 4 ©Silberschatz, Korth and Sudarshan
Relationship Sets
Database System Concepts - 5th Edition, July 11, 2005 5 ©Silberschatz, Korth and Sudarshan
Relationship Set borrower
Database System Concepts - 5th Edition, July 11, 2005 6 ©Silberschatz, Korth and Sudarshan
Relationship Sets
Database System Concepts - 5th Edition, July 11, 2005 7 ©Silberschatz, Korth and Sudarshan
Degree of a Relationship Set
Relationships between more than two entity sets are rare. Most
relationships are binary.
Database System Concepts - 5th Edition, July 11, 2005 8 ©Silberschatz, Korth and Sudarshan
Attributes
Database System Concepts - 5th Edition, July 11, 2005 9 ©Silberschatz, Korth and Sudarshan
Composite Attributes
Database System Concepts - 5th Edition, July 11, 2005 10 ©Silberschatz, Korth and Sudarshan
Mapping Cardinality Constraints
Database System Concepts - 5th Edition, July 11, 2005 11 ©Silberschatz, Korth and Sudarshan
Mapping Cardinalities
Database System Concepts - 5th Edition, July 11, 2005 12 ©Silberschatz, Korth and Sudarshan
Mapping Cardinalities
Database System Concepts - 5th Edition, July 11, 2005 14 ©Silberschatz, Korth and Sudarshan
Keys for Relationship Sets
Database System Concepts - 5th Edition, July 11, 2005 15 ©Silberschatz, Korth and Sudarshan
E-R Diagrams
Database System Concepts - 5th Edition, July 11, 2005 16 ©Silberschatz, Korth and Sudarshan
E-R Diagram With Composite, Multivalued, and
Derived Attributes
Database System Concepts - 5th Edition, July 11, 2005 17 ©Silberschatz, Korth and Sudarshan
Relationship Sets with Attributes
Database System Concepts - 5th Edition, July 11, 2005 18 ©Silberschatz, Korth and Sudarshan
Roles
Database System Concepts - 5th Edition, July 11, 2005 19 ©Silberschatz, Korth and Sudarshan
Cardinality Constraints
Database System Concepts - 5th Edition, July 11, 2005 20 ©Silberschatz, Korth and Sudarshan
One-To-Many Relationship
Database System Concepts - 5th Edition, July 11, 2005 21 ©Silberschatz, Korth and Sudarshan
Many-To-One Relationships
Database System Concepts - 5th Edition, July 11, 2005 22 ©Silberschatz, Korth and Sudarshan
Many-To-Many Relationship
Database System Concepts - 5th Edition, July 11, 2005 23 ©Silberschatz, Korth and Sudarshan
Participation of an Entity Set in a Relationship Set
Total participation (indicated by double line): every entity in the entity set
participates in at least one relationship in the relationship set
E.g. participation of loan in borrower is total
! every loan must have a customer associated to it via borrower
Partial participation: some entities may not participate in any relationship in
the relationship set
Example: participation of customer in borrower is partial
Database System Concepts - 5th Edition, July 11, 2005 24 ©Silberschatz, Korth and Sudarshan
Alternative Notation for Cardinality Limits
Database System Concepts - 5th Edition, July 11, 2005 25 ©Silberschatz, Korth and Sudarshan
E-R Diagram with a Ternary Relationship
Database System Concepts - 5th Edition, July 11, 2005 26 ©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
E.g. an arrow from works_on to job indicates each employee works on at
most one job at any branch.
If there is more than one arrow, there are two ways of defining the meaning.
E.g 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 - 5th Edition, July 11, 2005 27 ©Silberschatz, Korth and Sudarshan
Design Issues
Database System Concepts - 5th Edition, July 11, 2005 28 ©Silberschatz, Korth and Sudarshan
Binary Vs. Non-Binary Relationships
Database System Concepts - 5th Edition, July 11, 2005 29 ©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 a special identifying attribute for E
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
Database System Concepts - 5th Edition, July 11, 2005 30 ©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 - 5th Edition, July 11, 2005 31 ©Silberschatz, Korth and Sudarshan
Mapping Cardinalities affect ER Design
Database System Concepts - 5th Edition, July 11, 2005 32 ©Silberschatz, Korth and Sudarshan
Weak Entity Sets
An entity set that does not have a primary key is referred to as a weak
entity set.
The existence of a weak entity set depends on the existence of a
identifying entity set
it must relate to the identifying entity set via a total, one-to-many
relationship set from the identifying to the weak entity set
Identifying relationship depicted using a double diamond
The discriminator (or partial key) of a weak entity set is the set of
attributes that distinguishes among all the entities of a weak entity set.
The primary key of a weak entity set is formed by the primary key of the
strong entity set on which the weak entity set is existence dependent,
plus the weak entity set’s discriminator.
Database System Concepts - 5th Edition, July 11, 2005 33 ©Silberschatz, Korth and Sudarshan
Weak Entity Sets (Cont.)
Database System Concepts - 5th Edition, July 11, 2005 34 ©Silberschatz, Korth and Sudarshan
Weak Entity Sets (Cont.)
Note: the primary key of the strong entity set is not explicitly stored
with the weak entity set, since it is implicit in the identifying
relationship.
If loan_number were explicitly stored, payment could be made a
strong entity, but then the relationship between payment and loan
would be duplicated by an implicit relationship defined by the
attribute loan_number common to payment and loan
Database System Concepts - 5th Edition, July 11, 2005 35 ©Silberschatz, Korth and Sudarshan
More Weak Entity Set Examples
Database System Concepts - 5th Edition, July 11, 2005 36 ©Silberschatz, Korth and Sudarshan
Extended E-R Features: Specialization
Database System Concepts - 5th Edition, July 11, 2005 37 ©Silberschatz, Korth and Sudarshan
Specialization Example
Database System Concepts - 5th Edition, July 11, 2005 38 ©Silberschatz, Korth and Sudarshan
Extended ER Features: Generalization
Database System Concepts - 5th Edition, July 11, 2005 39 ©Silberschatz, Korth and Sudarshan
Specialization and Generalization (Cont.)
Database System Concepts - 5th Edition, July 11, 2005 40 ©Silberschatz, Korth and Sudarshan
Design Constraints on a Specialization/
Generalization
Constraint on which entities can be members of a given lower-level
entity set.
condition-defined
! Example: all customers over 65 years are members of senior-
citizen entity set; senior-citizen ISA person.
user-defined
Constraint on whether or not entities may belong to more than one
lower-level entity set within a single generalization.
Disjoint
! an entity can belong to only one lower-level entity set
! Noted in E-R diagram by writing disjoint next to the ISA
triangle
Overlapping
! an entity can belong to more than one lower-level entity set
Database System Concepts - 5th Edition, July 11, 2005 41 ©Silberschatz, Korth and Sudarshan
Design Constraints on a Specialization/
Generalization (Cont.)
Completeness constraint -- specifies whether or not 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 - 5th Edition, July 11, 2005 42 ©Silberschatz, Korth and Sudarshan
Aggregation
Database System Concepts - 5th Edition, July 11, 2005 43 ©Silberschatz, Korth and Sudarshan
Aggregation (Cont.)
Database System Concepts - 5th Edition, July 11, 2005 44 ©Silberschatz, Korth and Sudarshan
E-R Diagram With Aggregation
Database System Concepts - 5th Edition, July 11, 2005 45 ©Silberschatz, Korth and Sudarshan
E-R Design Decisions
Database System Concepts - 5th Edition, July 11, 2005 46 ©Silberschatz, Korth and Sudarshan
E-R Diagram for a Banking Enterprise
Database System Concepts - 5th Edition, July 11, 2005 47 ©Silberschatz, Korth and Sudarshan
Summary of Symbols Used in E-R Notation
Database System Concepts - 5th Edition, July 11, 2005 48 ©Silberschatz, Korth and Sudarshan
Summary of Symbols (Cont.)
Database System Concepts - 5th Edition, July 11, 2005 49 ©Silberschatz, Korth and Sudarshan
Reduction to Relation Schemas
Database System Concepts - 5th Edition, July 11, 2005 50 ©Silberschatz, Korth and Sudarshan
Representing Entity Sets as Schemas
Database System Concepts - 5th Edition, July 11, 2005 51 ©Silberschatz, Korth and Sudarshan
Representing Relationship Sets as Schemas
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: schema for relationship set borrower
borrower = (customer_id, loan_number )
Database System Concepts - 5th Edition, July 11, 2005 52 ©Silberschatz, Korth and Sudarshan
Redundancy of Schemas
Database System Concepts - 5th Edition, July 11, 2005 53 ©Silberschatz, Korth and Sudarshan
Redundancy of Schemas (Cont.)
For one-to-one relationship sets, either side can be chosen to act as the
“many” side
That is, 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
The schema corresponding to a relationship set linking a weak entity set
to its identifying strong entity set is redundant.
Example: The payment schema already contains the attributes that
would appear in the loan_payment schema (i.e., loan_number and
payment_number).
Database System Concepts - 5th Edition, July 11, 2005 54 ©Silberschatz, Korth and Sudarshan
Composite and Multivalued Attributes
Composite attributes are flattened out by creating a separate attribute for
each component attribute
Example: given entity set customer with composite attribute name with
component attributes first_name and last_name the schema
corresponding to the entity set has two attributes
name.first_name and name.last_name
A multivalued attribute M of an entity 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 dependent_names of employee is
represented by a schema:
employee_dependent_names = ( employee_id, dname)
Each value of the multivalued attribute maps to a separate tuple of the
relation on schema EM
! For example, an employee entity with primary key 123-45-6789
and dependents Jack and Jane maps to two tuples:
(123-45-6789 , Jack) and (123-45-6789 , Jane)
Database System Concepts - 5th Edition, July 11, 2005 55 ©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
schema attributes
person name, street, city
customer name, credit_rating
employee name, salary
Drawback: getting 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 - 5th Edition, July 11, 2005 56 ©Silberschatz, Korth and Sudarshan
Representing Specialization as Schemas (Cont.)
Method 2:
Form a schema for each entity set with all local and inherited attributes
schema attributes
person name, street, city
customer name, street, city, credit_rating
employee name, street, city, salary
If specialization is total, the schema for the generalized entity set (person)
not required to store information
! Can be defined as a “view” relation containing union of specialization
relations
! But explicit schema may still be needed for foreign key constraints
Drawback: street and city may be stored redundantly for people who are
both customers and employees
Database System Concepts - 5th Edition, July 11, 2005 57 ©Silberschatz, Korth and Sudarshan
Schemas Corresponding to Aggregation
Database System Concepts - 5th Edition, July 11, 2005 58 ©Silberschatz, Korth and Sudarshan
Schemas Corresponding to Aggregation (Cont.)
For example, to represent aggregation manages between
relationship works_on and entity set manager, create a schema
Database System Concepts - 5th Edition, July 11, 2005 59 ©Silberschatz, Korth and Sudarshan
Figure 6.31
Database System Concepts - 5th Edition, July 11, 2005 60 ©Silberschatz, Korth and Sudarshan