Lazy database replication with ordering guarantees
Lazy database replication with ordering guarantees
复制标题
具有排序保证的惰性数据库复制
DOI：
10.1109/icde.2004.1320016
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
K. Salem
中科院分区：
文献类型：
--
作者：
Khuzaima S. Daudjee;K. Salem
惰性复制是一种用于提高数据库系统性能和可用性的流行技术。虽然有并发控制技术，保证在惰性复制系统中的可串行化，这些技术导致不良的事务排序。由于事务可能会看到过时的数据，因此它们可能会以不同于提交顺序的顺序进行序列化。强可串行性避免了此类问题，但实现成本非常高。我们提出了一个广义的形式，强序列化，是适合使用惰性复制。除了具有强可串行性的许多优点外，它还可以更有效地实现。我们展示了如何广义强序列化可以实现在一个懒惰的复制系统，我们提出了一个模拟研究的结果，量化的优势和局限性的方法。
Lazy replication is a popular technique for improving the performance and availability of database systems. Although there are concurrency control techniques, which guarantee serializability in lazy replication systems, these techniques result in undesirable transaction orderings. Since transactions may see stale data, they may be serialized in an order different from the one in which they were submitted. Strong serializability avoids such problems, but it is very costly to implement. We propose a generalized form of strong serializability that is suitable for use with lazy replication. In addition to having many of the advantages of strong serializability, it can be implemented more efficiently. We show how generalized strong serializability can be implemented in a lazy replication system, and we present the results of a simulation study that quantifies the strengths and limitations of the approach.