Journal of Computer Applications

• Typical applications • Previous Articles     Next Articles

Optimization research of spatial index structure of R*-tree

<a href="https://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=(((min chen[Author]) AND 1[Journal]) AND year[Order])" target="_blank">min chen</a>   

  • Received:2007-04-02 Revised:1900-01-01 Online:2007-10-01 Published:2007-10-01

R*-树空间索引的优化研究

陈敏 王晶海   

  1. 福建工程学院数理系 福州大学数学与计算机科学学院
  • 通讯作者: 王晶海

Abstract: Aiming at the need of very large spatial database applications and taking notice of the disadvantagesf existing spatial indexes, the thesis introduces an improved R*-tree spatial indexing structure after addressing the related concepts, data structures, algorithms, and performannalyses of R-tree and R*-tree. This paper gave a more efficient algorithm which analyses the shortcoming of R*-tree spatial index algorithm. The experiment results show that improved R*-tree is better than the original R*-tree in index efficiency.

Key words: spatial indexing, spatial database, R-tree, R*-tree

摘要: 针对大型空间数据库应用的需求及己有空间索引技术的不足,在论述R-树及R*-树索引技术的相关概念、数据结构、算法描述及性能分析的基础上,提出了一种改进的R*-树空间索引结构。研究结果表明:改进后的R*-树与原始的R*-树相比具有更高的性能。

关键词: 空间索引;空间数据库;R-树;R*-树