arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.00542cs.DB
收藏

修复MVCC事务之间的冲突

Repairing Conflicts among MVCC Transactions

Mohammad Dashti, Sachin Basil John, Amir Shaikhha, Christoph Koch

摘要:

MVCC(多版本并发控制)的乐观变体避免了阻塞并发事务,但代价是有一个验证阶段。在验证阶段失败时,事务通常被中止并从头开始。对于具有高争用对象或长时间运行事务的用例,“中止并重新启动”方法成为性能瓶颈。此外,从头开始会在系统中产生一个负反馈循环,因为系统会产生额外的开销,这可能会产生更多的冲突。在本文中,我们提出了一种新的方法在MVCC内存数据库的冲突解决。这种低开销的方法以依赖图的形式总结了事务程序。依赖图还包含MVCC算法的验证阶段中使用的构造。然后,在事务之间遇到冲突的情况下,快速检测程序中的冲突位置,并且部分地重新执行冲突事务。这种方法最大限度地重用了在初始执行轮中完成的计算,并增加了事务处理吞吐量。

英文摘要:

The optimistic variants of MVCC (Multi-Version Concurrency Control) avoid blocking concurrent transactions at the cost of having a validation phase. Upon failure in the validation phase, the transaction is usually aborted and restarted from scratch. The "abort and restart" approach becomes a performance bottleneck for the use cases with high contention objects or long running transactions. In addition, restarting from scratch creates a negative feedback loop in the system, because the system incurs additional overhead that may create even further conflicts. In this paper, we propose a novel approach for conflict resolution in MVCC for in-memory databases. This low overhead approach summarizes the transaction programs in the form of a dependency graph. The dependency graph also contains the constructs used in the validation phase of the MVCC algorithm. Then, in the case of encountering conflicts among transactions, the conflict locations in the program are quickly detected, and the conflicting transactions are partially re-executed. This approach maximizes the reuse of the computations done in the initial execution round, and increases the transaction processing throughput.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑