以B链树为索引的动态多版本数据库的并发控制

Dynamic multiversion database concurrency control based on B^(link)-tree index

在对B链树极高同步性能研究的基础上,提出了一种将B链树作为数据库索引并和多版本技术相接合的一种新颖方案。该方案将事务分为只读事务或更新事务,只读事务不需要获取锁,而更新事务也只需要少量的锁,不会形成死锁。实验表明,在并发环境下这种方案能较大的提高数据库性能和事务的吞吐量。

Based on the studies of super-high concurrency of B^link-tree, a novel scheme that combined B^link-tree-based database index with multiversion technology was provided. In this scheme, transactions were classified as being either readonly or updated transactions. Read-only transactions could read correct version without holding any locks or latches, while updated transactions only obtained a few locks without deadlocks. Experiment results show that this scheme provides significant imorovement in the database performance and transaction throughput in concurrent environment.