Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Maintaining availability in partitioned replicated databases

Published: 01 June 1989 Publication History

Abstract

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.

References

[1]
BERNSTEIN, P. A., AND GOODMAN, N. Concurrence contorl in distributed database systems. ACM Comput. Surv. 13, 2 (June 1981), 185-221.
[2]
BERNSTEIN, P. A., AND GOODMAN, N. The failure and recovery problem for replicated databases. In Proceedings of the 2nd A CM Symposium on Principles of Distributed Computing (Montreal, Aug. 1983). ACM, New York, pp. 114-122.
[3]
BERNSTEIN, P. A., AND GOODMAN, N. An algorithm for concurrency control and recovery in replicated distributed databases. ACM Trans. Database Syst. 9, 4 (Dec. 1984), 596-615.
[4]
BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, Mass., 1987.
[5]
CHEUNG, D., AND KAMEDA, W. Optimal decentralized termination protocols for partition failures. LCCR TR 86-1, Laboratory for Computer and Communication Research, Simon Fraser Univ., Burnaby, B.C., Canada, Jan. 1986.
[6]
CHUNG-KUO, C., AND GOUDA, M. Independent recovery. In Proceedings of the 6th Symposium on Relaibility in Distiributed Software and Database Systems (Williamsburg, Va. Mar. 1987). IEEE, New York, 1987, pp. 93-104.
[7]
COAN, B., OKI, B., AND KOLODNER, E. Limitations on database availability when networks partitions. In Proceedings of the 5th A CM Symposium on Principles of r~;ot,;h,to,~ r~,nputing (Calgary, Alberta, Canada, Aug. 1986). ACM, New York, pp. 63-72.
[8]
DAVIDSON, S. S., GARCIA-MOLINA, H., AND SKEEN, D. Consistency in partitioned networks. ACM Comput. Surv. 17, 3 (Sept. 1985), 341-370.
[9]
EAGER, D., AND SEVCIK, K. Achieving robustness in distributed database systems. ACM Trans. Database Syst. 8, 3 (Sept. 1983), 354-381.
[10]
EL ABBADI, A. A paradigm for concurrency control protocols for distributed databases. Ph.D. thesis, TR 87-853, Dept. of Computer Science, Cornell Univ., Ithaca, N.Y. (Aug. 1987).
[11]
EL ABBAD, A., AND TOUEG, S. Availability in partitioned replicated databases. In Proceedings of the 5th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems (Cambridge, Mass., Mar. 24-26, 1986). AUM, New York, pp. 240-251.
[12]
EL ABBADI, A., SKEEN, D., AND CRISTIAN, F. An efficient fault-tolerant protocol for replicated data management. In Proceedings of the 4th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems (Portland, Ore., Mar. 25-27, 1985)> ACM, New York, pp. 215-219
[13]
ESWARAN, K., GRAY, J., LORIE, R., AND TRAIGER, I. The notions of consistency and predicate locks in a database system. Commun. ACM I9, 11 (Nov. 1976), 624-633.
[14]
G!FFORD~ D. Weighted voting far replie.ted d~t~ In Prae~dlngs of the 7th Sympa~i,m on Operating Systems Principles (Pacific Grove, Calif., Dec. 10-12, 1979). ACM, New York 1979, pp. 150-159.
[15]
GOODMAN, N., SKEEN, D., CHAN, A., DAYAL, U., FOX, S., AND R{ES, D. A recovery algorithm for a distributed database system. In Proceedings of the 2nd A CM Symposium on Principles of Database Systems (Atlanta, Ga., Mar. 21-23, 1983). ACM, New York, pp. 8-15.
[16]
GRAY, J., MCJONES, P., BLASGEN, M., LtNDSAY, B., LORIE, R., PRICE, T., PUTZOLU, F., AND TRAIGER, I. The recovery manager in the System R database manager. ACM Comput. Surv. 13, 2 (June 1981), 223-242.
[17]
HADZ~LACOS, V. Issues of fault tolerance in concurrent computations. Tech. Rep. 11-84, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass. (june i984).
[18]
HERLIHY, i. Dynamic quorum adjustments for partitioned data. ACM Trans. Database Syst. 12, 2 (June 1987), 170-194.
[19]
JOSEPH, T., AND BIRMAN, K. Low cost management of replicated data in fault-toleatna distributed systems. ACM Trans. Comput. Syst. 4, 1 (Feb. 1986), 54-70.
[20]
PAPADIMITRIOU, C.H. Serializability of concurrent database updates. J. ACM 24, 4 (Oct. 1979), 631-653.
[21]
PERRY, K., AND TOUEG, S. Distributed agreement in the presence of processor and communication faults. IEEE Trans. Softw. Eng. SE-I2, 3 {Mar. 1986), 477-482.
[22]
REED, D.P. Implementing atomic actions on decentralized data. ACM Trans. Comput. Syst. 1, 1 (Feb. 1983), 3-23.
[23]
SKEEN, D. Crash recovery in a distributed database management system. Ph.D. thesis, Memo. UCB/ERL M82/45, Electronics Research Lab., Univ. California, Berkeley, 1982.
[24]
SKEEN, D., AND WRIGHT, D. Increasing availability in partitioned networks. In Proceedings of the 3rd A CM SIGACT/SIGMOD Symposium on Principles of Database Systems (Waterloo, Ontario, Canada, Apr. 2-4, 1984). ACM, New York, 1984, pp. 290-299.
[25]
WRIGHT, D. Managing distributed databases in partitioned networks. TR83-572, Dept. of Computer Science, Cornell Univ., Ithaca, N.Y., Sept. 1983.

Cited By

View all
  • (2019)Efficient and non-blocking agreement protocolsDistributed and Parallel Databases10.1007/s10619-019-07267-w38:2(287-333)Online publication date: 13-Apr-2019
  • (2013)Managing Geo-replicated Data in Multi-datacentersDatabases in Networked Information Systems10.1007/978-3-642-37134-9_2(23-43)Online publication date: 2013
  • (2010)A Comparative Study on Replica Placement Algorithms for Content Delivery NetworksProceedings of the 2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies10.1109/ACT.2010.44(140-142)Online publication date: 2-Dec-2010
  • Show More Cited By

Recommendations

Reviews

Charles William Bash

.abstract 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 n– m 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.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems
ACM Transactions on Database Systems  Volume 14, Issue 2
June 1989
144 pages
ISSN:0362-5915
EISSN:1557-4644
DOI:10.1145/63500
  • Editor:
  • Gio Wiederhold
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1989
Published in TODS Volume 14, Issue 2

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)90
  • Downloads (Last 6 weeks)14
Reflects downloads up to 18 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media