3.1 The ER MODEL Flashcards

1
Q

is a conceptual model that represents the information structure of a problem domain in terms of entities and relationships.

A

entity-relationship model (ERM)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Who developed ERM

A

Dr. Peter Pin-Shan Chen

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

When was the ERM developed

A

1976

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

is a type of structural diagram for use in database design.

A

Entity Relationship Diagram (ERD)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are the 3 basic elements of ERD

A

Entity
Attributes
Relationship

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

is a person, place, object, event, or concept about which the organization wishes to maintain data.

A

entity type

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

represents a collection of all entities that share common properties or characteristics. The entity type is described once in the database using meta

A

entity type

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

is a single occurrence of an entity type. For example; Mary, John, and Tom are 3 instances of the EMPLOYEE entity type.

A

entity instance

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

are the properties or characteristics of an entity. Each entity type has a set of attributes associated with it.

A

Attributes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

association among one or more entities

A

relationship

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

is a meaningful association between or among entity types.

A

Relationship Type

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

is the association between specific entity instances.

A

Relationship Instance

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

was introduced by Peter Chen, who developed entity-relationship modeling and published his work in 1976. This notation was one of the pioneers in software and information system modeling and design.

A

Chen Notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

is used in Barker’s Notation, SSADM and Information Engineering. Crow’s Foot diagrams represent entities as boxes and relationships as lines between the boxes. Different shapes at the ends of these lines represent the cardinality of the relationship. Many preferred to use Crow’s Foot notation due to its simplicity.

A

Crow’s Feet Notation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Name the 3 types of entities

A

Entity / Strong Entity, Weak Entity, Associative Entity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

This is an attribute that uniquely identifies a particular entity. The name of a key attribute is underlined in Chen Notation. In Crow’s Foot Notation, key attributes are also underlined. Aside from underline, it is also indicated with PF or FK depending on, if the key attribute is a primary key or foreign key (to be discussed in the succeeding module).

A

Key Attribute

17
Q

This is an attribute of the weak entity that when combined with the key attribute of the parent entity, provides a unique identification for the weak entity. Chen notation underlines the discriminator with a dashed line. In Crow’s Foot Notation, the key attribute of the weak entity became composite, constituting the key attributes of the parent’s and the child’s.

A

Partial Key Attribute (discriminator)

18
Q

An attribute that can have many actual values. For instance, a person may have several college degrees, or a household may have several different phones, each with its own number.

A

Multivalued Attribute

19
Q

This is an attribute whose value is calculated (derived) from other attributes. The derived attribute may or may not be physically stored in the database. In the Chen notation, this attribute is represented by a dashed oval.

A

Derived Attribute (or computed attribute)

20
Q

An attribute that can be further subdivided into smaller parts.

A

Composite Attribute

21
Q

his is a relationship where the entity is strong and independent of other entities, and the Primary Key (PK) of child entry does not contain the PK component of the parent entity.

A

Strong Relationship

22
Q

A relationship where child entity is existence-dependent on the parent entity, and PK of Child Entity contains PK component of Parent Entity. This relationship is represented by a double rhombus.

A

Weak Relationship / Identifying Relationship

23
Q

A _______ of a Relationship is the number of relationship instances an entity can participate

A

Cardinality of Relationship

24
Q

Each entity instance in one side of the relationship will have exactly one related entity instance on the other side of the relationship

A

One–to–One Relationship

25
Q

A maximum of one entity instance on one side of the relationship can have more than one related entity instances on the other side of the relationship.

A

One–to–Many Relationship

26
Q

More than one entity instances on one side of the relationship can have a maximum of one entity instance on the other side of the relationship

A

Many-to-One Relationship

27
Q

Entities on both sides of the relationship can have more than one related entity on the other side of the relationship.

A

Many–to–Many Relationship

27
Q

Entities on both sides of the relationship can have more than one related entity on the other side of the relationship.

A

Many–to–Many Relationship

28
Q

one entity occurrence does not require a corresponding entity occurrence in a particular relationship

A

Optional Participation

29
Q

one entity occurrence requires a corresponding entity occurrence in a particular relationship

A

Mandatory Participation

30
Q

state the limits of the number of entity occurrences/participations that are associated in a relationship.

A

Cardinality Constraints

31
Q

If zero, then relationship participation is optional
If one or more, then relationship participation is mandatory

A

Minimum Cardinality

32
Q

The maximum number of participations of entity instances in a relationship.

A

Maximum Cardinality

33
Q

is the number of entity types that participated in the relationship.

A

Degree of Relationship

34
Q

are also known as a recursive relationship. It is a relationship where the same entity participates more than once in different roles.

A

Unary relationships

35
Q

exists when two entities are associated in a relationship

A

Binary Relationship

36
Q

Although most relationships are binary, the use of__________ relationships does allow the designer some latitude regarding the semantics of a problem

A

Ternary Relationship