Many concurrent B-tree algorithms have been proposed, but they have not yet been satisfactorily analyzed. When transaction processing systems require high levels of concurrency, a restrictive serialization technique on the B-tree index can cause a bottleneck. In this paper, we present a framework for constructing analytical performance models of concurrent B-tree algorithms. The models can predict the response time and maximum throughput. We analyze three algorithms: Naive Lock-coupling, Optimistic Descent, and the Lehman-Yao algorithm. The analyses are validated by simulations of the algorithms on actual B-trees. Simple and instructive rules of thumb for predicting performance are also derived. We apply the analyses to determine the effect of database recovery on B-tree concurrency.
机译:并行B树结构的并发控制和性能评估
机译:B-树算法复杂度分析评估其在大学课程时间表问题中的可行性
机译:MC64-Cluster:B树搜索中的多核CPU群集体系结构和性能分析
机译:B树并发控制算法的性能
机译:数据库系统中缓存,恢复和并发控制算法的集成性能分析。
机译:Q.clear重建框架的性能评估与传统重建算法进行定量脑宠物师研究
机译:B树并发控制算法的性能
机译:并行B树算法的深入分析