Designers of distributed database systems face the choice between stronger consistency guarantees and better performance. A number of applications only require read atomicity (RA) (either all or none of a transaction’s updates are visible to other transactions) and prevention of lost updates (PLU). Existing distributed transaction systems that meet these requirements also provide additional stronger consistency guarantees (such as causal consistency ), but this comes at the price of lower performance. In this paper we propose a new distributed transaction protocol, ROLA, that targets application scenarios where only RA and PLU are needed. We formally specify ROLA in Maude. We then perform model checking to analyze both the correctness and the performance of ROLA. For correctness, we use standard model checking to analyze ROLA’s satisfaction of RA and PLU. To analyze performance we: (a) perform statistical model checking to analyze key performance properties; and (b) compare these performance results with those obtained by also modeling and analyzing in Maude the well-known protocols Walter and Jessy that also guarantee RA and PLU. Our statistical model checking results show that ROLA outperforms both Walter and Jessy.

中文翻译：

---

读取防止丢失更新的原子事务：ROLA 及其形式分析

分布式数据库系统的设计者面临着更强的一致性保证和更好的性能之间的选择。许多应用程序只需要读原子性(RA)（一个事务的所有更新或没有一个事务的更新对其他事务可见）和防止丢失更新(PLU)。满足这些要求的现有分布式事务系统还提供了额外更强的一致性保证（例如因果一致性)，但这是以较低的性能为代价的。在本文中，我们提出了一种新的分布式事务协议 ROLA，它针对只需要 RA 和 PLU 的应用场景。我们在 Maude 中正式指定 ROLA。然后我们执行模型检查以分析 ROLA 的正确性和性能。为了正确性，我们使用标准模型检查来分析 ROLA 对 RA 和 PLU 的满意度。分析表现我们： (a) 执行统计模型检查以分析关键性能属性；(b) 将这些性能结果与通过在 Maude 中建模和分析同样保证 RA 和 PLU 的著名协议 Walter 和 Jessy 获得的性能结果进行比较。我们的统计模型检查结果表明，ROLA 的表现优于 Walter 和 Jessy。