ESR-Tree: a dynamic index for multi-dimensional objects
ESR-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.