Question 1

A transaction manager is an algorithm that coordinates updates or aborts them.

Accepted Answer

A) True 
 B)False

Question 2

A(n)________ is a single logical database spread physically across computers in multiple locations that are connected by a data communications link.

Accepted Answer

distribute

Question 3

In a(n)________ replication strategy,the target,not the source,controls when a local database is updated.

Accepted Answer

The answer of In a(n)________ replication strategy,the target,not the source,controls...

Question 4

In general,data should be located ________ to the applications that use those data.

Accepted Answer

The answer of In general,data should be located ________ to...

Question 5

With a pull strategy of replication,the ________ node determines when a database is updated.

Accepted Answer

A)  user 
B)  source 
C)  target 
D)  all of the above 
A)  user 
B)  source 
C)  target 
D)  all of the above

Question 6

A design goal for distributed databases to allow programmers to treat a data item replicated at several sites as though it were at one site is called:

Accepted Answer

A)  location transparency. 
B)  replication accessibility. 
C)  replication transparency. 
D)  data accessibility. 
A)  location transparency. 
B)  replication accessibility. 
C)  replication transparency. 
D)  data accessibility.

Question 7

With a two-phase commit strategy for synchronizing distributed data,committing a transaction is faster than if the originating location were able to work alone.

Accepted Answer

A) True 
 B)False

Question 8

In a homogeneous environment,the same DBMS is used at each location.

Accepted Answer

A) True 
 B)False

Question 9

Explain the difference between a synchronous and asynchronous distributed database.

Accepted Answer

A synchronous distributed database keeps

Question 10

Which of the following supports a simple path to other databases,without the benefits of one logical database?

Accepted Answer

A)  Linked; differential 
B)  Gateways 
C)  Autonomous; cross-linked 
D)  Federated; nonautonomous 
A)  Linked; differential 
B)  Gateways 
C)  Autonomous; cross-linked 
D)  Federated; nonautonomous

Question 11

________ is an application that can effectively employ snapshot replication in a distributed environment.

Accepted Answer

The answer of ________ is an application that can effectively...

Question 12

________ simplifies a query and rewrites it into a structured,relational algebra form.

Accepted Answer

The answer of ________ simplifies a query and rewrites it...

Question 13

A transaction that requires only reference to data that are stored at the site is a(n)________ transaction.

Accepted Answer

The answer of A transaction that requires only reference to...

Question 14

Data localization involves transforming a query into fragments that explicitly reference data at one site.

Accepted Answer

A) True 
 B)False

Question 15

An algorithm designed to ensure that updates in a distributed database are coordinated is called a(n)________.

Accepted Answer

The answer of An algorithm designed to ensure that updates...

Question 16

________ enables users and programmers to treat data as if it were located at one node even though it may move from node to node.

Accepted Answer

Location t

Question 17

________ is an alternative to the use of locks in a distributed database.

Accepted Answer

The answer of ________ is an alternative to the use...

Question 18

________ insures that a transaction is successfully completed or else it is aborted.

Accepted Answer

A)  Failure protocol 
B)  TCP/IP protocol 
C)  Commit protocol 
D)  None of the above 
A)  Failure protocol 
B)  TCP/IP protocol 
C)  Commit protocol 
D)  None of the above

Question 19

Replication should be used when:

Accepted Answer

A)  data currency and timing doesn't matter. 
B)  there is a highly heterogeneous network. 
C)  when there are no or few triggers. 
D)  all of the above. 
A)  data currency and timing doesn't matter. 
B)  there is a highly heterogeneous network. 
C)  when there are no or few triggers. 
D)  all of the above.

Question 20

With ________ all of the actions of a transaction are either committed or not committed.

Accepted Answer

A)  location transparency 
B)  replication transparency 
C)  failure transparency 
D)  commit transparency 
A)  location transparency 
B)  replication transparency 
C)  failure transparency 
D)  commit transparency

A transaction manager is an algorithm that coordinates updates or aborts them.

A(n)________ is a single logical database spread physically across computers in multiple locations that are connected by a data communications link.

In a(n)________ replication strategy,the target,not the source,controls when a local database is updated.

In general,data should be located ________ to the applications that use those data.

With a pull strategy of replication,the ________ node determines when a database is updated.

A design goal for distributed databases to allow programmers to treat a data item replicated at several sites as though it were at one site is called:

With a two-phase commit strategy for synchronizing distributed data,committing a transaction is faster than if the originating location were able to work alone.

In a homogeneous environment,the same DBMS is used at each location.

Explain the difference between a synchronous and asynchronous distributed database.

Which of the following supports a simple path to other databases,without the benefits of one logical database?

________ is an application that can effectively employ snapshot replication in a distributed environment.

________ simplifies a query and rewrites it into a structured,relational algebra form.

A transaction that requires only reference to data that are stored at the site is a(n)________ transaction.

Data localization involves transforming a query into fragments that explicitly reference data at one site.

An algorithm designed to ensure that updates in a distributed database are coordinated is called a(n)________.

________ enables users and programmers to treat data as if it were located at one node even though it may move from node to node.

________ is an alternative to the use of locks in a distributed database.

________ insures that a transaction is successfully completed or else it is aborted.

Replication should be used when:

With ________ all of the actions of a transaction are either committed or not committed.

The Database Environment and Development Process

Modeling Data in the Organization

The Enhanced E-R Model and Business Rules

Logical Database Design and the Relational Model

Physical Database Design and Performance

Introduction to SQL

Advanced SQL

Database Application Development

Data Warehousing

Data Quality and Integration

Data and Database Administration

Object-Oriented Data Modeling

Using Relational Databases to Provide Object Persistence

Filters

Exam 12: Distributed Databases

A transaction manager is an algorithm that coordinates updates or aborts them.

A(n)________ is a single logical database spread physically across computers in multiple locations that are connected by a data communications link.

In a(n)________ replication strategy,the target,not the source,controls when a local database is updated.

In general,data should be located ________ to the applications that use those data.

With a pull strategy of replication,the ________ node determines when a database is updated.

A design goal for distributed databases to allow programmers to treat a data item replicated at several sites as though it were at one site is called:

With a two-phase commit strategy for synchronizing distributed data,committing a transaction is faster than if the originating location were able to work alone.

In a homogeneous environment,the same DBMS is used at each location.

Explain the difference between a synchronous and asynchronous distributed database.

Which of the following supports a simple path to other databases,without the benefits of one logical database?

________ is an application that can effectively employ snapshot replication in a distributed environment.

________ simplifies a query and rewrites it into a structured,relational algebra form.

A transaction that requires only reference to data that are stored at the site is a(n)________ transaction.

Data localization involves transforming a query into fragments that explicitly reference data at one site.

An algorithm designed to ensure that updates in a distributed database are coordinated is called a(n)________.

________ enables users and programmers to treat data as if it were located at one node even though it may move from node to node.

________ is an alternative to the use of locks in a distributed database.

________ insures that a transaction is successfully completed or else it is aborted.

Replication should be used when:

With ________ all of the actions of a transaction are either committed or not committed.

The Database Environment and Development Process

Modeling Data in the Organization

The Enhanced E-R Model and Business Rules

Logical Database Design and the Relational Model

Physical Database Design and Performance

Introduction to SQL

Advanced SQL

Database Application Development

Data Warehousing

Data Quality and Integration

Data and Database Administration

Object-Oriented Data Modeling

Using Relational Databases to Provide Object Persistence

Filters