Deck 6: Transforming Data Models Into Database Designs
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/103
Play
Full screen (f)
Deck 6: Transforming Data Models Into Database Designs
1
When creating a table in the relational database design from an entity in the extended E-R model,the attributes of the entity become the rows of the table.
False
2
The ideal primary key is short,numeric,and fixed.
True
3
A foreign key is a key that does not belong in any table.
False
4
A default value is the value the user enters into the row the first time the user enters data.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
5
The first step in the database design process is to create tables and columns from entities and attributes.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
6
The last step in creating a table is to verify table normalization.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
7
The values of a surrogate key have no meaning to the users.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
8
A surrogate key is appropriate when the primary key of a table contains a lengthy text field.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
9
A data constraint is a limitation on data values.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
10
By default,the identifier of the entity becomes the foreign key of the corresponding table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
11
A null value is an attribute value that has been set to zero.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
12
One of the important properties of an attribute is whether or not it is required.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
13
A surrogate key should be considered when the key contains a lengthy text field.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
14
A surrogate key is a unique,system-supplied identifier used as the primary key of a table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
15
When creating a relational database design from E-R diagrams,first create a relation for each relationship.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
16
An entity needs to be examined according to normalization criteria before creating a table from it in the relational database design.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
17
Whether or not an attribute is required is determined during the database modeling phase.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
18
One of the important properties of a column is whether or not it can have a NULL value.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
19
Each entity in the extended E-R model is represented as a table in the relational database design.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
20
Data types are consistent across all DBMS products.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
21
In a 1:N relationship,the term "parent" refers to the table on the "many" side of the relationship.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
22
In 1:N relationships,the table on the "many" side is called the child.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
23
To represent an M:N relationship in a relational database design,a table is created to represent the relationship itself.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
24
To represent a one-to-many relationship in a relational database design the key of the child table is placed as a foreign key into the other table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
25
In many-to-many relationships in a relational database design the primary keys of both tables are joined into a composite primary key in the intersection table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
26
To represent a 1:N relationship in a relational database design,an intersection table is created.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
27
In a relational database design,all relationships are expressed by creating a foreign key.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
28
In 1:N relationships,the table on the "one" side is called the parent.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
29
The key of an intersection table is always the combination of the keys of both parents.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
30
When the key of one table is placed into a second table to represent a relationship,the key is called a "relational key" in the second table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
31
To represent an M:N relationship in a relational database design,in essence it is reduced to two 1:N relationships.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
32
In representing a 1:N relationship in a relational database design,the key of the table representing the entity on the "many" side is placed as a foreign key in the table representing the entity on the "one" side of the relationship.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
33
To represent an M:N relationship in a relational database design,an intersection table is created.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
34
To represent a 1:1 binary relationship in a relational database design,the key of one table is placed into the second table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
35
In representing a 1:N relationship in a relational database design,the key of the table representing the parent entity is placed as a foreign key in the table representing the child entity.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
36
An intersection table can have additional attributes besides the keys of its parent tables.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
37
When placing a foreign key for a 1:1 relationship,the key of either table can be used as the foreign key in the other table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
38
Like all ID-dependent relationships,the parents of an association table are required.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
39
An intersection table is always ID-dependent on both of its parent tables.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
40
In a 1:1 relationship,the foreign key is defined as an alternate key to make the DBMS enforce uniqueness.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
41
Cascading deletions are generally not used with relationships for weak child entities.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
42
A referential integrity constraint policy that insures that all rows containing a particular foreign key value in a table are eliminated from the table when the row containing the corresponding primary key value in a parent table is eliminated from the database is called cascading deletes.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
43
An ID-dependent table can be used to represent multivalued attributes.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
44
Discriminator attributes can be represented in relational designs.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
45
Recursive M:N relationships are represented with an intersection table that shows pairs of related rows from a single table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
46
When creating a table for an ID-dependent entity,both the key of the parent and the key of the entity itself must appear in the table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
47
When transforming supertype/subtype entities into a relational database design,all of the attributes for the supertype table are placed into the subtype relations.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
48
Association tables sometimes connect more than two entities.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
49
When the parent entity is required (M)in a relationship,every row of the child table must have a valid,non-null value of the foreign key.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
50
All identifying relationships are 1:N.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
51
When transforming an extended E-R model into a relational database design,recursive relationships are treated fundamentally the same as other HAS-A relationships.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
52
To represent an IS-A relationship in a relational database design,the IS-A relationship must be converted into a HAS-A relationship.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
53
If the parent is required,then a new child row must be created with a valid foreign key value.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
54
When transforming supertype/subtype entities into a relational database design,the key of the supertype table is placed into the subtype table typically as the key.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
55
When transforming an ID-dependent E-R data model relationship into a relational database design and the child entity is designed to use a surrogate key,then the relationship changes to a weak but not ID-dependent relationship.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
56
A referential integrity constraint policy that insures that foreign key values in a table are correctly maintained when there is a change to the primary key value in the parent table is called cascading changes.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
57
When transforming supertype/subtype entities into a relational database design,an entity is created for the supertype only.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
58
The design transformation for all IS-A relationships can be summarized by the phrase "place the key of the parent table in the child table."
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
59
Referential integrity constraints should disallow adding a new row to a child table when the foreign key does not match a primary key value in the parent table.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
60
Cascading deletions are generally not used with relationships between strong entities.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
61
Which of the following is not a step in the database design process?
A)Create tables and columns from entities and attributes
B)Select primary keys
C)Represent relationships
D)Create constraints and triggers
E)All of the above are steps in the database design process.
A)Create tables and columns from entities and attributes
B)Select primary keys
C)Represent relationships
D)Create constraints and triggers
E)All of the above are steps in the database design process.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
62
When transforming an E-R data model into a relational database design,the key of the parent entity should be placed as part of the primary key into the child entity ________.
A)when the child entity is ID-dependent
B)when the child entity is non-ID-dependent
C)when the child entity has a 1:1 relationship with the parent entity
D)when the child entity has a 1:N relationship with the parent entity
E)when the child entity has a recursive relationship with the parent entity
A)when the child entity is ID-dependent
B)when the child entity is non-ID-dependent
C)when the child entity has a 1:1 relationship with the parent entity
D)when the child entity has a 1:N relationship with the parent entity
E)when the child entity has a recursive relationship with the parent entity
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
63
Which of the following is not true about surrogate keys?
A)They are identifiers that are supplied by the system,not the users.
B)They have no meaning to the users.
C)They are nonunique within a table.
D)They can be problematic when combining databases.
E)The DBMS will not allow their values to be changed.
A)They are identifiers that are supplied by the system,not the users.
B)They have no meaning to the users.
C)They are nonunique within a table.
D)They can be problematic when combining databases.
E)The DBMS will not allow their values to be changed.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
64
In many-to-many relationships in a relational database design ________.
A)the key of the child is placed as a foreign key into the parent
B)the key of the parent is placed as a foreign key into the child
C)the keys of both tables are placed in a third table
D)the keys of both tables are joined into a composite key
E)C and D
A)the key of the child is placed as a foreign key into the parent
B)the key of the parent is placed as a foreign key into the child
C)the keys of both tables are placed in a third table
D)the keys of both tables are joined into a composite key
E)C and D
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
65
Many-to-many relationships are represented by ________.
A)two tables with an M:N relationship
B)two tables with a 1:N relationship
C)an intersection table which has M:N relationships with the two tables
D)an intersection table which has 1:N relationships with the two tables
E)two intersection tables which each have 1:N relationships with the two tables
A)two tables with an M:N relationship
B)two tables with a 1:N relationship
C)an intersection table which has M:N relationships with the two tables
D)an intersection table which has 1:N relationships with the two tables
E)two intersection tables which each have 1:N relationships with the two tables
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
66
The identifier of the entity becomes the ________ of the corresponding table.
A)primary key
B)foreign key
C)supertype
D)subtype
E)either A or B
A)primary key
B)foreign key
C)supertype
D)subtype
E)either A or B
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
67
When representing a 1:1 relationship in a relational database design ________.
A)the key of each table must be placed as foreign keys into the other
B)the key of either table may be placed as a foreign key into the other
C)the key of both tables must be the same
D)the intersection table gets the key from both relations
E)B and C
A)the key of each table must be placed as foreign keys into the other
B)the key of either table may be placed as a foreign key into the other
C)the key of both tables must be the same
D)the intersection table gets the key from both relations
E)B and C
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
68
It is easy to enforce the referential integrity actions for M-M relationships.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
69
In a relational database design,all relationships are expressed by ________.
A)creating a primary key
B)creating a foreign key
C)creating a supertype
D)creating a subtype
E)creating a line between entities
A)creating a primary key
B)creating a foreign key
C)creating a supertype
D)creating a subtype
E)creating a line between entities
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
70
When representing a one-to-many relationship in a relational database design ________.
A)the parent is always on the one side of the "one-to-many" relationship
B)the child is always on the one side of the "one-to-many" relationship
C)either parent or child can be on the one side of the "one-to-many" relationship,and the choice is arbitrary
D)either parent or child can be on the one side of the "one-to-many" relationship,and special criteria indicate which table should be on the one side.
E)None of the above is correct.
A)the parent is always on the one side of the "one-to-many" relationship
B)the child is always on the one side of the "one-to-many" relationship
C)either parent or child can be on the one side of the "one-to-many" relationship,and the choice is arbitrary
D)either parent or child can be on the one side of the "one-to-many" relationship,and special criteria indicate which table should be on the one side.
E)None of the above is correct.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
71
In many-to-many relationships in a relational database design ________.
A)the intersection table is ID-dependent on one of the parents
B)the intersection table is ID-dependent on both of the parents
C)the minimum cardinality from the intersection table to the parents is always M
D)A and B
E)B and C
A)the intersection table is ID-dependent on one of the parents
B)the intersection table is ID-dependent on both of the parents
C)the minimum cardinality from the intersection table to the parents is always M
D)A and B
E)B and C
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
72
To represent a one-to-many relationship in a relational database design ________.
A)the key of the child is placed as a foreign key into the parent
B)the key of the parent is placed as a foreign key into the child
C)an intersection table must be created
D)the key of the table on the "many" side is placed in the table on the "one" side
E)the keys of both tables are joined into a composite key
A)the key of the child is placed as a foreign key into the parent
B)the key of the parent is placed as a foreign key into the child
C)an intersection table must be created
D)the key of the table on the "many" side is placed in the table on the "one" side
E)the keys of both tables are joined into a composite key
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
73
Each attribute of an entity becomes a(n)________ of a table.
A)column
B)primary key
C)foreign key
D)alternate key
E)B or D
A)column
B)primary key
C)foreign key
D)alternate key
E)B or D
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
74
A surrogate key should be considered when ________.
A)a relationship is M:N
B)a composite key is required
C)the key contains a lengthy text field
D)the key contains a number
E)an index needs to be created
A)a relationship is M:N
B)a composite key is required
C)the key contains a lengthy text field
D)the key contains a number
E)an index needs to be created
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
75
One of the important properties of a column is whether or not it is ________.
A)found in more than one entity
B)required
C)character or numeric
D)subject to normalization
E)subject to denormalization
A)found in more than one entity
B)required
C)character or numeric
D)subject to normalization
E)subject to denormalization
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
76
The ideal primary key is ________.
A)short
B)numeric
C)fixed
D)A and B
E)A,B and C
A)short
B)numeric
C)fixed
D)A and B
E)A,B and C
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
77
When the parent entity has a surrogate key,the enforcement actions are the same for both parent and child.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
78
The first step in transforming an extended E-R model into a relational database design is to ________.
A)create a table for each relationship
B)evaluate the entities against the normalization criteria
C)create a table for each entity
D)remove any recursive relationships
E)document referential integrity constraints
A)create a table for each relationship
B)evaluate the entities against the normalization criteria
C)create a table for each entity
D)remove any recursive relationships
E)document referential integrity constraints
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
79
When the child entity is required (M)in a relationship,there needs to be at least one child row for each parent row at all times.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck
80
In relational database design,ID-dependent entities are used to ________.
A)represent N:M relationships
B)handle associative relationships
C)handle multivalued attributes
D)handle archetype/instance relationships
E)All of the above.
A)represent N:M relationships
B)handle associative relationships
C)handle multivalued attributes
D)handle archetype/instance relationships
E)All of the above.
Unlock Deck
Unlock for access to all 103 flashcards in this deck.
Unlock Deck
k this deck