摘要
B+树在数据库系统中已成为一种标准的索引结构,其上的并发控制机制对多用户数据库系统的性能有很大的影响.本文提出了一种变种B+树──弹性B+树-e—B+树(elasticB+-tree),定义了其上的安全点和操作及并发控制方法,对e—B+树的重构时机也进行了调整,降低了e—B+树上结点的合并/分裂频率,减少了e—B+树的维护开销,也缩短了封锁时间,从而使得其上操作的并发度和系统的效率得以提高.
B+ -trees are considered standard organization for indexes in database systems. The concurrent control mechanism on B+ -trees has a great effect on the performance of DBMS supporting multi-users. A variant of B+ -tree called e-B+ -tree(elastic B+ -tree) is presented in this paper. Then, the safe nodes and operations on e--B+ trees are defined and the moment of reconstruction of e-B+tree is regulated. All these measures not only reduce the overhead for maintaining the e--B+ tree and the time spent on locking, but also decrease the frequency of splitting and catenating operation. Therefore, the degree of concurrency of operations on e-B+tree and efficiency of the database system can increase by a big margin.
出处
《软件学报》
EI
CSCD
北大核心
1996年第5期314-320,共7页
Journal of Software
关键词
并发度
B^+树
数据库
索引
Degree of concurrecy, catenat, split, safe node, lock.