Deck 9: Designing Databases
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/100
Play
Full screen (f)
Deck 9: Designing Databases
1
In logical database modeling and design,we combine normalized data requirements from all user interfaces into one consolidated logical database model; this step is called view ________.
A)Summation
B)Integration
C)Addition
D)Combination
A)Summation
B)Integration
C)Addition
D)Combination
B
2
A(n)________ is an attribute (or combination of attributes)whose value is unique across all occurrences of a relation.
A)Composite key
B)Primary key
C)Identifier
D)Index
A)Composite key
B)Primary key
C)Identifier
D)Index
B
3
A well-structured relation is a relation that contains a minimum amount of redundancy and that allows users to insert,modify,and delete the rows without error or inconsistencies and is also known as a ________.
A)Column
B)Row
C)Table
D)Key
A)Column
B)Row
C)Table
D)Key
C
4
Entries in cells are simple and an entry at the intersection of each row and column has a ________ value.
A)Duplicate
B)Single
C)Multi
D)Repeating
A)Duplicate
B)Single
C)Multi
D)Repeating
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
5
In a ________ database model,data is represented as a set of related tables or relations.
A)Logical
B)Conventional
C)Relational
D)Physical
A)Logical
B)Conventional
C)Relational
D)Physical
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
6
Logical and ________ database design is typically performed in parallel with other systems design steps.
A)Normal
B)Physical
C)Conceptual
D)Normalized
A)Normal
B)Physical
C)Conceptual
D)Normalized
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
7
One purpose of database design is to structure the data in stable structures,called normalized tables,that are not likely to change over time and that have minimal ________.
A)Data
B)Space
C)Redundancy
D)Columns
A)Data
B)Space
C)Redundancy
D)Columns
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
8
There are ________ key steps in logical database modeling and design.
A)Two
B)Three
C)Four
D)Five
A)Two
B)Three
C)Four
D)Five
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
9
A relation is a named,________-dimensional table of data.Each relation (or table)consists of a set of named columns and an arbitrary number of unnamed rows.
A)Two
B)One
C)Three
D)Four
A)Two
B)One
C)Three
D)Four
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
10
Each ________ in a relation corresponds to an attribute of that relation.
A)Entity
B)Data
C)Column
D)Row
A)Entity
B)Data
C)Column
D)Row
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
11
________ database design is driven not only from the previously developed E-R data model for the application or enterprise but also from form and report layouts.
A)Logical
B)Physical
C)Normalized
D)De-normalized
A)Logical
B)Physical
C)Normalized
D)De-normalized
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
12
In logical database modeling and design,we translate the ________ E-R data model for the application or enterprise,developed without explicit consideration of specific user interfaces,into normalized data requirements.
A)Normal
B)Physical
C)Logical
D)Conceptual
A)Normal
B)Physical
C)Logical
D)Conceptual
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
13
In a relation,each row is unique and uniqueness is guaranteed because the relation has a non-empty ________ key value.
A)Unique
B)Composite
C)Candidate
D)Primary
A)Unique
B)Composite
C)Candidate
D)Primary
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
14
In most situations,many physical database design decisions are implicit or eliminated when we choose the ________ technologies to use with the application.
A)Data management
B)System management
C)Software management
D)SDLC
A)Data management
B)System management
C)Software management
D)SDLC
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
15
Logical database design is driven not only from the previously developed E-R data model for the application or enterprise but also from form and report layouts.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
16
In logical database design,we use a process called ________,which is a way to build a data model that has the properties of simplicity,non-redundancy,and minimal maintenance.
A)Data modeling
B)Database designing
C)De-normalization
D)Normalization
A)Data modeling
B)Database designing
C)De-normalization
D)Normalization
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
17
During logical database design,you must account for every data element on a system input or output-form or report-and on the flow chart.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
18
Each ________ of a relation corresponds to a record that contains data values for an entity.
A)Column
B)Entity
C)Attribute
D)Row
A)Column
B)Entity
C)Attribute
D)Row
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
19
During logical database design,you must account for every data element on a system input or output form or report and on the ________.
A)E-R diagram
B)Conceptual design
C)Physical design
D)Logical design
A)E-R diagram
B)Conceptual design
C)Physical design
D)Logical design
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
20
In a relation,the sequence of columns can be interchanged without changing the meaning or use of the ________.
A)Relation
B)Attribute
C)Row
D)Primary key
A)Relation
B)Attribute
C)Row
D)Primary key
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
21
A functional dependency between ________ key attributes is also called a transitive dependency.
A)Non-primary
B)Primary
C)Composite
D)Unique
A)Non-primary
B)Primary
C)Composite
D)Unique
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
22
In ________ normal form,non-primary key attributes do not depend on each other (what we call no transitive dependencies).
A)First
B)Fourth
C)Third
D)Second
A)First
B)Fourth
C)Third
D)Second
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
23
A foreign key is an attribute (or combination of attributes)whose value is unique across all occurrences of a relation.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
24
In ________ normal form,each non-primary key attribute is identified by the whole key (what we call full functional dependency).
A)First
B)Fourth
C)Third
D)Second
A)First
B)Fourth
C)Third
D)Second
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
25
Each relationship in an E-R diagram must be represented in the relational database design and how we represent a relationship depends on its nature.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
26
Describe normalization rules.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
27
De-normalization is a process for converting complex data structures into simple,stable data structures.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
28
What are the four key steps to logical database modeling and design?
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
29
In an object oriented database model,data is represented as a set of related tables or relations.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
30
A functional dependency is a particular relationship between two ________.
A)Attributes
B)Rows
C)Databases
D)Tables
A)Attributes
B)Rows
C)Databases
D)Tables
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
31
In a relational table,each row is unique and uniqueness is guaranteed because the relation has a non-empty primary key value.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
32
A relation is a named,two-dimensional table of data and each relation (or table)consists of a set of named columns and an arbitrary number of unnamed rows.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
33
What is a relational database model? How do relations differ from nonrelation tables?
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
34
An unstructured relation is a relation that contains a minimum amount of redundancy and that allows users to insert,modify,and delete the rows without error or inconsistencies.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
35
What are the five purposes of data design?
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
36
A relation is in third normal form if it is in second normal form and there are no functional dependencies between two (or more)non-primary key attributes.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
37
________ is a process for converting complex data structures into simple,stable data structures.
A)De-normalization
B)Normalization
C)Database modeling
D)Relation
A)De-normalization
B)Normalization
C)Database modeling
D)Relation
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
38
The result of normalization is that every ________ key attribute depends upon the whole primary key.
A)Candidate
B)Unique
C)Primary
D)Non-primary
A)Candidate
B)Unique
C)Primary
D)Non-primary
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
39
A relation is in ________ if every non-primary key attribute is functionally dependent on the whole primary key.
A)1NF
B)2NF
C)3NF
D)4NF
A)1NF
B)2NF
C)3NF
D)4NF
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
40
A relation is in first normal form if every non-primary key attribute is functionally dependent on the whole primary key.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
41
Which relation is created with a composite primary key using the primary keys of the related entities and additional primary key attributes associated with the relationship or associative entity,plus any non-key attributes of the relationship or associative entity?
A)Binary 1:N relationship
B)Associative entity
C)Associative entity with its own key
D)Associative entity with additional key
A)Binary 1:N relationship
B)Associative entity
C)Associative entity with its own key
D)Associative entity with additional key
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
42
________ is NOT a valid degree of the relationship.
A)Binary
B)Unary
C)N-ary
D)Ternary
A)Binary
B)Unary
C)N-ary
D)Ternary
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
43
A ________ is an attribute that appears as a non-primary key attribute in one relation and as a primary key attribute (or part of a primary key)in another relation.
A)Referential integrity
B)Primary key
C)Foreign key
D)Unique key
A)Referential integrity
B)Primary key
C)Foreign key
D)Unique key
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
44
Each entity type in the E-R diagram becomes a relation.The identifier of the entity type becomes the ________ of the relation,and other attributes of the entity type become non-primary key attributes of the relation.
A)Foreign key
B)Index
C)Unique key
D)Primary key
A)Foreign key
B)Index
C)Unique key
D)Primary key
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
45
A binary one-to-many (1:N)relationship in an E-R diagram is represented by adding the primary key attribute (or attributes)of the entity on the one side of the relationship as a(n)________ in the relation that is on the many side of the relationship.
A)Primary key
B)Foreign key
C)Unique key
D)Index
A)Primary key
B)Foreign key
C)Unique key
D)Index
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
46
Which relation is created by placing the primary key of the entity on the one side of the relationship as a foreign key in the relation for the entity on the many side?
A)Associative entity
B)Weak entity
C)Binary 1:N relationship
D)Associative entity with additional key
A)Associative entity
B)Weak entity
C)Binary 1:N relationship
D)Associative entity with additional key
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
47
In some situations,two or more attributes may have different names but the same meaning,as when they describe the same characteristic of an entity.Such attributes are called ________.
A)Homonyms
B)Antonyms
C)Synonyms
D)Duplicates
A)Homonyms
B)Antonyms
C)Synonyms
D)Duplicates
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
48
While representing an entity,each non-key attribute of the entity type becomes a key attribute of the relation.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
49
The procedure for representing relationships depends on both the degree of the relationship and not on the cardinalities of the relationship.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
50
Each regular entity type in an E-R diagram is transformed into a(n)________.
A)Identifier
B)Relation
C)Attribute
D)Row
A)Identifier
B)Relation
C)Attribute
D)Row
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
51
Which relation is created by placing the primary key of either entity in the relation for the other entity or by doing this for both entities?
A)Binary 1:N relationship
B)Unary 1:1 relationship
C)Weak entity
D)Associative entity with additional key
A)Binary 1:N relationship
B)Unary 1:1 relationship
C)Weak entity
D)Associative entity with additional key
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
52
Which relation is created with a composite primary key using the primary keys of the related entities,plus any non-key attributes associative entity of the relationship or associative entity?
A)Associative entity
B)Associative entity with its own key
C)Associative entity with additional key
D)Weak entity
A)Associative entity
B)Associative entity with its own key
C)Associative entity with additional key
D)Weak entity
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
53
Which relation is created with primary key and non-key attributes only?
A)Regular entity
B)Weak entity
C)Sub-type
D)Associative entity
A)Regular entity
B)Weak entity
C)Sub-type
D)Associative entity
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
54
A recursive foreign key is a foreign key in a relation that references the foreign key values of that same relation.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
55
A unary relationship is a relationship between the instances of a ________ entity type,which are also called recursive relationships.
A)Single
B)Double
C)Triple
D)Many
A)Single
B)Double
C)Triple
D)Many
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
56
A(n)________ must satisfy referential integrity,which specifies that the value of an attribute in one relation depends on the value of the same attribute in another relation.
A)Foreign key
B)Primary key
C)Unique key
D)Index
A)Foreign key
B)Primary key
C)Unique key
D)Index
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
57
Which relation is created with a composite primary key (which includes the primary key of the entity on which this weak entity depends)and non-key attributes?
A)Associative entity with additional key
B)Super-type
C)Regular entity
D)Weak entity
A)Associative entity with additional key
B)Super-type
C)Regular entity
D)Weak entity
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
58
Which relation is created with the primary key associated with the relationship or associative entity,plus any non-key attributes of the relationship or associative entity and the primary keys of the related entities (as foreign key attributes)?
A)Associative entity
B)Associative entity with its own key
C)Associative entity with additional key
D)Binary 1:N relationship
A)Associative entity
B)Associative entity with its own key
C)Associative entity with additional key
D)Binary 1:N relationship
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
59
The key should be ________; that is,no attribute in the key can be deleted without destroying its unique identification.
A)De-normalized
B)Normalized
C)Redundant
D)Non-redundant
A)De-normalized
B)Normalized
C)Redundant
D)Non-redundant
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
60
A recursive foreign key is a foreign key in a relation that references the ________ values of that same relation.
A)Non-primary key
B)Unique key
C)Primary key
D)Foreign key
A)Non-primary key
B)Unique key
C)Primary key
D)Foreign key
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
61
We begin the physical design phase by addressing the design of physical fields for each attribute in a ________ data model.
A)Conventional
B)Conceptual
C)Physical
D)Logical
A)Conventional
B)Conceptual
C)Physical
D)Logical
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
62
A default value is the value that a ________ will assume unless an explicit value is entered for it.
A)Field
B)Row
C)Table
D)Data type
A)Field
B)Row
C)Table
D)Data type
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
63
A computer operating system stores data in a ________,which is a named set of table rows stored in a contiguous section of secondary memory.
A)Disk
B)Tablespace
C)Table
D)Physical file
A)Disk
B)Tablespace
C)Table
D)Physical file
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
64
A ________ value is a special field value,distinct from a zero,blank,or any other value,that indicates that the value for the field is missing or otherwise unknown.
A)Key
B)True
C)Null
D)Default
A)Key
B)True
C)Null
D)Default
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
65
A(n)________ is a coding scheme recognized by system software for representing organizational data.
A)Data model
B)Attribute
C)Data type
D)Field
A)Data model
B)Attribute
C)Data type
D)Field
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
66
Each partition is stored in a separate contiguous section of disk space,which Oracle calls a(n)________.
A)Database
B)Tablespace
C)Table
D)Index
A)Database
B)Tablespace
C)Table
D)Index
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
67
Normalized relations are,of course,the result of ________ database design.
A)Physical
B)Logical
C)Conceptual
D)Conventional
A)Physical
B)Logical
C)Conceptual
D)Conventional
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
68
Describe at least three E-R structures and their relational representation.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
69
In some situations,a single attribute name,called a(n)________,may have more than one meaning or describe more than one characteristic.
A)Homonym
B)Antonym
C)Synonym
D)Duplicate
A)Homonym
B)Antonym
C)Synonym
D)Duplicate
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
70
________ is NOT a valid type of partitioning method in relational database products.
A)Range
B)Hash
C)Boundary
D)Composite
A)Range
B)Hash
C)Boundary
D)Composite
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
71
Summarize the four steps involved in transforming an E-R diagram into normalized relations and then merging them into one consolidated set of relations.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
72
A ________ table is a named set of rows and columns that specifies the fields in each row of the table.
A)Conceptual
B)Physical
C)Relational
D)Logical
A)Conceptual
B)Physical
C)Relational
D)Logical
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
73
A(n)________ is a field of data that can be used to locate a related field or row of data.
A)Index
B)Pointer
C)Secondary key
D)Attribute
A)Index
B)Pointer
C)Secondary key
D)Attribute
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
74
A(n)________ is the smallest unit of application data recognized by system software,such as a programming language or database management system.
A)Table
B)Field
C)Row
D)Index
A)Table
B)Field
C)Row
D)Index
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
75
Describe how a binary one-to-one relationship is represented.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
76
The capability to split a table into separate sections,often called ________,is possible with most relational database products.
A)Partitioning
B)Splitting
C)Combining
D)Normalizing
A)Partitioning
B)Splitting
C)Combining
D)Normalizing
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
77
When merging relations that contain synonyms,we should obtain,if possible,agreement from users on a single standardized name for the attribute and eliminate the other synonym.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
78
When two 3NF relations are merged to form a single relation,dependencies between non-keys may result.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
79
Describe the problems that may occur when integrating relations.
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck
80
________ is the process of splitting or combining normalized relations into physical tables based on affinity of use of rows and fields.
A)Partitioning
B)Modeling
C)Normalization
D)De-normalization
A)Partitioning
B)Modeling
C)Normalization
D)De-normalization
Unlock Deck
Unlock for access to all 100 flashcards in this deck.
Unlock Deck
k this deck