| ESR-Tree:一种多维对象的动态索引方法 |
| |
| 引用本文： | 徐焕,林坤辉.ESR-Tree:一种多维对象的动态索引方法[J].计算机应用,2005,25(12):2872-2874. |
| |
| 作者姓名： | 徐焕 林坤辉 |
| |
| 作者单位： | 厦门大学软件学院 |
| |
| 基金项目： | “985工程”智能化国防信息安全技术资助项目 |
| |
| 摘 要： | 在研究SR-tree(Sphere/Rectangle-tree)和X-tree(eXtended node tree)的结构与性能的基础上，针对SR-tree分裂算法的不足，改进了分裂算法，结合两者的优点，设计了一种新的多维索引结构ESR-tree(Extended SR-tree)。实验表明，随着数据量和维数的增多，ESR-tree的性能要优于SR-tree和X-tree。
|
| 关 键 词： | 多维索引 超球体 超矩形 超级节点 |
| 文章编号： | 1001-9081（2005）12-2872-03 |
| 收稿时间： | 2005-06-28 |
| 修稿时间： | 2005-06-282005-09-16 |
ESR-Tree: a dynamic index for multi-dimensional objects |
| |
| XU Huan,LIN Kun-hui.ESR-Tree: a dynamic index for multi-dimensional objects[J].journal of Computer Applications,2005,25(12):2872-2874. |
| |
| Authors: | XU Huan LIN Kun-hui |
| |
| Affiliation: | College of Software,Xiamen University,Fujian Xiamen 361005,China |
| |
| Abstract: | With study on the structure and performance of SR-tree(Sphere/Rectangle-tree) and X-tree(eXtended node tree),the split algorithm was improved to make up for the shortage of the SR-tree algorithm.A new multi-dimensional indexing structure ESR-tree(Extended SR-tree) was designed by combining the advantages of the both.With the increase of data amount and dimensions,experiments show that the performance of ESR-tree is much better than that of SR-tree and X-tree. |
| |
| Keywords: | multi-dimensional super-sphere super-rectangle super-node |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
