Performance evaluation of tree-based structures
Tree-based spatial indexing techniques have been developed for advanced applications which require high dimensional data. However, studies on spatial access methods particularly focus on the data structures and algorithms, performances in the worst case may not be predicted. In this paper, we propose a methodology for evaluating the performance of tree-based indexing techniques in the worst case, and a new tree-based data structure for indexing. The methodology allows better selection of indexing techniques for applications without having to actually implementing and experimenting the techniques. The new tree-based structure allows more efficient storage space utilisation and better searching time in comparison to the R-tree and TV-tree.
KeywordsLeaf Node Active Dimension Indexing Technique Space Utilisation Node Access
Unable to display preview. Download preview PDF.
- [Bay72]R. Bayer, E. McCreight, “Organisation and Maintenance of Large Ordered Indexed”, Acta Informatica, vol 1, no 3, Feb 1972.Google Scholar
- [Bec90]N. Beckmanm, The R*-tree: “An Efficient and Robust Access Method for Points and Rectangles”, in Proc. ACM SIGMOD, 1990, 322–331.Google Scholar
- [E1N89]R. Elmasri and S. Navathe, “Fundamentals of Database Systems”, The Benjamin/Cummings Publishing Comp., Inc., CA, USA, 1989, 114–132.Google Scholar
- [Gre89]D. Greence, “An Implementation and Performance Analysis of Spatial Data Access Method”, in Proc. 5Th Data Engineering Conf. Los Angeles, CA, Feb 1989, 606–615.Google Scholar
- [Gut84]A. Guttman. R-tree: “A Dynamic Index Structure for Spatial Searching”, in Proc. of ACM/SIGMOD Annual Conf. on Management of Data, Boston, MA, Jun 1984, 47–57.Google Scholar
- [LiJF94]K. Lin, H. V. Jagadish, C. Faloutsos, “The TV-Tree — An Index Structure for High Dimensional Data”, VLDB Journal, Oct 1994, 517–542.Google Scholar
- [Sam90]H. Samet, “The Design and Analysis of Spatial Data Structure”, Addison-Wesley, 1990.Google Scholar