DDBMS governs the storage and processing of logically related data over interconnected

computer systems.
t

One of the advantages of a DDBMS is that the data can be located near the site with the
least demand.
f

One of the advantages of a DDBMS is growth facilitation.

One of the advantages of a DDBMS is improved communication.

One of the advantages of a DDBMS is security.

Current DDBMSs are subject to some problems, such as the complexity of management and
control.
t

Distributed processing shares the database's logical processing among two or more
physically independent sites that are connected through a network.
t

The inherently complex distributed data environment increases the urgency for standard
protocols governing transaction management.
t

Distributed processing does not require a distributed database, and a distributed database
does not require distributed processing.
f

In order to manage distributed data, copies or parts of the database processing functions
must be distributed to all data storage sites.
t
Both distributed processing and distributed databases require a network to connect all
components.
t

A DDBMS governs the storage and processing of logically related data over interconnected
computer systems in which both data and processing functions are distributed among
several sites.
t

A DBMS must have validation, transformation, and mapping functions, as well as other
functions, in order to be classified as distributed.
t

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.
t

The TP is the software component found in each computer that requests data.
t

A DDBMS must be communications-media-dependent

A transaction processor is the software component residing on each computer that stores
and retrieves data located at the site.

A distributed database system requires functional characteristics that can be grouped and
described as transparency features.
t

Distributed database systems do not require complex mechanisms to manage transactions

f
A remote transaction, composed of several requests, may access data at multiple sites.
f

____ 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

____ is a disadvantage of a DDBMS.

a.Processor independence c.Security

b.User-friendly interface d.Faster data access

____ is an advantage of a DDBMS.

a.Reduced operating cost

c.Decreased storage requirements

b.Simplicity of management and control

d.Decreased training cost

a
In a distributed database system, a database is composed of several parts known as
database ____.

a.sections c.partitions

b.fragments d.parts

The ____ processor is the software component found in each computer that requests data.
It receives and processes the application's data requests.

a.database c.data

b.transaction d.network

The ____ processor is the software component residing on each computer that stores and
retrieves data located at the site.

a.transaction c.data

b.network d.management

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

ANSWER: B
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

ANSWER: D

____ distributed database systems integrate only one type of centralized DBMS over a
network.

a.Homogeneous c.Fully homogeneous

b.Heterogeneous d.Combination

____ distributed database systems integrate different types of centralized DBMSs over a
network.

a.Homogeneous c.Fully homogeneous

b.Heterogeneous d.Combination

b
A ____ distributed database system will support different DBMSs that may even support
different models running under different computer systems.

a.fully heterogeneous c.homogeneous

b.fully homogeneousn d.heterogeneous

____ transparency allows a distributed database to be treated as a single logical database.

a.Transaction c.Failure

b.Distribution d.Performance

____ transparency allows a transaction to update data at several network sites.

a.Transaction c.Failure

b.Distribution d.Performance

____ transparency ensures that the system will continue to operate in the event of a node
failure.

a.Transaction c.Failure

b.Distribution d.Performance

c
____ transparency allows the system to perform as if it were a centralized database
management system.

a.Heterogeneity c.Performance

b.Distribution d.Failure

____ transparency allows the integration of several different local DBMSs under a common,
or global, schema.

a.Transaction c.Distribution

b.Performance d.Heterogeneity

____ is the highest level of distribution transparency. The end user or programmer does not
need to know that a database is partitioned.

a.Performance c.Location

b.Fragmentation d.Local mapping

____ 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 c.Local mapping

b.Location d.Fragmentation

b
____ 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 c.Local mapping

b.Location d.Fragmentation

A distributed ____ allows a transaction to reference several different remote database

a.request c.data location

b.site d.transaction

____ query optimization means that the DDBMS finds the most cost-effective access path
without user intervention.

a.Static c.Automatic

b.Dynamic d.Manual

____ query optimization takes place at compilation time.

a.Static c.Automatic

b.Dynamic d.Manual

a
____ query optimization takes place at execution time.

a.Static c.Automatic

b.Dynamic d.Manual

A ____ query optimization algorithm is based on a set of user-defined rules to determine the
best access strategy.

a.statistically based c.manual

b.rule-based d.dynamic

____ fragmentation refers to the division of a relation into subsets of tuples.

a.Vertical c.Data

b.Horizontal d.Mixed

____ fragmentation refers to the division of a relation into subsets of tuples.

a.Vertical c.Data

b.Horizontal d.Mixed

c
The ____ rule requires that all copies of data fragments be identical.

a.shared fragment c.horizontal fragmentation

b.mutual consistency d.replication