Scribd
Upload
81 views

Mapping Logical Data Model To Relational Schema (Physical Data Model)

This document discusses how to map a logical data model represented using an entity-relationship (ER) diagram to a physical data model represented using relational tables. It describes the key components of relations like primary keys, foreign keys, and integrity constraints. It then provides examples of how different types of entities, attributes, and relationships from an ER diagram like regular entities, weak entities, binary relationships, and associative entities can be mapped to corresponding tables and relationships between tables in a relational schema.

Uploaded by

Avinash Dilip
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views

Mapping Logical Data Model To Relational Schema (Physical Data Model)

This document discusses how to map a logical data model represented using an entity-relationship (ER) diagram to a physical data model represented using relational tables. It describes the key components of relations like primary keys, foreign keys, and integrity constraints. It then provides examples of how different types of entities, attributes, and relationships from an ER diagram like regular entities, weak entities, binary relationships, and associative entities can be mapped to corresponding tables and relationships between tables in a relational schema.

Uploaded by

Avinash Dilip
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 31

Mapping Logical Data Model to

Relational Schema (Physical Data


Model)

By
H.Seegobin
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
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 as the word relationship (in ER
model)
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
Figure 4-1 -- Schema for four relations (TFP)

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)
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
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
Figure 4-2:
Referential integrity constraints (TFP)

Referential
integrity
constraints are
drawn via arrows
from dependent to
parent table
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
Figure 4-3: Mapping a regular entity

(a) CUSTOMER
entity type with
simple
attributes

(b) CUSTOMER relation


Figure 4-4: Mapping a composite attribute

(a) CUSTOMER
entity type with
composite
attribute

(b) CUSTOMER relation with address detail


Figure 4-5: Mapping a multi-valued attribute
(a)

Multivalued attribute becomes a separate relation with foreign key


(b)

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


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)
Figure 4-6: Example of mapping a weak entity

(a) Weak entity DEPENDENT


Figure 4-6(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


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 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
Figure 4-7: Example of mapping a 1:M relationship

(a) Relationship between customers and orders

Note the mandatory one


Figure 4-7(b) Mapping the relationship

Again, no null value in the


foreign key…this is because
of the mandatory minimum
cardinality

Foreign key
Figure 4-8: Example of mapping an M:N relationship
(a) ER diagram (M:N)

The Supplies relationship will need to become a separate relation


Figure 4-8(b) Three resulting relations

Composite primary key

New
Foreign key intersection
relation
Foreign key
Figure 4-9: Mapping a binary 1:1 relationship

(a) Binary 1:1 relationship


Figure 4-9(b) Resulting relations
Transforming EER Diagrams into
Relations
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
Figure 4-10: Mapping an associative entity
(a) Associative entity
Figure 4-10(b) Three resulting relations
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
Figure 4-11: Mapping a unary 1:N relationship

(a) EMPLOYEE entity with


Manages relationship

(b) EMPLOYEE
relation with
recursive foreign
key
Figure 4-12: Mapping a unary M:N relationship

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

(b) ITEM and


COMPONENT
relations
Transforming EER Diagrams into
Relations
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 relationship
Figure 4-13: Mapping a ternary relationship
(a) Ternary relationship with associative entity
Figure 4-13(b) Mapping the ternary relationship

Remember that the


primary key MUST be
unique

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy