Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Maintaining availability in partitioned replicated databases
Abbadi A., Toueg S. ACM Transactions on Database Systems14 (2):264-290,1989.Type:Article
Date Reviewed: Nov 1 1989

In a replicated database, a data item may have copies residing on several sites. A replica control protocol is necessary to ensure that data items with several copies behave as if they consist of a single copy, as far as users can tell. We describe a new replica control protocol that allows the accessing of data in spite of site failures and network partitioning. This protocol provides the database designer with a large degree of flexibility in deciding the degree of data availability, as well as the cost of accessing data.

--Authors’ Abstract

This abstract correctly and succinctly summarizes the paper, which consists of five sections. The introduction presents the problem well. Section 2 describes the formal model and the criteria for correct operation. Section 3 proposes the protocol that maintains all the replicated copies, while Section 4 is the formal proof. Section 5 then proposes some modifications to the protocol that could make it operate faster without losing correctness.

One major problem I had was yet another potential meaning for the word “partition.” In this paper, the partitioning is not of the data (objects 1–n are on machine 1 and objects nm are on machine 2, or similar attribute partitioning), but rather a network fracturing that leaves some machines unable to communicate with other machines. While the English use of the term is correct, I thought that among database practitioners we had finally begun to have a common use of the term. Clearly not, unfortunately. Since the paper is well reviewed, this is not a problem with the authors and may be only a problem of my expectations.

The paper is well written with a good interspersing of examples with formal proofs. It is not light reading, and only those with a special interest in distributed replicated databases are likely to want to read it. However, the topic is timely and very important as “distribution” becomes real. I would like to see experimentation to determine whether the theory really works and if it can be made to run with any acceptable performance. At least, a reading of this version seems to imply that it would work, and adequate-speed communication links would keep the performance certainly no worse than if there were a single copy of the data physically located elsewhere than on your local computer.

Reviewer:  Charles W. Bash Review #: CR113689
Bookmark and Share
 
Distributed Databases (H.2.4 ... )
 
 
Access Methods (H.2.2 ... )
 
 
Distributed Databases (C.2.4 ... )
 
 
Distributed File Systems (D.4.3 ... )
 
 
Fault-Tolerance (D.4.5 ... )
 
 
Network Protocols (C.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Distributed Databases": Date
Federated database systems for managing distributed, heterogeneous, and autonomous databases
Sheth A., Larson J. ACM Computing Surveys 22(3): 183-236, 2001. Type: Article
Jul 1 1991
Asserting the optimality of serial SJRPs in processing simple queries in chain networks
Gursel G., Scheuermann P. Information Processing Letters 19(5): 255-260, 1984. Type: Article
Sep 1 1985
Nested transactions: an approach to reliable distributed computing
Moss J., Massachusetts Institute of Technology, Cambridge, MA, 1985. Type: Book (9780262132008)
Mar 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy