Entity-Relationship (ER) Model
Entity-Relationship (ER) Model
(ER) Model
Chapter Outline
Example Database Application (COMPANY)
ER Model Concepts
Entities and Attributes
Entity Types, Value Sets, and Key Attributes
Relationships and Relationship Types
Weak Entity Types
Roles and Attributes in Relationship Types
ER Diagrams - Notation
ER Diagram for COMPANY Schema
Example COMPANY
Database
Requirements of the Company
(oversimplified for illustrative purposes)
The company is organized into
DEPARTMENTs. Each department has a
name, number and an employee who
manages the department. We keep track
of the start date of the department
manager.
Each department controls a number of
PROJECTs. Each project has a name,
number and is located at a single location.
Example COMPANY Database
(Cont.)
Entities with the same basic attributes are grouped or typed into
an entity type.
For example, the EMPLOYEE entity type or the PROJECT entity
type.
An attribute of an entity type for which each entity must have a
unique value is called a key attribute of the entity type.
For example, TCNo of EMPLOYEE.
A key attribute may be composite.
For example, course no and department code together
constitutes a key like CENG 302 (there may be other 302
courses in other departments).
An entity type may have more than one key.
For example, for a vehicle both of the below numbers are
unique
Vehicle plate number
Engine number
ENTITY SET corresponding to the
ENTITY TYPE Movie
Movie
Name, Year, Language, Director, {Leading Actor}, {Leading Actress}
movie1
(“Gone with the Wind”, 1950, English, “Victor Fleming”,
{“Clark Gable”},{“Vivien Leigh”})
movie2
(“Hababam Sinifi Merhaba”,2004 ,Turkish ,”Kartal Tibet”,
{Halit Akcatepe,M.Ali Erbil, M.Ali Alabora},{Hulya Kocyigit,
Nehir Erdogan})
.
.
.
SUMMARY OF ER-DIAGRAM
NOTATION FOR ER SCHEMAS
Symbol Meaning
ENTITY TYPE
RELATIONSHIP TYPE
ATTRIBUTE
KEY ATTRIBUTE
MULTIVALUED ATTRIBUTE
COMPOSITE ATTRIBUTE
DERIVED ATTRIBUTE
E1 R E2 TOTAL PARTICIPATION OF E2 IN R
N
E1 R E2 CARDINALITY RATIO 1:N FOR E1:E2 IN R
(min,max)
R E STRUCTURAL CONSTRAINT (min, max) ON PARTICIPATION
OF E IN R
ER DIAGRAM – Entity Types are:
EMPLOYEE, DEPARTMENT, PROJECT,
DEPENDENT
Relationships and Relationship Types (1)
A relationship relates two or more distinct entities with a
specific meaning.
For example, EMPLOYEE Bill Gates works on the Linux
Project or
EMPLOYEE Cem Yilmaz manages the Entertainment
Department.
Relationships of the same type are grouped or typed into a
relationship type.
For example, the WORKS_ON relationship type in which
EMPLOYEEs and PROJECTs participate, or
the MANAGES relationship type in which EMPLOYEEs and
DEPARTMENTs participate.
The degree of a relationship type is the number of
participating entity types. Both MANAGES and WORKS_ON
are binary relationships.
Example relationship instances of the WORKS_FOR
relationship between EMPLOYEE and DEPARTMENT
EMPLOYEE WORKS_FOR DEPARTMENT
r1
e1 d1
e2 r2
e3 r3 d2
e4 r4
e5 d3
r5
e6
r6
e7
r7
Relationships and Relationship
Types (2)
More than one relationship type can exist with
the same participating entity types. For example,
MANAGES and WORKS_FOR are distinct
relationships between EMPLOYEE and
DEPARTMENT, but with different meanings and
different relationship instances.
Weak Entity Types
An entity that does not have a key attribute
A weak entity must participate in an identifying
relationship type with an owner or identifying entity
type
Entities are identified by the combination of:
A partial key of the weak entity type
The particular entity they are related to in the
identifying entity type
Example:
Suppose that a DEPENDENT entity is identified by the
dependent’s first name and birhtdate, and the specific
EMPLOYEE that the dependent is related to.
DEPENDENT is a weak entity type with EMPLOYEE as its
identifying entity type via the identifying relationship
type DEPENDENT_OF
Weak Entity Type is: DEPENDENT
Identifying Relationship is: DEPENDENTS_OF
Constraints on Relationships
r1
e1 d1
e2 r2
e3 r3 d2
e4 r4
e5 d3
r5
e6
r6
e7
r7
Many-to-many (M:N) RELATIONSHIP
r9
r1
e1 p1
e2 r2
e3 r3 p2
e4 r4
e5 p3
r5
e6
r6
e7
r 8 r7
The (min,max) notation relationship
constraints
(0,1) (1,1)
(1,1) (1,N)
Relationships of Higher
Degree