| 注册
首页|期刊导航|计算机应用与软件|一种优化的T-tree索引算法

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

王平 朱敏 姜雪

计算机应用与软件2011,Vol.28Issue(2):271-273,3.
计算机应用与软件2011,Vol.28Issue(2):271-273,3.

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

AN OPTIMIZED INDEX ALGORITHM BASED ON T-TREE

王平 1朱敏 1姜雪1

作者信息

  • 1. 华东师范大学计算中心,上海,200062
  • 折叠

摘要

Abstract

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.

关键词

T-树/TrB-树/分布式内存数据库

引用本文复制引用

王平,朱敏,姜雪..一种优化的T-tree索引算法[J].计算机应用与软件,2011,28(2):271-273,3.

计算机应用与软件

OA北大核心CSCDCSTPCD

1000-386X

访问量0
|
下载量0
段落导航相关论文