| R*-树空间索引的改进 |
| |
| 引用本文： | 吴钦阳. R*-树空间索引的改进[J]. 计算机应用, 2010, 30(2): 419-422 |
| |
| 作者姓名： | 吴钦阳 |
| |
| 作者单位： | 福建省经济信息中心 |
| |
| 摘 要： | R*-树基于局部调整的思想对节点进行管理，存在时间与效率上的不足。为克服R*-树的不足，给出了一种新型的存储结构，并给出新型存储结构的插入、溢出、分裂等空间索引常用操作的算法。分析新的存储结构的优点，并通过实验结果说明该方案比R*-树具有更高的效率。
|
| 关 键 词： | 地理信息系统 空间索引 空间查询 R-树 R*-树 |
| 收稿时间： | 2009-08-30 |
| 修稿时间： | 2009-10-11 |
Improved R~*-tree spatial index |
| |
| WU Qin-yang. Improved R~*-tree spatial index[J]. Journal of Computer Applications, 2010, 30(2): 419-422 |
| |
| Authors: | WU Qin-yang |
| |
| Affiliation: | Fujian Provincial Economical Information Centre/a>;Fuzhou Fujian 350003/a>;China |
| |
| Abstract: | R*-tree spatial index manages nodes based on the idea of partial adjustment,but lacks time and efficiency.In order to overcome the shortages of R*-tree,the paper proposed a new storage structure,and the algorithms of insertion,overflow and split for the new storage structure.The merits of the storage structure were analyzed.Experiments verify the new storage structure is more efficient than R*-tree. |
| |
| Keywords: | Geographic Information System (GIS) spatial index spatial query R-tree R~*-tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
