Performance evaluation of tree-based structures

  • Nguyen Tran
  • Dung Phu Le
  • Bala Srinivasan
  • Bob Sier
Physical Aspects 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)


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.


Leaf Node Active Dimension Indexing Technique Space Utilisation Node Access 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bay72]
    R. Bayer, E. McCreight, “Organisation and Maintenance of Large Ordered Indexed”, Acta Informatica, vol 1, no 3, Feb 1972.Google Scholar
  2. [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
  3. [E1N89]
    R. Elmasri and S. Navathe, “Fundamentals of Database Systems”, The Benjamin/Cummings Publishing Comp., Inc., CA, USA, 1989, 114–132.Google Scholar
  4. [FiB74]
    R.A. Finkel, J. L. Bentley, Quad trees: “A Data Structure for Retrieval on Composite Keys”, Acta Inf. 4, 1974, 1–9.CrossRefGoogle Scholar
  5. [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
  6. [GuB90]
    O. Gunther and A. Buchemann, “Research Issues in Spatial Databases”, ACM SIGMOD Record, vol 19, no 4, Dec 1988, 61–68.CrossRefGoogle Scholar
  7. [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
  8. [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
  9. [Sam90]
    H. Samet, “The Design and Analysis of Spatial Data Structure”, Addison-Wesley, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Nguyen Tran
    • 1
  • Dung Phu Le
    • 1
  • Bala Srinivasan
    • 1
  • Bob Sier
    • 1
  1. 1.Department of Computer TechnologyMonash UniversityAustralia

Personalised recommendations