可序列化HTAP与无回滚/等待快照读
Serializable HTAP with Abort-/Wait-free Snapshot Read
AI总结:
本研究提出了一种基于多版本CC理论的读安全快照方法,实现HTAP系统的可序列性,同时避免回滚和等待,适用于单节点和多节点架构。
摘要:
并发控制(CC)确保更新数据的一致性是OLTP系统的重要组成部分。近年来,为执行OLTP和OLAP而开发的混合事务/分析处理(HTAP)系统引起了广泛关注。OLAP侧的CC领域与OLTP的CC被隔离,并且在许多情况下通过快照隔离(SI)来建立HTAP系统。尽管更高的隔离级别是理想的,但考虑到在OLTP调度上下文中实现可序列化的OLAP只读事务,强制回滚/等待可能会成为性能问题。此外,为了尽可能减少对OLTP的影响,执行OLAP是HTAP系统所需。本研究的目标是在不增加回滚/等待的情况下实现可序列性。我们提出了一种读安全快照(RSS)方法,利用多版本CC(MVCC)理论,并引入利用可序列化快照隔离(SSI)构建RSS的构造算法。为了实现HTAP系统的可序列性,我们的模型利用多版本并允许更多带有相应写操作不参与依赖循环的读操作的调度。此外,我们将在提供SSI的开源数据库系统中实际实现该算法。我们的算法被整合到两种类型的架构中,作为HTAP系统,称为统一(单节点)或解耦(多节点)存储架构。我们评估了单节点架构的性能和回滚率,其中SSI适用。多节点架构被研究以检查应用我们算法的性能开销。
英文摘要:
Concurrency Control (CC) ensuring consistency of updated data is an essential element of OLTP systems. Recently, hybrid transactional/analytical processing (HTAP) systems developed for executing OLTP and OLAP have attracted much attention. The OLAP side CC domain has been isolated from OLTP's CC and in many cases has been achieved by snapshot isolation (SI) to establish HTAP systems. Although higher isolation level is ideal, considering OLAP read-only transactions in the context of OLTP scheduling achieving serializability forces aborts/waits and would be a potential performance problem. Furthermore, executing OLAP without affecting OLTP as much as possible is needed for HTAP systems. The aim of this study was serializability without additional aborts/waits. We propose read safe snapshot (RSS) using multiversion CC (MVCC) theory and introduce the RSS construction algorithm utilizing serializable snapshot isolation (SSI). For serializability of HTAP systems, our model makes use of multiversion and allows more schedules with read operations whose corresponding write operations do not participate in the dependency cycles. Furthermore, we implemented the algorithm practically in an open-source database system that offers SSI. Our algorithm was integrated into two types of architecture as HTAP systems called as unified (single-node) or decoupled (multinode) storage architecture. We evaluate the performance and abort rate of the single-node architecture where SSI is applicable. The multi-node architecture was investigated for examining the performance overhead applying our algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。