chapter2 er

44
Chapter 2 E-R Diagrams

Upload: michael-wilson

Post on 12-Jan-2016

235 views

Category:

Documents


3 download

DESCRIPTION

Database Chapter 2

TRANSCRIPT

Page 1: Chapter2 ER

Chapter 2

E-R Diagrams

Page 2: Chapter2 ER

Sample E-R Diagram (figure 3-1)

Page 3: Chapter2 ER

Figure 3-2 -- Basic E-R Notation

Entity symbols

Relationship symbols

Attribute symbols

A special entity that is also a relationship

Page 4: Chapter2 ER

What Should an Entity Be?• SHOULD BE:

– An object that will have many instances in the database

– An object that will be composed of multiple attributes

– An object that we are trying to model

• SHOULD NOT BE:– A user of the database system – An output of the database system (e.g. a report)

Page 5: Chapter2 ER

Attributes

• Attribute - property or characteristic of an entity type

• Classifications of attributes:– Simple versus Composite Attribute– Single-Valued versus Multivalued Attribute– Stored versus Derived Attributes– Identifier Attributes

Page 6: Chapter2 ER

Degree of Relationships

• Degree of a Relationship is the number of entity types that participate in it–Unary Relationship–Binary Relationship–Ternary Relationship

Page 7: Chapter2 ER

Degree of relationships – from figure 3-2

One entity related to another of the same entity type

Entities of two different types related to each other

Entities of three different types related to each other

Page 8: Chapter2 ER

Cardinality of Relationships

• One – to – One– Each entity in the relationship will have exactly one

related entity

• One – to – Many– An entity on one side of the relationship can have many

related entities, but an entity on the other side will have a maximum of one related entity

• Many – to – Many– Entities on both sides of the relationship can have many

related entities on the other side

Page 9: Chapter2 ER

Cardinality Constraints

• Cardinality Constraints - the number of instances of one entity that can or must be associated with each instance of another entity.

• Minimum Cardinality– If zero, then optional– If one or more, then mandatory

• Maximum Cardinality– The maximum number

Page 10: Chapter2 ER

Cardinality – figure 3-2

Page 11: Chapter2 ER

Unary relationships -- figure 3-12a

Page 12: Chapter2 ER

Binary relationships – figure 3-12b

Page 13: Chapter2 ER

Ternary relationships –figure 3-12c

Note: a relationship can have attributes of its own

Page 14: Chapter2 ER

Basic relationship with only maximum cardinalities showing – figure 3-16a

Mandatory minimum cardinalities – figure 3-17a

Page 15: Chapter2 ER

Figure 3-17cOptional cardinalities with unary degree, one-to-one relationship

Page 16: Chapter2 ER

Figure 3-10a Relationship type

3-10b Entity and Relationship instances

Page 17: Chapter2 ER

Figure 3-11a A binary relationship with an attribute

Here, the date completed attribute pertains specifically to the employee’s completion of a course…it is an attribute of the relationship

Page 18: Chapter2 ER

Representing a bill-of -materials structure

Figure 3-13a A unary relationship with an attribute. This has a many-to-many relationship

Page 19: Chapter2 ER

Examples of multiple relationships – entities can be related to one another in more than one way

Figure 3-21a Employees and departments

Page 20: Chapter2 ER

Strong vs. Weak Entities, andIdentifying Relationships

• Strong entities – exist independently of other types of entities– has its own unique identifier– represented with single-line rectangle

• Weak entity– dependent on a strong entity…cannot exist on its own– Does not have a unique identifier– represented with double-line rectangle

• Identifying relationship– links strong entities to weak entities– represented with double line diamond

Page 21: Chapter2 ER

Figure 3-5: Strong and weak entities

Strong entity Weak entityIdentifying relationship

Page 22: Chapter2 ER

Relation

• Definition: A relation is a named, two-dimensional table of data– Table is made up of rows (records), and columns (attribute or field)

• Not all tables qualify as relations

• Requirements:– Every relation has a unique name.– Every attribute value is atomic (not multivalued, not composite)– Every row is unique (can’t have two rows with exactly the same values for all

their fields)– Attributes (columns) in tables have unique names– The order of the columns is irrelevant– The order of the rows is irrelevant

NOTE: all relations are in 1st Normal form

Page 23: Chapter2 ER

Correspondence with ER 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 same the word relationship (in ER model)

Page 24: Chapter2 ER

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 Ch. 6)

Page 25: Chapter2 ER

Figure 5-3 -- Schema for four relations (Pine Valley Furniture)

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)

Page 26: Chapter2 ER

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

Page 27: Chapter2 ER

Integrity Constraints

• Referential Integrity – rule that 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

Page 28: Chapter2 ER

Figure 5-5: Referential integrity constraints (Pine Valley Furniture)

Referential integrity

constraints are drawn via arrows from dependent to

parent table

Page 29: Chapter2 ER

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. Multi-valued Attribute - Becomes a separate relation with a foreign key taken from the superior entity

Page 30: Chapter2 ER

(a) CUSTOMER entity type with simple attributes

Figure 5-8: Mapping a regular entity

(b) CUSTOMER relation

Page 31: Chapter2 ER

Transforming EER Diagrams into Relations

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)

Page 32: Chapter2 ER

Figure 5-11: Example of mapping a weak entity

(a) Weak entity DEPENDENT

Page 33: Chapter2 ER

Figure 5-11(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

Page 34: Chapter2 ER

Transforming EER Diagrams into Relations

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 relationnew 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 on the optional side

Page 35: Chapter2 ER

Figure 5-12: Example of mapping a 1:M relationship

(a) Relationship between customers and orders

Note the mandatory one

Page 36: Chapter2 ER

Figure 5-12(b) Mapping the relationship

Again, no null value in the foreign key…this is because of the mandatory minimum cardinality

Foreign key

Page 37: Chapter2 ER

Figure 5-13: Example of mapping an M:N relationship

(a) ER diagram (M:N)

The Supplies relationship will need to become a separate relation

Page 38: Chapter2 ER

Figure 5-13(b) Three resulting relations

New intersection

relationForeign key

Foreign key

Composite primary key

Page 39: Chapter2 ER

Figure 5-14: Mapping a binary 1:1 relationship

(a) Binary 1:1 relationship

Page 40: Chapter2 ER

Figure 5-14(b) Resulting relations

Page 41: Chapter2 ER

Figure 5-15(b) Three resulting relations

Page 42: Chapter2 ER

Transforming EER Diagrams into Relations

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

Page 43: Chapter2 ER

Figure 5-17: Mapping a unary 1:N relationship

(a) EMPLOYEE entity with Manages relationship

(b) EMPLOYEE relation with recursive foreign key

Page 44: Chapter2 ER

Figure 5-18: Mapping a unary M:N relationship

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

(b) ITEM and COMPONENT relations