Mar 2nd Flashcards
(137 cards)
1
Q
A(n) _____ is a collection of programs that manages the database structure and controls access to the data stored in the database.
A
Database Management System (DBMS)
2
Q
When a database stores the majority of data in RAM rather than in hard disks, it is referred to as a(n) _____ database.
A
In-memory
3
Q
The DBMS uses the _____ to look up the required data component structures and relationships, thus relieving programmers from having to code such complex relationships in each program.
A
Data Dictionary
4
Q
A(n) _____ develops when all required changes in the redundant data are not made successfully.
A
Data Anomaly
5
Q
_____ relates to activities that make a database operate more efficiently in terms of storage and access speed.
A
Performance Tuning
6
Q
_____ exists when the same data are stored unnecessarily at different places.
A
Data Redundancy
7
Q
_____ is the result of processing raw data to reveal its meaning.
A
Information
8
Q
Information is produced by processing _____.
A
Data
9
Q
_____ is data about data through which the end-user data are integrated and managed.
A
Metadata
10
Q
_____ exists when different and conflicting versions of the same data appear in different places.
A
Data inconsistency
11
Q
A database that is created and maintained using services such as Microsoft Azure or Amazon AWS is called a(n) _____ database.
A
Cloud
12
Q
_____ databases focus primarily on storing data used to generate the information required to make tactical or strategic decisions.
A
Analytical Database
13
Q
To reveal meaning, the information requires _____.
A
Context
14
Q
Raw data must be properly _____ for storage, processing and presentation.
A
Formatted
15
Q
Web and mobile technologies that enable “anywhere, anytime, always on” human interactions are forms of _____.
A
Social Media
16
Q
The term _____ refers to scattered locations storing the same basic data.
A
Islands of Information
17
Q
_____ is a special language used to represent and manipulate data elements in a textual format.
A
Extensible Markup Language (XML)
18
Q
A(n) _____ is a specific request issued to the DBMS for data manipulation.
A
Query
19
Q
The movement to find new and better ways to manage large amounts of web- and sensor-generated data and derive business insight from it, while simultaneously providing high performance and scalability at a reasonable cost is referred to as “_____.”
A
Big Data
20
Q
A(n) _____ is a relatively simple representation of more complex real-world data structures.
A
Data Model
21
Q
The _____ is the representation of a database as “seen” by the DBMS.
A
Internal Model
22
Q
Each row in the relational table is known as a(n) _____.
A
Entity Instance
23
Q
In object-oriented terms, a(n) _____ defines an object’s behavior.
A
Method
24
Q
In an SQL-based relational database, each table is dependent on every other table.
True
False
A
False
25
Business rules must be rendered in writing.
True
False
True
26
Even when a good database blueprint is available, an applications programmer's view of the data should match that of the manager and the end user.
True
False
False
27
In an SQL-based relational database, rows in different tables are related based on common values in common attributes.
True
False
True
28
The relational model is hardware-dependent and software-independent.
True
False
False
29
A(n) _____ is a collection of similar objects with a shared structure and behavior.
Class
30
The relational model's foundation is a mathematical concept known as a(n) _____.
Relation
31
_____ is a language based on OO concepts that describes a set of diagrams and symbols used to graphically model a system.
Unified Modeling Language (UML)
32
Each column in a relation represents a(n) _____.
Attribute
33
The network model has structural level dependence.
True
False
True
34
Business rules apply to businesses and government groups, but not to other types of organizations such as religious groups or research laboratories.
True
False
False
35
Within the database environment, a data model represents data structures with the purpose of supporting a specific problem domain.
True
False
True
36
In an SQL-based relational database, each table is dependent on every other table.
True
False
False
37
Database designers determine the data and information that yield the required understanding of the entire business.
True
False
False
38
One of the limitations of the _____ model is that there is a lack of standards.
Hierarchical
39
The _____ model is the end users' view of the data environment.
External
40
Each row in the relational table is known as an entity instance or entity occurrence in the ER model.
True
False
True
41
In the context of data models, an entity is a person, place, thing, or event about which data will be collected and stored.
True
False
True
42
Today, most relational database products can be classified as object/relational.
True
False
True
43
PRODUCT yields all possible pairs of rows from two tables, also known as the _____ product.
Cartesian
44
The relational operators have the property of _____; that is, the use of relational algebra operators on existing relations (tables) produces new relations.
Closure
45
The proper use of _____ keys is crucial to controlling data redundancy.
Foreign
46
_____ is the real power behind the relational database, allowing the use of independent tables linked by common attributes.
The Join
47
A(n) ______ provides a detailed description of all tables found within the user/designer-created database.
Data Dictionary
48
Character data can contain any character or symbol intended for mathematical manipulation.
False
True
False
49
In a natural join, the column on which the join was made occurs twice in the new table.
True
False
False
50
A data dictionary is sometimes described as "the database designer's database" because it records the design decisions about tables and their structures.
True
False
True
51
The one-to-many (1:M) relationship is easily implemented in the relational model by putting the foreign key of the "1" side in the table of the "many" side as a primary key.
True
False
False
52
The DIVIDE operation uses one single-column table (e.g., column "a") as the divisor and one two-column table (e.g., columns "a" and "b") as the dividend.
True
False
True
53
A primary key is a(n) _____ key chosen to be the primary means by which rows of a table are uniquely identified.
Candidate
54
A(n) _____ index is an index in which the index key can have only one pointer value (row) associated with it.
Unique
55
If one department chair—a professor—can chair only one department, and one department can have only one department chair. The entities PROFESSOR and DEPARTMENT exhibit a(n) _____ relationship.
One-to-one (1:1)
56
A null is created when you press the Enter key or the Tab key to move to the next entry without making a prior entry of any kind.
True
False
True
57
If the attribute (B) is functionally dependent on a composite key (A) but not on any subset of that composite key, the attribute (B) is fully functionally dependent on (A).
True
False
True
58
The row's range of permissible values is known as its domain.
True
False
False
59
RDBMSs enforce integrity rules automatically.
True
False
True
60
Only a single attribute, not multiple attributes, can define functional dependence.
True
False
False
61
Dr. Codd's _____ rule of relational database states that every value in a table is guaranteed to be accessible through a combination of table name, primary key value, and column name.
Guaranteed Access
62
Proper data _____ design requires carefully defined and controlled data redundancies to function properly.
Warehousing
63
As rare as 1:1 relationships should be, certain conditions absolutely require their use.
True
False
True
64
The idea of determination is unique to the database environment.
True
False
False
65
A(n) _____ relationship is also known as an identifying relationship.
Strong
66
A person's Social Security number would be an example of a(n) _____ attribute.
Single-valued
67
A relationship _____ indicates the number of entities or participants associated with a relationship.
Degree
68
_____ are characteristics of entities.
Attributes
69
Participation is _____ if one entity occurrence does not require a corresponding entity occurrence in a particular relationship.
Optional
70
The Crow's Foot notation easily identifies multivalued attributes.
False
True
False
71
The Crow's Foot notation is less implementation-oriented than the Chen notation.
True
False
False
72
To implement a small database, a database designer must know the "1" and the "M" sides of each relationship and whether the relationships are mandatory or optional.
True
False
True
73
Composite attributes make it easier to facilitate detailed queries.
False
True
False
74
Referential integrity and participation are both bidirectional, meaning that they must be addressed in both directions along a relationship.
False
True
False
75
A(n) _____ process is based on repetition of processes and procedures.
Iterative
76
_____ are underlined in an ER diagram.
Identifiers
77
A(n) _____ attribute need not be physically stored within the database.
Derived
78
A(n) _____ attribute is an attribute that must have a value.
Required
79
In the entity-relationship model, a table row corresponds to an entity instance.
True
False
True
80
Connectivities and cardinalities are established by concise statements known as business rules.
True
False
True
81
In implementation terms, an entity is existence-dependent if it has a mandatory primary key.
False
True
False
82
The entity-relationship model (ERM) is dependent on the database type.
True
False
False
83
An entity in the entity-relationship model corresponds to a table in the relational environment.
False
True
True
84
A relationship _____ is difficult to establish if only one side of the relationship is known.
Classification
85
In the original Chen notation, each attribute is represented by an oval with the attribute name connected to an entity rectangle with a line.
True
False
True
86
In a 1:M relationship, to avoid the possibility of referential integrity errors, the data of the "1" side must be loaded first.
True
False
True
87
When designing a new database structure based on the business requirements of the end users, the database designer will construct a data model using a technique such as _____.
Crow's Foot Notation ERDs
88
According to the data-modeling checklist, _____ should be nouns that are familiar to business, should be short and meaningful, and should document abbreviations, synonyms, and aliases for each entity.
Entity Names
89
It becomes difficult to create a suitable _____ key when the related table uses a composite primary key.
Foreign
90
In a real-world environment, changing granularity requirements might dictate changes in primary key selection, and those changes might ultimately require the use of _____ keys.
Surrogate
91
Any attribute whose value determines other values within a row is known as a(n) _____.
Determinant
92
The combination of normalization and ER modeling yields a useful ERD, whose entities can be translated into appropriate table structures.
False
True
T
93
Repeating groups must be eliminated by ensuring that each row defines a single entity.
True
False
T
94
Relational models view data as part of a table or collection of tables in which all key values must be identified.
False
True
T
95
In order to meet performance requirements, portions of the database design may need to be occasionally denormalized.
True
False
T
96
All relational tables satisfy the 1NF requirements.
True
False
T
97
A dependency based on only a part of a composite primary key is called a(n) _____.
Partial Dependency
98
The price paid for increased performance through denormalization is a larger amount of _____.
Redundancy
99
The combination of _____ and ER modeling yields a useful ERD, whose entities may now be translated into appropriate table structures.
Normalization
100
In the context of partial dependencies, data redundancies occur because every row entry requires duplication of data.
True
False
True
101
Dependency diagrams are very helpful in getting a bird's-eye view of all the relationships among a table's attributes.
True
False
T
102
Normalization works through a series of stages called normal forms.
True
False
T
103
The objective of normalization is to ensure that each table conforms to the concept of well-formed relations.
True
False
T
104
_____ is a process to help reduce the likelihood of data anomalies.
Normalization
105
An ERD is created through a(n) _____ process.
Iterative
106
Dependencies that are based on only a part of a composite primary key are called transitive dependencies.
True
False
False
107
Normalization purity is often easy to sustain in the modern database environment.
True
False
False
108
A table is in fourth normal form if it is in third normal form and has no independent multivalued dependencies.
True
False
True
109
Data stored at their highest level of granularity are said to be atomic data.
True
False
False
110
____exists when it is possible to make changes in the data storage characteristics without affecting an application program's ability to access Data.
Data Independence
111
A(n) _____ is the conceptual organization of an entire database as viewed by a database administrator.
Schema
112
A(n) _____ in a hierarchical model is the equivalent of a record in a file system.
Segment
113
In Chen notation, entities and relationships have to be oriented horizontally; not vertically.
True
False
False
114
Each row in a relation is called a(n) _____.
Tuple
115
A table is also called a(n) _____ because the relational model’s creator, E. F. Codd, used the two terms as synonyms.
Relation
116
The _____ catalog can be described as a detailed system data dictionary that describes all objects within the database, including data about table names, the table’s creator and creation date, the number of columns in each table, the data type corresponding to each column, index filenames, index creators, authorized users, and access privileges.
System
117
You can think of a table as a persistent representation of a logical relation.
True
False
t
118
An index key can have multiple _____ (a composite index).
Attributes
119
A(n) _____ links tables on the basis of an equality condition that compares specified columns of each table.
Equijoin
120
One characteristic of generalization hierarchies is that they are implemented as _____ relationships.
One-to-one (1:1)
121
The concept of relationship strength is based on how the _____ of a related entity is defined.
Primary Key
122
Failure to understand the distinction between mandatory and optional _____ in relationships might yield designs in which awkward (and unnecessary) temporary rows (entity instances) must be created just to accommodate the creation of required entities.
Participation
123
Not only helps database designers to stay on track during the design process, it also enables them to pick up the design thread when the time comes to modify the design.
Documentation
124
The existence of a mandatory relationship indicates that the minimum cardinality is 0 or 1 for the mandatory entity.
True
False
F
125
A weak entity must be _____-dependent.
Existence
126
A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.
True
False
False
127
____data exist in the format in which they were collected.
Unstructured
128
A _____ is a character or group of characters that has a specific meaning.
Field
129
A(n) _____ database supports a relatively small number of users (usually fewer than 50) or a specific department within an organization.
Workgroup
130
Accurate, relevant, and timely information is the key to ____.
Good decision making
131
____provide a description of the data characteristics and the set of relationships that link the data found within the database.
Metadata
132
End-user data is _____.
Raw facts of interest to the end user
133
Most data that can be encountered are best classified as _____.
Semistructured
134
A _____ is a collection of related records.
File
135
A noun in a business rule translates to a(n) _____ in the data model.
Entity
136
In the _____ model, each parent can have many children, but each child has only one parent.
Hierarchical
137
A(n) _____ is a restriction placed on the data.
Constraint
