CH 5- Data Modeling with the Entity Relationship Modell Flashcards

1
Q

data model

A
  • plan or blueprint for a database design.
  • > is more generalized and abstract than a database design.

• It is easier to change a data model then it is to change
a database design, so it is the appropriate place to work through conceptual database problems

Data Model = Conceptual Design

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

Design stages

A

1) Conceptual design (conceptual schema)
2) Logical design (logical schema)
3) Physical design (physical schema)

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

Entity-Relationship (E-R) model

A

-set of concepts and graphical symbols that can be used to create conceptual schemas.

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

Entities

A

-Something that can be readily identified and that users want to track

a) Entity class—a collection of entities of a given type
b) Entity instance—the occurrence of a particular entity

• There are usually many instances of an entity in an entity class.

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

Attributes

A
  • describe an entity’s characteristics
  • All entity instances of a given entity class have the same attributes, but vary in the values of those attributes.
  • They were originally shown in data models as ellipses.
  • Data modeling products today commonly show attributes in rectangular form.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Identifiers

A
  • attributes that name, or identify entity instances.

* The identifier of an entity instance consists of one or more of the entity’s attributes.

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

Composite identifiers

A

-identifiers that consist of two or more attributes.

• Identifiers in data models become keys in database designs.
– Entities have identifiers.
– Tables (or relations) have keys.

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

relationships

A

-relationship class can involve two or more entity classes.

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

degree of relationship

A

-Number of entity classes in the relationship

a) binary relationship= two entities (degree 2)
b) Ternary relationship= three entities (degree 3)

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

Cardinality

A
  • means “count,” and is expressed as a number
    a) Maximum cardinality= is the maximum number of relationship instances in which an entity can participate.
    b) Minimum cardinality= is the minimum number of relationship instances in which an entity must participate.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Types of maximum cardinality

A

– One-to-One [1:1]
– One-to-Many [1:N]
– Many-to-Many [N:M]

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

one-to-many

Parent and Child Entities

A

– The entity on the one side of the relationship is called
the parent entity or just the parent.

– The entity on the many side of the relationship is
called the child entity or just the child.

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

Minimum cardinality

A

• Minimums are generally stated as either zero or one:
– IF zero [0] THEN participation in the relationship by the entity is optional, and no entity instance must
participate in the relationship.

– IF one [1] THEN participation in the relationship by the
entity is mandatory, and at least one entity instance must participate in the relationship.

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

Strong Entity

A

-an entity that represents something that can exist on its own.
Examples (PERSON, AUTOMOBILE, BUILDING)

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

Weak Entity

A

-an entity whose existence depends on
the presence of another entity.

Example (APARTMENT – depends on BUILDING)

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

ID-dependent entity (a weak entity)

A

-an entity (child) whose identifier includes the identifier of another entity (parent).

• The ID-dependent entity is a logical extension or subunit of the parent:
– BUILDING : APARTMENT
– PAINTING : PRINT

• The minimum cardinality from the ID-dependent entity to the parent is always one.

17
Q

identifying relationship

A

-The solid line connecting an ID-dependent entity and its parent

18
Q

non-ID-dependent weak entities

A

-The identifier of the parent does not appear in the

identifier of the weak child entity

19
Q

nonidentifying relationship

A

The dashed line connecting strong

entities or a non-ID dependent weak entity to its parent

20
Q

subtype entity

A

-a special case of a supertype entity

  • The supertype contains all common attributes, while the subtypes contain specific attributes.
  • The supertype may have a discriminator attribute which indicates the subtype.
21
Q

Exclusive subtype

A

-one supertype relates to at

most one subtype

22
Q

Inclusive subtype

A

one supertype can relate to one or more subtypes

23
Q

Subtypes: IS-A Relationships

A
  • Relationships connecting supertypes and subtypes are called because a subtype is a supertype.
  • The identifier of the supertype and all of its subtypes must be identical
  • Subtypes are used to avoid value-inappropriate nulls.
24
Q

Strong Entity Relationship Types

A

– 1:1 Strong Entity Relationship
– 1:N Strong Entity Relationship
– N:M Strong Entity Relationship

25
Q

recursive relationship

A

when an entity type has a relationship to itself:
– 1:1 Recursive Relationships
– 1:N Recursive Relationships
– N:M Recursive Relationships