Deck 10: Distributed 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
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/70
Play
Full screen (f)
Deck 10: Distributed Databases
1
A DBMS must have validation, transformation, and mapping functions, as well as other functions, in order to be classified as distributed.
True
2
Distributed database systems do not require complex mechanisms to manage transactions and ensure the database's consistency and integrity.
False
3
Distributed processing shares the database's logical processing among two or more physically independent sites that are connected through a network.
True
4
One of the advantages of a DDBMS is security.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
5
A fully distributed DBMS must perform all the functions of a centralized DBMS, and it must handle all necessary functions imposed by the distribution of data and processing.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
6
Current DDBMSs are subject to some problems, such as the complexity of management and control.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
7
Distributed processing does not require a distributed database, and a distributed database does not require distributed processing.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
8
Both distributed processing and distributed databases require a network to connect all components.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
9
The TP is the software component found in each computer that requests data.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
10
A remote transaction, composed of several requests, may access data at multiple sites.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
11
A transaction processor is the software component residing on each computer that stores and retrieves data located at the site.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
12
A DDBMS governs the storage and processing of logically related data over interconnected computer systems.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
13
A DDBMS must be communications-media-dependent.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
14
One of the advantages of a DDBMS is growth facilitation.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
15
In order to manage distributed data, copies or parts of the database processing functions must be distributed to all data storage sites.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
16
The World Wide Web (the Web) is the repository for distributed data.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
17
One of the advantages of a DDBMS is improved communication.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
18
The inherently complex distributed data environment increases the urgency for standard protocols governing transaction management.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
19
A distributed database system requires functional characteristics that can be grouped and described as transparency features.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
20
One of the advantages of a DDBMS is that the data is located near the site with the least demand.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
21
____ transparency allows the system to perform as if it were a centralized database management system.
A) Heterogeneity
B) Distribution
C) Performance
D) Failure
A) Heterogeneity
B) Distribution
C) Performance
D) Failure
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
22
____ transparency allows a transaction to update data at several network sites.
A) Transaction
B) Distribution
C) Failure
D) Performance
A) Transaction
B) Distribution
C) Failure
D) Performance
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
23
____ are an advantage of a DDBMS.
A) Reduced operating costs
B) Simplicity of management and control
C) Decreased storage requirements
D) Decreased training costs
A) Reduced operating costs
B) Simplicity of management and control
C) Decreased storage requirements
D) Decreased training costs
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
24
____ transparency is the highest level of transparency. The end user or programmer does not need to know that a database is partitioned.
A) Performance
B) Fragmentation
C) Location
D) Local mapping
A) Performance
B) Fragmentation
C) Location
D) Local mapping
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
25
The ____ processor is the software component residing on each computer that stores and retrieves data located at the site.
A) transaction
B) network
C) data
D) management
A) transaction
B) network
C) data
D) management
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
26
____ is a disadvantage of a DDBMS.
A) Processor independence
B) The graphical user interface
C) Security
D) Data access that is too rapid
A) Processor independence
B) The graphical user interface
C) Security
D) Data access that is too rapid
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
27
A ____ distributed database system will support different DBMSs that may even support different models running under different computer systems.
A) fully heterogeneous
B) fully homogeneous
C) homogeneous
D) heterogeneous
A) fully heterogeneous
B) fully homogeneous
C) homogeneous
D) heterogeneous
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
28
____ distributed database systems integrate different types of centralized DBMSs over a network.
A) Homogeneous
B) Heterogeneous
C) Fully homogeneous
D) Combination
A) Homogeneous
B) Heterogeneous
C) Fully homogeneous
D) Combination
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
29
____ distributed database systems integrate only one type of centralized DBMS over a network.
A) Homogeneous
B) Heterogeneous
C) Fully heterogeneous
D) Combination
A) Homogeneous
B) Heterogeneous
C) Fully heterogeneous
D) Combination
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
30
____ transparency exists when the end user or programmer must specify the database fragment names but does not need to specify where these fragments are located.
A) Transaction
B) Location
C) Local mapping
D) Fragmentation
A) Transaction
B) Location
C) Local mapping
D) Fragmentation
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
31
____ transparency allows the integration of several different local DBMSs under a common, or global, schema.
A) Transaction
B) Performance
C) Distribution
D) Heterogeneity
A) Transaction
B) Performance
C) Distribution
D) Heterogeneity
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
32
____ transparency exists when the end user or programmer must specify both the fragment names and their locations.
A) Local mapping
B) Location
C) Performance
D) Transaction
A) Local mapping
B) Location
C) Performance
D) Transaction
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
33
Under the ____ scenario, multiple processes run on different computers sharing a single data repository.
A) single-site processing, single-site data
B) multiple-site processing, single-site data
C) single-site processing, multiple-site data
D) multiple-site processing, multiple-site data
A) single-site processing, single-site data
B) multiple-site processing, single-site data
C) single-site processing, multiple-site data
D) multiple-site processing, multiple-site data
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
34
The ____ scenario describes a fully distributed DBMS with support for multiple data processors and transaction processors at multiple sites.
A) multiple-site processing, single-site data
B) single-site processing, multiple-site data
C) single-site processing, single-site data
D) multiple-site processing, multiple-site data
A) multiple-site processing, single-site data
B) single-site processing, multiple-site data
C) single-site processing, single-site data
D) multiple-site processing, multiple-site data
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
35
____ transparency allows a distributed database to be treated as a single logical database.
A) Distribution
B) Transaction
C) Failure
D) Performance
A) Distribution
B) Transaction
C) Failure
D) Performance
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
36
____ transparency ensures that the system will continue to operate in the event of a node failure.
A) Transaction
B) Distribution
C) Failure
D) Performance
A) Transaction
B) Distribution
C) Failure
D) Performance
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
37
A ____ contains the description of the entire database as seen by the database administrator.
A) distributed global dictionary
B) distributed data dictionary
C) distributed global schema
D) distributed data schema
A) distributed global dictionary
B) distributed data dictionary
C) distributed global schema
D) distributed data schema
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
38
A distributed database is composed of several parts known as database ____.
A) sections
B) fragments
C) partitions
D) parts
A) sections
B) fragments
C) partitions
D) parts
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
39
____ is a disadvantage of a DDBMS.
A) Data is located near the "greatest demand" site
B) Growth facilitation
C) Danger of a single-point failure
D) Lack of standards
A) Data is located near the "greatest demand" site
B) Growth facilitation
C) Danger of a single-point failure
D) Lack of standards
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
40
The ____ processor is the software component found in each computer that requests data. It receives and processes the application's data requests.
A) database
B) transaction
C) data
D) network
A) database
B) transaction
C) data
D) network
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
41
The __________________________________________________ scenario is typical of most mainframe and midrange server computer DBMSs.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
42
____________________ management ensures that data move from one consistent state to another, including synchronization of local and remote transactions.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
43
The ability to execute a ____ request provides fully distributed database processing because you can partition a database table into several fragments.
A) distributed
B) transaction
C) fragmented
D) transparent
A) distributed
B) transaction
C) fragmented
D) transparent
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
44
The ____ guarantees that if a portion of a transaction operation cannot be committed, all changes made at the other sites participating in the transaction will be undone to maintain a consistent database state.
A) DO-UNDO-REDO protocol
B) two-phase commit protocol (2PC)
C) coordinator protocol
D) write-ahead protocol
A) DO-UNDO-REDO protocol
B) two-phase commit protocol (2PC)
C) coordinator protocol
D) write-ahead protocol
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
45
A(n) ____ database stores each database fragment at a single site.
A) partially replicated
B) unreplicated
C) fully replicated
D) partitioned
A) partially replicated
B) unreplicated
C) fully replicated
D) partitioned
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
46
One of the advantages of a DDBMS is less danger of a single-____________________ failure.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
47
One of the advantages of a DDBMS is ____________________ operating cost.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
48
In a DDBMS, ____________________ control is used to manage simultaneous data access and ensure data consistency across database fragments.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
49
The objective of ____ optimization is to minimize the total cost associated with the execution of a request.
A) data
B) remote
C) transaction
D) query
A) data
B) remote
C) transaction
D) query
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
50
In a DDBMS, ____________________ occurs to determine the data location of local and remote fragments.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
51
A distributed ____ allows a transaction to reference several different remote database processing sites.
A) request
B) site
C) data location
D) transaction
A) request
B) site
C) data location
D) transaction
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
52
The ____ rule requires that all copies of data fragments be identical.
A) shared fragment
B) mutual consistency
C) horizontal fragmentation
D) replication
A) shared fragment
B) mutual consistency
C) horizontal fragmentation
D) replication
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
53
____ fragmentation refers to the division of a relation into attribute subsets.
A) Data
B) Horizontal
C) Vertical
D) Mixed
A) Data
B) Horizontal
C) Vertical
D) Mixed
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
54
In a DDBMS, query ____________________ is used to find the best access strategy.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
55
A user-friendly ____________________ is one advantage of a DDBMS.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
56
____ fragmentation refers to the division of a relation into subsets of tuples.
A) Vertical
B) Horizontal
C) Data
D) Mixed
A) Vertical
B) Horizontal
C) Data
D) Mixed
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
57
One of the advantages of a DDBMS is processor ____________________.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
58
____ is the delay imposed by the amount of time required for a data packet to make a round trip from point A to point B.
A) Data distribution
B) Replica transparency
C) Network latency
D) Network partitioning
A) Data distribution
B) Replica transparency
C) Network latency
D) Network partitioning
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
59
____ fragmentation allows you to break a single object into two or more segments or fragments.
A) Horizontal
B) Vertical
C) Data
D) Mixed
A) Horizontal
B) Vertical
C) Data
D) Mixed
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
60
A transaction processor is also known as the ____________________ processor.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
61
The ____________________ commit protocol guarantees that if a portion of a transaction operation cannot be committed, all changes made at the other sites participating in the transaction will be undone to maintain a consistent database state.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
62
A fully distributed database management system must perform all of the functions of a centralized DBMS. What are these functions?
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
63
Explain the difference between homogeneous and heterogeneous distributed database systems.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
64
The DO-UNDO-REDO protocol defines three types of operations. What are they?
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
65
The database description, known as the distributed ____________________ schema, is the common database schema used by local TPs to translate user requests into subqueries (remote requests) that will be processed by different DPs.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
66
What is transaction transparency? What are some of the basic concepts that you should know to understand how transactions are managed in a DDBMS?
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
67
If a DDBMS exhibits ____________________ transparency, the user does not need to know that the data are partitioned-meaning the table's rows and columns are split vertically or horizontally and stored among multiple sites.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
68
Describe performance transparency and heterogeneity transparency.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
69
The ____________________ fragment condition indicates that each row is unique, regardless of the fragment in which it is located.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck
70
Typically, the __________________________________________________ scenario requires a network file server running conventional applications that are accessed through a network.
Unlock Deck
Unlock for access to all 70 flashcards in this deck.
Unlock Deck
k this deck