SLOG: Serializable, Low-latency, Geo-replicated Transactions
SLOG: Serializable, Low-latency, Geo-replicated Transactions
复制标题
DOI：
10.14778/3342263.3342647
复制
发表时间：
2019-07
期刊：
影响因子：
--
通讯作者：
Kun Ren;Dennis Li;Daniel J. Abadi
中科院分区：
文献类型：
--
作者：
Kun Ren;Dennis Li;Daniel J. Abadi
几十年来，在全球范围内部署的应用程序被迫放弃以下至少一项：（1）严格的可串行性（2）低延迟写入（3）高事务吞吐量。在本文中，我们将讨论Sunday：一个系统，避免了这种权衡的工作负载，其中包含物理区域的本地数据访问。对于在全球范围内提交的所有事务，Socking以地理复制的距离和规模实现了高吞吐量，严格可序列化的ACID事务，同时对于从靠近其访问数据的主区域的位置启动的事务实现了低延迟。实验发现，相对于Spanner和卡尔文等最先进的严格可序列化的地理复制数据库系统，SSTK可以将延迟降低一个数量级以上，同时在争用情况下保持高吞吐量。
For decades, applications deployed on a world-wide scale have been forced to give up at least one of (1) strict serializability (2) low latency writes (3) high transactional throughput. In this paper we discuss SLOG: a system that avoids this tradeoff for workloads which contain physical region locality in data access. SLOG achieves high-throughput, strictly serializable ACID transactions at geo-replicated distance and scale for all transactions submitted across the world, all the while achieving low latency for transactions that initiate from a location close to the home region for data they access. Experiments find that SLOG can reduce latency by more than an order of magnitude relative to state-of-the-art strictly serializable geo-replicated database systems such as Spanner and Calvin, while maintaining high throughput under contention.