From Total Order to Database Replication
ps, ps.gz, pdf. In Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria, July 2-5, 2002. Obsoletes Technical Report CNDS-2001-6, November 2001.

Citation

Yair Amir and Ciprian Tutu, "From Total Order to Database Replication", In Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria, July 2-5, 2002.

Authors

Yair Amir and Ciprian Tutu,

Abstract

This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-to-end acknowledgments for each action while supporting network partitions and merges and allowing dynamic instantiation of new replicas. One round of end-to-end acknowledgments is required only upon a membership change event such as a network partition. New actions may be introduced to the system at any point, not only while in a primary component. We show how performance can be further improved for applications that allow relaxation of consistency requirements. We provide experimental results that demonstrate the efficiency of this approach.