分布式事务读取:强大、快速、新鲜和不可能
Distributed transactional reads: the strong, the quick, the fresh \& the impossible
摘要:
本文研究了在分布式存储系统中提供事务一致性读的成本和权衡。我们确定了以下维度:读一致性,读延迟(延迟)和数据新鲜度。我们证明了它们之间存在三方权衡,可以总结如下:(i)不可能同时确保保序(例如,因果一致)或原子读取、最小延迟和最大新鲜度;因此,仅在弱隔离模式下才可能在没有延迟的情况下读取最新鲜的数据;(ii)为了确保以最小延迟进行原子或保序读取,必须从过去读取数据(iii)然而,保序最小延迟读取可以比原子更新鲜;(iv)以最大新鲜度读取原子或次序保持数据可能无限期地阻塞读取或写入。我们的不可能性结果独立于数据库的其他特征,如更新语义(完全有序或不)或数据模型(结构化或非结构化)。在这些结果的指导下,我们修改了现有的协议,以确保最小的延迟读取(以新鲜度为代价)下原子的可见性和因果一致的语义。我们的实验评估支持的理论结果。
英文摘要:
This paper studies the costs and trade-offs of providing transactional consistent reads in a distributed storage system. We identify the following dimensions: read consistency, read delay (latency), and data freshness. We show that there is a three-way trade-off between them, which can be summarised as follows: (i) it is not possible to ensure at the same time order-preserving (e.g., causally-consistent) or atomic reads, Minimal Delay, and maximal freshness; thus, reading data that is the most fresh without delay is possible only in a weakly-isolated mode; (ii) to ensure atomic or order-preserving reads at Minimal Delay imposes to read data from the past (not fresh); (iii) however, order-preserving minimal-delay reads can be fresher than atomic; (iv) reading atomic or order-preserving data at maximal freshness may block reads or writes indefinitely. Our impossibility results hold independently of other features of the database, such as update semantics (totally ordered or not) or data model (structured or unstructured). Guided by these results, we modify an existing protocol to ensure minimal-delay reads (at the cost of freshness) under atomic-visibility and causally-consistent semantics. Our experimental evaluation supports the theoretical results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。