###
DOI:
Journal of Software:1996.7(5):314-320

e—B树:面向多用户数据库系统优化的索引技术
龚育昌,王卫红
(中国科学技术大学计算机科学技术系,合肥,230027)
e-B -TREE:AN INDEXING ORGANIZATION OPTIMIZED FOR DBMS SUPPORTING MULTI-USERS
Gong Yuchang,Wang Weihong
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2681   Download 2875
    Revised:March 23, 1995
> 中文摘要: B树在数据库系统中已成为一种标准的索引结构,其上的并发控制机制对多用户数据库系统的性能有很大的影响.本文提出了一种变种B树──弹性B树-e—B树(elasticB+-tree),定义了其上的安全点和操作及并发控制方法,对e—B树的重构时机也进行了调整,降低了e—B树上结点的合并/分裂频率,减少了e—B树的维护开销,也缩短了封锁时间,从而使得其上操作的并发度和系统的效率得以提高.
中文关键词: 并发度  合并  分裂  安全点  封锁  
Abstract: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-Btree 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-Btree and efficiency of the database system can increase by a big margin.
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Reference text:

龚育昌,王卫红.e—B树:面向多用户数据库系统优化的索引技术.软件学报,1996,7(5):314-320

Gong Yuchang,Wang Weihong.e-B -TREE:AN INDEXING ORGANIZATION OPTIMIZED FOR DBMS SUPPORTING MULTI-USERS.Journal of Software,1996,7(5):314-320