Lecture 4 DB

Lecture 4
Saqib Hussain
Transforming a Data Model into a

Relational Design
5-2
Representing Weak Entities

If not ID-dependent, use the same
techniques as for strong entities
If ID-dependent, then must add primary
key of the parent entity
5-3
Representing Entities with the

Relational Model
Create a relation for each entity
A relation has a descriptive name and a set of attributes that
describe the entity
Specify a primary key

Specify column properties
Data type
Null status
Default values (if any)
Data constraints (if any)
The relation is then analyzed using the normalization rules

As normalization issues arise, the initial relation design
may need to change
5-4
Representing Weak Entities Example
5-5
Representing Relationships
1:1 Relationships
The maximum cardinality determines how
a relationship is represented
1:1 relationship
The key from one relation is placed in the
other as a foreign key
It does not matter which table receives the
foreign key but better to see participations
constraints.
5-6
Binary 1:1 Relationships
The process of mapping such a relationship onto relation schemas requires

two steps.
1.
Two relations are created, one for each of the participating entity types.
2.
The primary key of one of the relations is included as a foreign key in the other
relation.
In a 1:1 relationship, the association in one direction is nearly always an

optional one, while the association in the other direction is mandatory (recall
participation constraints).
You should include in the relation on the optional side of the relationship the foreign
key of the entity type that has the mandatory participation in the 1:1 relationship.
This approach will avoid the need to store null values in the foreign key attribute.
Any attributes associated with the relationship itself are also included in the
same relation as the foreign key.
Binary 1:1 - EXAMPLE
The value of this

attribute cannot be
null.
1:1 Relationship Example
5-9
1:N Relationships
Like a 1:1 relationship, a 1:N relationship
is saved by placing the key from one table
into another as a foreign key
However, in a 1:N the foreign key always
goes into the many-side of the relationship
The 1 side is called the parent
The N side is called the child
5-10
1:N Relationship Example
5-11
Binary 1:M - EXAMPLE

ERD
N:M Relationships
To create an N:M relationship, a new
table is created. This table is called
an intersection table
An intersection table has a composite
key consisting of the keys from each
of the tables that it connects
5-13
N:M Relationship Data Model
5-14
N:M Relationship Database Design
5-15
Association Relationships
When an intersection table has columns beyond
those in the primary key, the relationship is
called an association relationship
5-16
Recursive Relationships
A recursive relationship is a relationship that a
relation has with itself.
Recursive relationships adhere to the same
rules as the binary relationships.
1:1 and 1:M relationships are saved using foreign
keys
M:N relationships are saved by creating an
intersecting relation
5-17
Recursive Relationships Examples
5-18
Mapping Recursive Relationships 1:M Case
The entity type in the unary relationship is mapped onto

a relation schema using the procedure described in Step
1.
Next, a foreign key attribute is added within the same

relation that references the primary key values (this
foreign key must have the same domain as the primary
key).
A recursive foreign key is a foreign key in a relation that

references the primary key values of that same relation.
Mapping Recursive Relationships: EXAMPLE 1:M

every employee has
exactly one manager, a
given employee may
manage many
employees
foreign key
Mapping Recursive Relationships M:N Case
With this type of recursive relationship, two relation schemas are

created: one to represent the entity type and the other an associative
relation to represent the M:N relationship itself.
The primary key of the associative relation consists of two attributes.

These attributes (which do not necessarily have the same name) both
take their values from the primary keys of the other relation.
Any non-key attribute of the relationship is included in the associative

relation.
The example on the next page illustrates such a case representing a bill
of materials relationship among items that are assembled from other
items or components.
Mapping Recursive Relationships: EXAMPLE M:N
Mapping E-R Diagrams

Composite Attributes:
When a regular entity type has a composite attribute,

only the simple component attributes of the composite
attribute are included in the new relation schema.
ERD
Note that the composite attribute

has disappeared replaced by
its components.
Customer Relation

Multi-valued Attributes:
When a regular entity type contains a multi-valued

attribute, two new relation / tables(rather than one) are
created.
The first table contains all of the attributes of the entity

type except the multi-valued attribute. The second
relation/table contains two attributes that form the
primary key of the second relation/table. The first of
these attributes is the primary key of the first
relation/table, which becomes a foreign key in the
second relation.
The second is the multi-valued
attribute.

Multi-valued Attributes Example:
Arrow represents a referential
integrity constraint. In table
employee-skill the attribute
employee-id is a foreign key,
i.e., it is a primary key in
another table. The arrow links
the attribute to the table
where it is the primary key.
ERD

Multi-valued Attributes:
Notice in the previous relational tables constructed

due to the multi-valued attribute skill, that the
resulting relation employee-skill has only key
attributes.
Each tuple simply records the fact that a given

employee possesses a certain skill.
This provides the database designer the

opportunity to suggest to the users that new
attributes can be added to this relation.
For example, the attributes years-experience and/or

certification-date might be appropriate new values to
add to this relation.
CASE Tools Use
Mapping the E-R diagrams to relations is a relatively

straightforward process with a well-defined set of rules. In
fact many CASE tools (Computer Aided Software Engineering
tools) can automatically perform many of the conversion
steps. However, it is important that you understand the steps
in this process for three reasons:
1.
CASE tools often cannot model more complex data relationships

such as ternary relationships and superclass/subclass
relationships. These steps will need to be done manually.
2.
There are some legitimate alternatives where you must manually

chose an alternative.
3.
You need to be prepared to perform a quality check on the

results obtained with the CASE tool.

Lecture 4 DB

Uploaded by

Copyright:

Available Formats

Lecture 4 DB

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lecture 4 DB

Uploaded by

Copyright:

Available Formats

Lecture 4

Transforming a Data Model into a

Representing Weak Entities

Representing Entities with the

Specify a primary key

The relation is then analyzed using the normalization rules

Representing Weak Entities Example

Binary 1:1 Relationships

The process of mapping such a relationship onto relation schemas requires

In a 1:1 relationship, the association in one direction is nearly always an

Binary 1:1 - EXAMPLE

The value of this

1:1 Relationship Example

1:N Relationship Example

Binary 1:M - EXAMPLE

Mapping Recursive Relationships 1:M Case

The entity type in the unary relationship is mapped onto

Next, a foreign key attribute is added within the same

A recursive foreign key is a foreign key in a relation that

Mapping Recursive Relationships: EXAMPLE 1:M

Mapping Recursive Relationships M:N Case

With this type of recursive relationship, two relation schemas are

The primary key of the associative relation consists of two attributes.

Any non-key attribute of the relationship is included in the associative

Mapping Recursive Relationships: EXAMPLE M:N

Mapping E-R Diagrams

When a regular entity type has a composite attribute,

Note that the composite attribute

Mapping E-R Diagrams

When a regular entity type contains a multi-valued

The first table contains all of the attributes of the entity

Mapping E-R Diagrams

Mapping E-R Diagrams

Notice in the previous relational tables constructed

Each tuple simply records the fact that a given

This provides the database designer the

For example, the attributes years-experience and/or

CASE Tools Use

Mapping the E-R diagrams to relations is a relatively

CASE tools often cannot model more complex data relationships

There are some legitimate alternatives where you must manually

You need to be prepared to perform a quality check on the

You might also like