一种优化的T-tree索引算法

AN OPTIMIZED INDEX ALGORITHM BASED ON T-TREE

分布式内存数据库已经成为了当今数据库的研究热点,而索引能够极大地提高数据库操作的性能。T-树索引是数据库系统中广泛使用索引技术之一。在T-树的基础上设计一种新的索引结构,在处理区间查询操作时其效率有明显的提高,也能够很好地解决数据插入、删除操作所造成的数据溢出问题。

Distributed memory database has been the hotly studied topic in present database system.Indexes can greatly speed up the performance of database operation.T-tree index is one of the wildly used indexing technologies in database system.This paper introduces a design of new index structure based on T-tree,it has conspicuous efficiency improvement in operation of interval queries processing,and can also well deal with the data overflow issue caused by data insertion or deletion operation.