From total order to database replication
From total order to database replication
复制标题
从总订单到数据库复制
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
C. Tutu
中科院分区：
文献类型：
--
作者：
Y. Amir;C. Tutu
本文详细介绍了一种高效且可证明正确的可分区网络数据库复制算法。我们的算法避免了对每个操作的端到端确认的需要，同时支持网络分区和合并，并允许新副本的动态实例化。只有在成员变更事件（如网络分区）发生时才需要一轮端到端确认。新的操作可以在任何时候引入到系统中，而不仅仅是在主要组件中。我们将展示如何进一步提高允许放宽一致性要求的应用程序的性能。实验结果证明了该方法的有效性。
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 our approach.