Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Data Architecture > Database Design > Flashcards

Database Design Flashcards

Entities, relationships, and attributes. Cardinality. Strong and weak entities. Supertype and Subtypes. Modeling Conventions.

1
Q

Entity-Relationship Model

A

High-level representation of data requirements, ignoring implementation details

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

Entity

A

Person, place, product, concept or activity

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

Relationship

A

Statement about two entities

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

Attribute

A

Descriptive property of an entity

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

Reflexive relationship

A

Relates to an entity itself

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

entity-relationship diagram, ER Diagram

A

schematic picture of entities, relationships, and attributes

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

Glossary/Data Dictionary/Repository

A

Documents additional detail in text format

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

Entity Type

A

a set of things Ex: All employees in a company.

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

Relationship Type

A

Is a set of related things (Employee-Manages-Department is a set of (employee, department) pairs, where the employee manages the department

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

Attribute Type

A

Set of values Ex: All employee salaries

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

Entity Instance

A

individual thing Ex: The employee Sam Snead

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

Relationship Instance

A

Statement about an entity instance Ex: “Maria Rodriguez manages Sales”

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

Attribute Instance

A

An individual value Ex: The Salary $35,000

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

Analysis

A

Develops an entity-relationship model, capturing data requirements while ignoring implementation details

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

Logical Design

A

Converts the entity-relationship model into tables, columns, and keys for a particular database system.

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

Physical design

A

Adds indexes and specifies how tables are organized on storage media

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

Cardinality

A

Refers to the maxima and minima of relationships and attributes

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

Relationship Maximum

A

Greatest number of instances of one entity that can relate to a single instance of another entity

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

Singular/Plural

A

Single when the maximum is one and plural when the maximum is many

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

Relationship Minimum

A

Least number of instances of one entity that can relate to a single instance of another entity

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

Optional/REquired

A

Optional when the minimum is zero and required when the minimum is one.

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

Attribute Maximum

A

Greatest number of attribute values that can describe each entity instance. Attribute maximum is usually specified as one singular or many plural

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

Attribute Minimum

A

last number of attribute values that can describe each entity instance. Attribute minimum is usually specified as zero or one required.

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

Unique Attribute

A

Describes at most one entity instance

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

Identifying attribute

A

unique, singular, and required

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

Identify

A

Values correspond to one-to-one to, or identify, entity instances.

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

strong entity

A

Has one or more identifying atytributes

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

Weak Entity/Identifying Relationship/Identifying entity

A

Weak entity usually has a relationship, called an identifying relationship, to another entity, called an identifying entity. Cardinality of the ID entity is 1(1)

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

Subtype Entity/Supertype Entity

A

Subtype entity is a subset of another entity type, called the supertype entity

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

IsA Relationship

A

A Super type entity identifies its subtype entities. The identifying relationship is called an IsA relationship

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

Similar Entities

A

Entities that have many common attributes and relationships

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

Partition

A

Supertype entity is a group of mutually exclusive subtype entities

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

Partition Attribute

A

Corresponds to an optional partition attribute of the super type entity

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

Crow’s Foot Notation

A

Depicts cardinality as a Circle(zero), a short line (one) or three short lines(many)

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

Subject Area

A

Decompose a complex model into a group of related entities, called a subject area

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

Independent/Dependent

A

Refers to strong entities as independent and weak entities as dependent

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

Unified Modeling Language/UML

A

Commonly used for software development. Software data structures are similar to database scructures, so UML includes ER conventions

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

IDEF1X

A

Information DEFinition Version 1x

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

Chen Notation

A

Chen notation is not standardized but often appears in literature and tools

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

Strong Table

A

Strong Entity becomes a strong table. Primary key must be unique and non-NULL, and should be stable, simple, and meaningless. Single-column primary keys are best. but if no such columns exists, a composite primary key may have the required properties.

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

Artificial Key

A

Single-Column primary key created by the database designer when no suitable single-column or composite primary key exists

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

Subtype Table

A

Subtype entity becomes a subtype table

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

Weak Table

A

Weak entity becomes a weak table

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

Depends on

A

Column A depends on Column B means each B value is related to at most one A value

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

Functional Dependence

A

Dependence of one column on another

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

Multivalued dependence/Join Dependence

A

Entail dependencies between three or more columns

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

Redundancy

A

Reptition of related values in a table

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

Normal forms

A

Rules for designing tables with less redundancy

49
Q

First normal form

A

Every cell of a table contains exactly one value. The table has a primary key as well.

50
Q

Second Normal Form

A

When all non-key columns depend on the whole primary key

51
Q

Third Normal Form

A

When all non-key columns depend on the key, the whole key, and nothing but the key.

52
Q

Candidate Key/Minimal

A

Simple or composite column that is unique and minimal. Minimal means all columns are necessary for uniqueness

53
Q

Nonkey

A

Column that is not contained in a candidate key

54
Q

Third normal form

A

Whenever a non-key column A depends on column B, then B is unique. Columns A and B may be simple or composite

55
Q

Boyce-Codd Normal Form

A

Whenever column A depends on Column b, then B is unique. Columns A and B may be simple or composite

56
Q

Normalization

A

Eliminates redundancy by decomposing a table into two or mote tables in higher normal form.

57
Q

Depends On

A

Column A depends on column when each b value is related to at most one A value. A and B may be simple or composite columns

58
Q

Boyce-Codd Normal Form

A

If Column A depends on column B, then B must be unique

59
Q

Denormalization

A

Intentionally introducing redundancy by merging tables

60
Q

High-level representation of data requirements, ignoring implementation details

A

Entity-Relationship Model

61
Q

Person, place, product, concept or activity

A

Entity

62
Q

Statement about two entities

A

Relationship

63
Q

Descriptive property of an entity

A

Attribute

64
Q

Relates to an entity itself

A

Reflexive relationship

65
Q

schematic picture of entities, relationships, and attributes

A

entity-relationship diagram, ER Diagram

66
Q

Documents additional detail in text format

A

Glossary/Data Dictionary/Repository

67
Q

a set of things Ex: All employees in a company.

A

Entity Type

68
Q

Is a set of related things (Employee-Manages-Department is a set of (employee, department) pairs, where the employee manages the department

A

Relationship Type

69
Q

Set of values Ex: All employee salaries

A

Attribute Type

70
Q

individual thing Ex: The employee Sam Snead

A

Entity Instance

71
Q

Statement about an entity instance Ex: “Maria Rodriguez manages Sales”

A

Relationship Instance

72
Q

An individual value Ex: The Salary $35,000

A

Attribute Instance

73
Q

Develops an entity-relationship model, capturing data requirements while ignoring implementation details

A

Analysis

74
Q

Converts the entity-relationship model into tables, columns, and keys for a particular database system.

A

Logical Design

75
Q

Adds indexes and specifies how tables are organized on storage media

A

Physical design

76
Q

Refers to the maxima and minima of relationships and attributes

A

Cardinality

77
Q

Greatest number of instances of one entity that can relate to a single instance of another entity

A

Relationship Maximum

78
Q

Single when the maximum is one and plural when the maximum is many

A

Singular/Plural

79
Q

Least number of instances of one entity that can relate to a single instance of another entity

A

Relationship Minimum

80
Q

Optional when the minimum is zero and required when the minimum is one.

A

Optional/REquired

81
Q

Greatest number of attribute values that can describe each entity instance. Attribute maximum is usually specified as one singular or many plural

A

Attribute Maximum

82
Q

last number of attribute values that can describe each entity instance. Attribute minimum is usually specified as zero or one required.

A

Attribute Minimum

83
Q

Describes at most one entity instance

A

Unique Attribute

84
Q

unique, singular, and required

A

Identifying attribute

85
Q

Values correspond to one-to-one to, or identify, entity instances.

A

Identify

86
Q

Has one or more identifying atytributes

A

strong entity

87
Q

Weak entity usually has a relationship, called an identifying relationship, to another entity, called an identifying entity. Cardinality of the ID entity is 1(1)

A

Weak Entity/Identifying Relationship/Identifying entity

88
Q

Subtype entity is a subset of another entity type, called the supertype entity

A

Subtype Entity/Supertype Entity

89
Q

A Super type entity identifies its subtype entities. The identifying relationship is called an IsA relationship

A

IsA Relationship

90
Q

Entities that have many common attributes and relationships

A

Similar Entities

91
Q

Supertype entity is a group of mutually exclusive subtype entities

A

Partition

92
Q

Corresponds to an optional partition attribute of the super type entity

A

Partition Attribute

93
Q

Depicts cardinality as a Circle(zero), a short line (one) or three short lines(many)

A

Crow’s Foot Notation

94
Q

Decompose a complex model into a group of related entities, called a subject area

A

Subject Area

95
Q

Refers to strong entities as independent and weak entities as dependent

A

Independent/Dependent

96
Q

Commonly used for software development. Software data structures are similar to database scructures, so UML includes ER conventions

A

Unified Modeling Language/UML

97
Q

Information DEFinition Version 1x

A

IDEF1X

98
Q

Chen notation is not standardized but often appears in literature and tools

A

Chen Notation

99
Q

Strong Entity becomes a strong table. Primary key must be unique and non-NULL, and should be stable, simple, and meaningless. Single-column primary keys are best. but if no such columns exists, a composite primary key may have the required properties.

A

Strong Table

100
Q

Single-Column primary key created by the database designer when no suitable single-column or composite primary key exists

A

Artificial Key

101
Q

Subtype entity becomes a subtype table

A

Subtype Table

102
Q

Weak entity becomes a weak table

A

Weak Table

103
Q

Column A depends on Column B means each B value is related to at most one A value

A

Depends on

104
Q

Dependence of one column on another

A

Functional Dependence

105
Q

Entail dependencies between three or more columns

A

Multivalued dependence/Join Dependence

106
Q

Reptition of related values in a table

A

Redundancy

107
Q

Rules for designing tables with less redundancy

A

Normal forms

108
Q

Every cell of a table contains exactly one value. The table has a primary key as well.

A

First normal form

109
Q

When all non-key columns depend on the whole primary key

A

Second Normal Form

110
Q

When all non-key columns depend on the key, the whole key, and nothing but the key.

A

Third Normal Form

111
Q

Simple or composite column that is unique and minimal. Minimal means all columns are necessary for uniqueness

A

Candidate Key/Minimal

112
Q

Column that is not contained in a candidate key

A

Nonkey

113
Q

Whenever a non-key column A depends on column B, then B is unique. Columns A and B may be simple or composite

A

Third normal form

114
Q

Whenever column A depends on Column b, then B is unique. Columns A and B may be simple or composite

A

Boyce-Codd Normal Form

115
Q

Eliminates redundancy by decomposing a table into two or mote tables in higher normal form.

A

Normalization

116
Q

Column A depends on column when each b value is related to at most one A value. A and B may be simple or composite columns

A

Depends On

117
Q

If Column A depends on column B, then B must be unique

A

Boyce-Codd Normal Form

118
Q

Intentionally introducing redundancy by merging tables

A

Denormalization

Data Architecture (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions