Abstract
This research presents an algorithm that allows transaction processing to proceed during site failures and network partitioning while ensuring the consistency of replicated data. Our algorithm can be used together with various voting schemes which provide varying degrees of data availability. Different voting schemes may be used simultaneously for different groups of data. Our algorithm contains as special cases: the site quorum method in which there is a single distinguished partition, and the virtual partition method in which a (possibly different) distinguished partition is determined for each logical data item. By grouping data items in various ways, our algorithm can be tuned to yield methods which lie between these two extremes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. E. Abbadi and S. Toueg. Availability in partitioned replicated databases. In Proc. Fifth ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pages 240–251, March 1986.
P. Bernstein and N. Goodman. An algorithm for concurrency control and recovery in repolicated distributed databases. ACM Trans. Database Syst., 9(4):596–615, Dec. 1984.
P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
B. Bhargava and P. Ng. A dynamic majority determination algorithm for reconfiguration of network partitions. to appear in International Journal of Information Science, Sep. 1988.
B. Bhargava and Z. Ruan. Site recovery in replicated distributed database systems. In Proceedings of the 6th Intl. Conf. on Distributed Computing Syst., May 1986.
S. Davidson, H. Garcia-Molina, and D. Skeen. Consistency in partitioned networks. Computing Surveys, 17(3):341–370, Sep. 1985.
D. K. Gifford. Weighted voting for replicated data. In Proc. Seventh Symposium on Operating Systems Principles, pages 150–162, ACM, Dec. 1979.
C. Huang and V. Li. A quorum-based commit and termination protocol for distributed database systems. In Proc. Fourth International Conference on Data Engineering, pages 136–143, IEEE Computer Society Press, Feb. 1988.
S. Jajodia and D. Mutchler. Dynamic voting. In Proc. ACM SIGMOD 1987 Annual Conference, pages 227–238, May 1987.
S. Jajodia and D. Mutchler. Integrating static and dynamic voting protocols to enhance file availability. In Proc. Fourth International Conference on Data Engineering, pages 144–153, IEEE Computer Society Press, Feb. 1988.
K. Ramarao. Transaction atomicity in the presence of network partitions. In Proc. Fourth International Conference on Data Engineering, pages 512–519, IEEE Computer Society Press, Feb. 1988.
Z. Ruan. File replication in distributed systems. PhD thesis, Purdue University, Aug. 1986.
D. Skeen and M. Stonebraker. A formal model of crash recovery in a distributed system. IEEE Transaction on Software Engineering, SE-9(3):219–227, May 1983.
R. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst., 4(2):180–209, June 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhargava, B., Browne, S. (1988). A generic algorithm for transaction processing during network partitioning. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_99
Download citation
DOI: https://doi.org/10.1007/3-540-50517-2_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50517-4
Online ISBN: 978-3-540-46030-5
eBook Packages: Springer Book Archive