ESR-Tree:一种多维对象的动态索引方法  

ESR-Tree: a dynamic index for multi-dimensional objects

作　　者：徐焕[1] 林坤辉[1] 

机构地区：[1]厦门大学软件学院,福建厦门361005

出　　处：《计算机应用》2005年第12期2872-2874,2878,共4页journal of Computer Applications

基　　金："985工程"智能化国防信息安全技术资助项目

摘　　要：在研究SR-tree(Sphere/Rectangle-tree)和X-tree(eXtendednodetree)的结构与性能的基础上,针对SR-tree分裂算法的不足,改进了分裂算法,结合两者的优点,设计了一种新的多维索引结构ESR-tree(ExtendedSR-tree)。实验表明,随着数据量和维数的增多,ESR-tree的性能要优于SR-tree和X-tree。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.

关 键 词：多维索引 超球体 超矩形 超级节点 

分 类 号：TP311.134.3[自动化与计算机技术—计算机软件与理论]