Deck 12: Clientserver Database and Distributed Database
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/56
Play
Full screen (f)
Deck 12: Clientserver Database and Distributed Database
1
During the prepare phase of the two-phase commit____.
A) only the site issuing the update request writes the update to its database
B) all of the involved sites write the update to their logs
C) all of the involved sites write the update to their databases
D) all of the sites except the site issuing the update request write the update to their logs
E) all of the sites except the site issuing the update request write the update to their databases
A) only the site issuing the update request writes the update to its database
B) all of the involved sites write the update to their logs
C) all of the involved sites write the update to their databases
D) all of the sites except the site issuing the update request write the update to their logs
E) all of the sites except the site issuing the update request write the update to their databases
B
2
A distributed join is never necessary ____.
A) if distributed data is not replicated
B) if distributed data is replicated
C) if a copy of every table is kept at one site in a distributed database network
D) if there are at least two copies of every table in a distributed database network
E) if there are at least two copies of every table involved in the join in a distributed database network
A) if distributed data is not replicated
B) if distributed data is replicated
C) if a copy of every table is kept at one site in a distributed database network
D) if there are at least two copies of every table in a distributed database network
E) if there are at least two copies of every table involved in the join in a distributed database network
C
3
Horizontal partitioning is advisable on a distributed database network ____.
A) when particular records of a table are used at some network sites more than at others
B) when all records of a table are used at some network sites more than at others
C) when different sites on the network require different columns of the table
D) when all of the columns of a table are used at some network sites more than at others
E) None of the above.
A) when particular records of a table are used at some network sites more than at others
B) when all records of a table are used at some network sites more than at others
C) when different sites on the network require different columns of the table
D) when all of the columns of a table are used at some network sites more than at others
E) None of the above.
A
4
All of the following are true about a two-tiered client/server LAN, except ____.
A) a gateway computer can link the LAN to other LANs or to the Internet
B) data can reside on a client PC's hard drive or at the server
C) searching for data is location transparent
D) a printer on the LAN is available to all of the client PCs
E) data transparency can extend to a mainframe external to the LAN
A) a gateway computer can link the LAN to other LANs or to the Internet
B) data can reside on a client PC's hard drive or at the server
C) searching for data is location transparent
D) a printer on the LAN is available to all of the client PCs
E) data transparency can extend to a mainframe external to the LAN
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
5
All of the following are true of a centralized database on a network, except ____.
A) the site with the database can become a bottleneck
B) there is no need for a distributed directory since all of the data is in one place
C) the single site arrangement provides a high degree of security, concurrency, and backup and recovery control
D) all data accesses from other than the site with the database incur telecommunications costs
E) it uses a two-phase commit process
A) the site with the database can become a bottleneck
B) there is no need for a distributed directory since all of the data is in one place
C) the single site arrangement provides a high degree of security, concurrency, and backup and recovery control
D) all data accesses from other than the site with the database incur telecommunications costs
E) it uses a two-phase commit process
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
6
In general, the directory of a distributed database ____.
A) should be stored at every site on the network because it tends to be updated frequently
B) should be stored at every site on the network because it tends to be updated infrequently
C) should be stored at only a limited number of sites on the network because it tends to be updated frequently
D) should be stored at only a limited number of sites on the network because it tends to be updated infrequently
E) should be stored at only one site on the network
A) should be stored at every site on the network because it tends to be updated frequently
B) should be stored at every site on the network because it tends to be updated infrequently
C) should be stored at only a limited number of sites on the network because it tends to be updated frequently
D) should be stored at only a limited number of sites on the network because it tends to be updated infrequently
E) should be stored at only one site on the network
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
7
If a distributed database network with data replication has one node that has a copy of every table in the database ____.
A) the problem of data concurrency is eliminated
B) the issue of one site becoming a bottleneck is eliminated
C) the problem of data security is eliminated
D) at least one other copy of each table must also be stored elsewhere on the network
E) the problem of distributed joins is eliminated
A) the problem of data concurrency is eliminated
B) the issue of one site becoming a bottleneck is eliminated
C) the problem of data security is eliminated
D) at least one other copy of each table must also be stored elsewhere on the network
E) the problem of distributed joins is eliminated
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
8
All of the following are true when dispersing tables on a distributed database network without data replication or partitioning, except ____.
A) it may require distributed joins
B) it permits local autonomy over the data
C) it permits improved data availability because portions of the database are available even if one or some of the sites are down
D) one site can tend to become a bottleneck
E) it requires a distributed directory
A) it may require distributed joins
B) it permits local autonomy over the data
C) it permits improved data availability because portions of the database are available even if one or some of the sites are down
D) one site can tend to become a bottleneck
E) it requires a distributed directory
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
9
If the nature of the distributed replicated data and of the applications that use it can tolerate retrieved data not necessarily being up-to-the-minute accurate then a(n) ____ approach to updating replicated data can be used.
A) mirrored
B) duplicated
C) synchronous
D) asynchronous
E) versioning
A) mirrored
B) duplicated
C) synchronous
D) asynchronous
E) versioning
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
10
Consider a distributed relational database in which there is no data replication. All of the following are true, except ____.
A) all of the table on the network is still available even if one site that has some tables goes down
B) every table can be placed at the site at which it is most heavily used
C) if one site goes down then the data at that site cannot be accessed there or anywhere else on the network
D) the integration of two tables that are not located at the same site will require a distributed join
E) if one site goes down at least some of the database's tables will still be accessible
A) all of the table on the network is still available even if one site that has some tables goes down
B) every table can be placed at the site at which it is most heavily used
C) if one site goes down then the data at that site cannot be accessed there or anywhere else on the network
D) the integration of two tables that are not located at the same site will require a distributed join
E) if one site goes down at least some of the database's tables will still be accessible
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
11
If node A on a distributed database network issues a query that requires tables at nodes B, C, and D, the least likely site for the join to take place is node ____.
A) A
B) B
C) C
D) D
E) E
A) A
B) B
C) C
D) D
E) E
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
12
All of the following are true when there is targeted data replication on a distributed database network, except ____.
A) there is no need for distributed joins because one site must have a copy of the entire database
B) a two-phase commit is necessary if all of the replicated copies of a table must be kept up-to-date all of the time
C) there is improved availability because of the data replication
D) communications costs for read-only data access are reduced because copies of tables can be located at multiple sites that most heavily use them
E) it requires a distributed directory
A) there is no need for distributed joins because one site must have a copy of the entire database
B) a two-phase commit is necessary if all of the replicated copies of a table must be kept up-to-date all of the time
C) there is improved availability because of the data replication
D) communications costs for read-only data access are reduced because copies of tables can be located at multiple sites that most heavily use them
E) it requires a distributed directory
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
13
All of the following are principles of data replication in a distributed database network, except ____.
A) place a copy of every table at a central node to avoid having a bottleneck
B) place copies of tables at the sites that use them most heavily in order to minimize telecommunications costs
C) ensure that there are at least two copies of important or frequently used tables to realize the gains in availability
D) limit the number of copies of any one table to control the security and concurrency issues
E) avoid any one site becoming a bottleneck to maintain performance
A) place a copy of every table at a central node to avoid having a bottleneck
B) place copies of tables at the sites that use them most heavily in order to minimize telecommunications costs
C) ensure that there are at least two copies of important or frequently used tables to realize the gains in availability
D) limit the number of copies of any one table to control the security and concurrency issues
E) avoid any one site becoming a bottleneck to maintain performance
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
14
If data replication is permitted in a distributed database network ____.
A) one site must contain a copy of every table
B) the maximum number of copies that can be made of any one table is equal to half the number of computers (sites) on the network
C) distributed joins are never necessary
D) copies of tables can be located at the sites that most heavily use them
E) a copy of every table must be placed at every site
A) one site must contain a copy of every table
B) the maximum number of copies that can be made of any one table is equal to half the number of computers (sites) on the network
C) distributed joins are never necessary
D) copies of tables can be located at the sites that most heavily use them
E) a copy of every table must be placed at every site
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
15
The two phases of the two-phase commit process are ____ and commit.
A) copy
B) prepare
C) de-commit
D) replicate
E) concur
A) copy
B) prepare
C) de-commit
D) replicate
E) concur
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
16
In the database server approach to client/server database, when a client computer on the LAN needs to query, update, or otherwise use a file on the server ____.
A) the entire file must be sent from the server to the client
B) the server can tend to become a bottleneck
C) the actual database search is performed at the client
D) the initial keyboard and screen interaction processing is performed at the server
E) the clients tend to require a great deal of processing power
A) the entire file must be sent from the server to the client
B) the server can tend to become a bottleneck
C) the actual database search is performed at the client
D) the initial keyboard and screen interaction processing is performed at the server
E) the clients tend to require a great deal of processing power
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
17
Compared to the file server approach, the database server approach to client/server database _____.
A) generates more network data traffic
B) requires more processing power at the server
C) requires a gateway connection to a mainframe computer
D) spreads security control through all of the client PCs
E) requires "fatter" client PCs with more processing power
A) generates more network data traffic
B) requires more processing power at the server
C) requires a gateway connection to a mainframe computer
D) spreads security control through all of the client PCs
E) requires "fatter" client PCs with more processing power
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
18
If all went well during the prepare phase of the two-phase commit, then during the commit phase ____.
A) only the site issuing the update request writes the update to its database
B) all of the involved sites write the update to their logs
C) all of the involved sites write the update to their databases
D) all of the sites except the site issuing the update request write the update to their logs
E) all of the sites except the site issuing the update request write the update to their databases
A) only the site issuing the update request writes the update to its database
B) all of the involved sites write the update to their logs
C) all of the involved sites write the update to their databases
D) all of the sites except the site issuing the update request write the update to their logs
E) all of the sites except the site issuing the update request write the update to their databases
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
19
In a three-tier approach to client/server database ____.
A) three of the client PCs on a LAN each constitute a tier
B) three LANs connected through gateway computers each constitute a tier
C) data location transparency runs through all three tiers
D) data can be stored at the tiers in the LAN but not at the one outside of it
E) the file server approach rather than the database server approach must be used
A) three of the client PCs on a LAN each constitute a tier
B) three LANs connected through gateway computers each constitute a tier
C) data location transparency runs through all three tiers
D) data can be stored at the tiers in the LAN but not at the one outside of it
E) the file server approach rather than the database server approach must be used
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
20
The two-phase commit process can be used when the ____ approach to updating distributed replicated data is required.
A) mirrored
B) duplicated
C) synchronous
D) asynchronous
E) versioning
A) mirrored
B) duplicated
C) synchronous
D) asynchronous
E) versioning
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
21
Placing a complete copy of the database at every site on the distributed network maximizes availability and minimizes concurrent update problems.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
22
A distributed database management system manages the distributed data as a single, logical database.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
23
One of the principles of data replication in a distributed database is to place copies of tables at the sites that use them most heavily in order to minimize telecommunications costs.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
24
What client/server database and distributed database have in common is that in both cases the databases can be located other than "in the computer itself."
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
25
Distributed data with no replication provides a high degree of availability.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
26
One of the principles of data replication in a distributed database is to ensure that there are at least two copies of important or frequently used tables to realize the gains in availability.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
27
If the nature of the data and of the applications that use it can tolerate retrieved data not necessarily being up-to-the-minute accurate, then several "synchronous" approaches to updating replicated data are appropriate.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
28
The term "client" in a local area network refers to the larger computer with the shared database that all of the PCs on the network can access.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
29
One use of the term three-tier approach to client/server database is that data sought from one of the client PCs can be on any one of a succession of three other PCs on the LAN.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
30
When data is distributed in a distributed database arrangement, the database is no longer considered to be a single, logical database.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
31
If in a distributed database network, a copy of the entire database is kept at the headquarters site and each table is replicated exactly once at any one of the other sites, there is no reason for the headquarters site to ever become a bottleneck.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
32
One of the principles of data replication in a distributed database is to maximize the number of copies of any one table to control the security and concurrency issues.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
33
In a network environment, a centralized database provides local autonomy over the data.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
34
In a two-tiered client/server arrangement, data can be found on each PC's hard drive and data can be in a database at the server.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
35
In one use of the term three-tier approach to client/server database the three tiers are the client PCs, servers known as "application servers" and other servers known as "database servers."
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
36
In the database server approach to client/server database, the actual database processing is done at the server.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
37
In the database server approach to client/server database, when a client computer on the LAN needs to query, update, or otherwise use a file on the server, the entire file must be sent from the server to that client.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
38
If in a distributed database network, a copy of the entire database is kept at the headquarters site and each table is replicated exactly once at any one of the other sites, the application environment can continue to function even if the headquarters site goes down.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
39
One use of the term three-tier approach to client/server database is that data sought from one of the client PCs can be on the client's hard drive, at the LAN server, or at a mainframe beyond the LAN.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
40
In the two-tier approach to client/server database, location transparency means that the person issuing a query at a client does not have to know whether the data is at the client or at the server.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
41
In a distributed join situation, the only way that the join can be accomplished is to transmit the records involved from their sites to the initiating site where the join must take place.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
42
In the commit phase of the two-phase commit process, either the process is aborted or each site writes the update from their log to their database.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
43
The two-phase commit process is used for asynchronous updating of replicated data.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
44
Consider the following relational database for the Central Zoo. Central Zoo wants to maintain information about its animals, the enclosures in which they live, and its zookeepers and the services they perform for the animals. In addition, Central Zoo has a program by which people can be sponsor of animals. Central Zoo wants to track its sponsors, their dependents, and associated data.
Each animal has a unique animal number and each enclosure has a unique enclosure number. An animal can live in only one enclosure. An enclosure can have several animals in it or it can be currently empty. A zookeeper has a unique employee number. Every animal has been cared for by at least one and generally many zookeepers; each zookeeper has cared for at least one and generally many animals. Each time a zookeeper performs a specific, significant service for an animal the service type, date, and time are recorded. A zookeeper may perform a particular service on a particular animal more than once on a given day.
A sponsor, who has a unique sponsor number and a unique social security number, sponsors at least one and possibly several animals. An animal may have several sponsors or none. For each animal that a particular sponsor sponsors, the zoo wants to track the annual sponsorship contribution and renewal date. In addition, Central Zoo wants to keep track of each sponsor's dependents. A sponsor may have several dependents or none. A dependent is associated with exactly one sponsor.
News flash!!! Central Zoo now has branches in four cities: Miami (also the Zoo's headquarters), Tucson, Detroit, and Cleveland. The database structure remains the same except that the Location attribute of the ENCLOSURE relation now indicates in which of the four cities the enclosure is located.
Central Zoo has decided to reconfigure its database as a distributed database among its four locations. Distributed and replicated among these four locations, the tables have the following characteristics:
ENCLOSURE consists of 4,000 records and is used most heavily in the cities in which the individual enclosures are located.
ANIMAL consists of 50,000 records. The entire table is used in the Miami headquarters, in addition to which the records concerning individual animals are used frequently in the locations at which the animals are housed.
ZOOKEEPER consists of 1,500 records with a situation similar to the ANIMAL table.
CARES FOR consists of consists of 5,000 records with a situation similar to the ANIMAL table.
SPONSOR consists of 10,000 records and is used mostly at the Miami headquarters.
CONTRIBUTION consists of 30,000 records with a situation similar to the SPONSOR table.
DEPENDENT consists of 90,000 records with a situation similar to the SPONSOR table.
Design a distributed relational database for Central Zoo. Justify your placement, replication, and partitioning of the tables.
ENCLOSURE Relation
ANIMAL Relation
ZOOKEEPER Relation
CARES FOR Relation
SPONSOR Relation
CONTRIBUTION Relation
DEPENDENT Relation
Each animal has a unique animal number and each enclosure has a unique enclosure number. An animal can live in only one enclosure. An enclosure can have several animals in it or it can be currently empty. A zookeeper has a unique employee number. Every animal has been cared for by at least one and generally many zookeepers; each zookeeper has cared for at least one and generally many animals. Each time a zookeeper performs a specific, significant service for an animal the service type, date, and time are recorded. A zookeeper may perform a particular service on a particular animal more than once on a given day.
A sponsor, who has a unique sponsor number and a unique social security number, sponsors at least one and possibly several animals. An animal may have several sponsors or none. For each animal that a particular sponsor sponsors, the zoo wants to track the annual sponsorship contribution and renewal date. In addition, Central Zoo wants to keep track of each sponsor's dependents. A sponsor may have several dependents or none. A dependent is associated with exactly one sponsor.
News flash!!! Central Zoo now has branches in four cities: Miami (also the Zoo's headquarters), Tucson, Detroit, and Cleveland. The database structure remains the same except that the Location attribute of the ENCLOSURE relation now indicates in which of the four cities the enclosure is located.
Central Zoo has decided to reconfigure its database as a distributed database among its four locations. Distributed and replicated among these four locations, the tables have the following characteristics:
ENCLOSURE consists of 4,000 records and is used most heavily in the cities in which the individual enclosures are located.
ANIMAL consists of 50,000 records. The entire table is used in the Miami headquarters, in addition to which the records concerning individual animals are used frequently in the locations at which the animals are housed.
ZOOKEEPER consists of 1,500 records with a situation similar to the ANIMAL table.
CARES FOR consists of consists of 5,000 records with a situation similar to the ANIMAL table.
SPONSOR consists of 10,000 records and is used mostly at the Miami headquarters.
CONTRIBUTION consists of 30,000 records with a situation similar to the SPONSOR table.
DEPENDENT consists of 90,000 records with a situation similar to the SPONSOR table.
Design a distributed relational database for Central Zoo. Justify your placement, replication, and partitioning of the tables.







Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
45
The two-phase commit process is used for replicated data that can tolerate having its table copies not being up-to-date all of the time.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
46
An advantage of targeted data replication in a distributed database network is reduced communications costs for read-only data access.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
47
Consider the following relational database for Grand Travel Airlines.
Grand Travel Airlines has to keep track of its flight and airplane history. A flight is uniquely identified by the combination of a flight number and a date. Every passenger who has flown on Grand Travel has a unique passenger number. For a particular passenger who has taken a particular flight, the company wants to keep track of the fare that she paid for it and the date that she made the reservation for it. Clearly, a passenger may have taken many flights (he must have taken at least one to be in the database) and every flight has had many passengers on it.
A pilot is identified by a unique pilot (or employee) number. A flight on a particular date has exactly one pilot. Each pilot has typically flown many flights but a pilot may be new to the company, is in training, and has not flown any flights, yet. Each airplane has a unique serial number. A flight on a particular date used one airplane. Each airplane has flown on many flights and dates, but a new airplane may not have been used at all, yet.
News flash!!! Grand Travel Airlines has decided to reconfigure its database as a distributed database among its four "hub" airport locations: Boston (which is also its headquarters city), Seattle, Nashville, and Columbus, Ohio.
Distributed and replicated among these four locations, the tables have the following characteristics:
Basically, all of these tables are accessed by all four locations on a fairly equal basis, except that processing at the Boston headquarters tends to be heavier than at the other three hubs. Replication is used primarily for availability purposes in case one of the sites crashes and the replicated copies are dispersed to avoid creating a bottleneck at any one site.
PILOT Relation
FLIGHT Relation
PASSENGER Relation
RESERVATION Relation
AIRPLANE Relation
PILOT consists of 2,000 records and is located in Boston and Nashville.
FLIGHT consists of 1,500 records and is located in Columbus and Seattle.
PASSENGER consists of 250,000 records and is located in Columbus and Seattle.
RESERVATION consists of 1,500,000 and is located in Boston and Nashville.
AIRPLANE consists of 450 records and is located only at headquarters in Boston.
Assume that the telecommunications costs among the cities are all about the same.
Develop and justify a plan for solving the following queries.
a. A query is issued from Nashville to list the names and addresses of the passengers who have reservations for a particular flight on a particular date one month from now.
b. A query is issued from Nashville to get a list of the serial number, model, and passenger capacity of the airplanes used on a particular flight (a flight that operates daily) during the last two months.
c. A query is issued from Boston to get a list of the serial number, model, and passenger capacity of the airplanes used on a particular flight (a flight that operates daily) during the last two months.
Grand Travel Airlines has to keep track of its flight and airplane history. A flight is uniquely identified by the combination of a flight number and a date. Every passenger who has flown on Grand Travel has a unique passenger number. For a particular passenger who has taken a particular flight, the company wants to keep track of the fare that she paid for it and the date that she made the reservation for it. Clearly, a passenger may have taken many flights (he must have taken at least one to be in the database) and every flight has had many passengers on it.
A pilot is identified by a unique pilot (or employee) number. A flight on a particular date has exactly one pilot. Each pilot has typically flown many flights but a pilot may be new to the company, is in training, and has not flown any flights, yet. Each airplane has a unique serial number. A flight on a particular date used one airplane. Each airplane has flown on many flights and dates, but a new airplane may not have been used at all, yet.
News flash!!! Grand Travel Airlines has decided to reconfigure its database as a distributed database among its four "hub" airport locations: Boston (which is also its headquarters city), Seattle, Nashville, and Columbus, Ohio.
Distributed and replicated among these four locations, the tables have the following characteristics:
Basically, all of these tables are accessed by all four locations on a fairly equal basis, except that processing at the Boston headquarters tends to be heavier than at the other three hubs. Replication is used primarily for availability purposes in case one of the sites crashes and the replicated copies are dispersed to avoid creating a bottleneck at any one site.





PILOT consists of 2,000 records and is located in Boston and Nashville.
FLIGHT consists of 1,500 records and is located in Columbus and Seattle.
PASSENGER consists of 250,000 records and is located in Columbus and Seattle.
RESERVATION consists of 1,500,000 and is located in Boston and Nashville.
AIRPLANE consists of 450 records and is located only at headquarters in Boston.
Assume that the telecommunications costs among the cities are all about the same.
Develop and justify a plan for solving the following queries.
a. A query is issued from Nashville to list the names and addresses of the passengers who have reservations for a particular flight on a particular date one month from now.
b. A query is issued from Nashville to get a list of the serial number, model, and passenger capacity of the airplanes used on a particular flight (a flight that operates daily) during the last two months.
c. A query is issued from Boston to get a list of the serial number, model, and passenger capacity of the airplanes used on a particular flight (a flight that operates daily) during the last two months.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
48
The commit phase is the first phase of the two-phase commit process.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
49
The more volatile the data in the database is, the more attractive is the two-phase commit type of synchronous procedure for updating replicated tables in the distributed database.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
50
Partitioned tables in a distributed database network tend to decrease local autonomy over data.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
51
An advantage of a centralized database is that there is no need for a distributed directory since all of the data is in one place.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
52
In the prepare phase of the two-phase commit process, the updated data is written to a log at each site but not to the database at each site.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
53
A distributed join is required when the tables needed for a join query do not all reside at any one site on the distributed network.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
54
The purpose of partitioning a table on a distributed network is to locate records of the table at sites at which they are most frequently used.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
55
Distributed directories are necessary in a distributed database environment in order to achieve location transparency.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck
56
Dispersing tables on a distributed network without replication avoids the need for a distributed directory.
Unlock Deck
Unlock for access to all 56 flashcards in this deck.
Unlock Deck
k this deck