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

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

作　　者：包斌[1] 李亚岗[2] 

机构地区：[1]华东师范大学计算机系,上海200062 [2]平顶山学院计算机科学与技术学院,河南平顶山467000

出　　处：《计算机应用》2006年第1期220-222,233,共4页journal of Computer Applications

摘　　要：在对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.

关 键 词：多版本 版本项 版本链 B链树 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]