Optimistic concurrency control by melding trees
Optimistic concurrency control by melding trees
复制标题
通过融合树进行乐观并发控制
DOI：
10.14778/3402707.3402732
复制
发表时间：
2011
影响因子：
2.5
通讯作者：
Xinhao Yuan
中科院分区：
文献类型：
--
作者：
P. Bernstein;Colin W. Reid;Ming Wu;Xinhao Yuan
本文介绍了一种称为Meld的树结构数据的新的乐观并发控制算法。每个事务都在多元数据库的快照上执行，并使用其预期更新记录记录。 MELD流程在最后一个承诺状态的缓存部分副本上以日志顺序记录记录，以确定每个交易是否承担。如果是这样，它将交易的更新合并到该状态。 MELD用于Hyder交易系统，并使Hyder能够扩大而无需分区。由于MELD是交易执行的关键路径，因此必须非常快。本文详细描述了MELD算法，并报告了对实施的评估。它可以每秒执行超过400k的更新交易，用于两项操作的交易，130K用于具有八个操作的交易。
This paper describes a new optimistic concurrency control algorithm for tree-structured data called meld. Each transaction executes on a snapshot of a multiversion database and logs a record with its intended updates. Meld processes log records in log order on a cached partial-copy of the last committed state to determine whether each transaction commits. If so, it merges the transaction's updates into that state. Meld is used in the Hyder transaction system and enables Hyder to scale out without partitioning. Since meld is on the critical path of transaction execution, it must be very fast. The paper describes the meld algorithm in detail and reports on an evaluation of an implementation. It can perform over 400K update transactions per second for transactions with two operations, and 130K for transactions with eight operations.