Summary: From Total Order to Database Replication
Yair Amir and Ciprian Tutu
Johns Hopkins University
Department of Computer Science
3400 N.Charles Street, Baltimore, MD 21218
fyairamir, cipriang@cnds.jhu.edu
Abstract
This paper presents in detail an efficient and provably
correct algorithm for database replication over partition­
able networks. Our algorithm avoids the need for end­to­
end acknowledgments for each action while supporting net­
work partitions and merges and allowing dynamic instan­
tiation of new replicas. One round of end­to­end acknowl­
edgments is required only upon a membership change event
such as a network partition. New actions may be intro­
duced to the system at any point, not only while in a primary
component. We show how performance can be further im­
proved for applications that allow relaxation of consistency
requirements. We provide experimental results that demon­
strate the efficiency of our approach.

Source: Amir, Yair - Department of Computer Science, Johns Hopkins University

Collections: Computer Technologies and Information Sciences