检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (06): 55-57.doi: 10.3969/j.issn.1000-3428.2010.06.018

• 软件技术与数据库 • 上一篇    下一篇

R*-Tree强制重插算法的改进

谭 宁，石跃祥   

  1. TAN Ning, SHI Yue-xiang
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-20 发布日期:2010-03-20

Improvement of R*-Tree Forced Reinsert Algorithm

TAN Ning, SHI Yue-xiang   

  1. (College of Information Engineering, Xiangtan University, Xiangtan 411105)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-20 Published:2010-03-20

PDF

1341

摘要： 为了提高检索速度，在分析R-Tree及R*-Tree的基础上，提出一种强制重插算法，通过改进R*-Tree多维空间索引结构加速搜索过程。实验结果表明，相比传统算法，该算法在索引空间利用率、动态创建索引、索引检索方面具有更高性能。

关键词: 多维索引, R-树, R*-树, 强制重插

Abstract: In order to enhance index speed, based on analyzing R-Tree and R*-Tree, this paper proposes a new forced reinsert algorithm. It improves the multi-dimensional index structure to enhance search process. Experimental results show that this algorithm has better performance in index space utility, index dynamic creating and index retrieval compared with traditional algorithms.

Key words: multi-dimensional index, R-Tree, R*-Tree, forced reinsert

中图分类号: