Performance of nearest neighbor queries in R-trees

  • Apostolos Papadopoulos
  • Yannis Manolopoulos
Contributed Papers Session 9: Access Methods
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1186)


Nearest neighbor (NN) queries are posed very frequently in spatial applications. Recently a branch- and-bound algorithm based on R-trees has been developed in order to answer efficiently NN queries. In this paper, we combine techniques that were inherently used for the analysis of range and spatial join queries, in order to derive measures regarding the performance of NN queries. We try to estimate the number of disk accesses introduced due to the processing of an NN query. Lower and upper bounds are defined estimating the performance of NN queries very closely. The theoretical analysis is verified with experimental results, under uniform and non-uniform distributions of queries and data, in the 2-dimensional address space.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aref93]
    W. Aref: “Query Processing and Optimization in Spatial Databases”, Technical Report CS-TR-3097, Department of Computer Science, University of Maryland at College Park, MD, 1993.Google Scholar
  2. [Arya93]
    M. Arya, W. Cody, C. Faloutsos, J. Richardson and A. Toga: “QBISM: a Prototype 3-d Medical Image Database System”, IEEE Data Engineering Bulletin, 16(1), pp.38–42, March 1993.Google Scholar
  3. [Beck90]
    N. Beckmann, H.P. Kriegel and B. Seeger: “The R*-tree: an Efficient and Robust Method for Points and Rectangles”, Proceedings of the 1990 ACM SIGMOD Conference, pp.322–331, Atlantic City, NJ, 1990.Google Scholar
  4. [Belu95]
    A. Belussi and C. Faloutsos: “Estimating the Selectivity of Spatial Queries Using the ‘Correlation’ Fractal Dimension”, Proceedings of the 21th VLDB Conference, pp.299–310, Zurich, Switzerland, 1995.Google Scholar
  5. [Brin93]
    T. Brinkhoff, H.P. Kriegel and B. Seeger: “Efficient Processing of Spatial Join Using R-trees”, Proceedings of the 1990 ACM SIGMOD Conference, pp.237–246, Washington DC, 1993.Google Scholar
  6. [Egen94]
    M. Egenhofer: “Spatial SQL: a Query and Presentation Language”, IEEE Transactions on Knowledge and Data Engineering, vol.6, no.1, pp.86–95, 1994.Google Scholar
  7. [Fagi96]
    R. Fagin: “Combining Fuzzy Information from Multiple Systems”, Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '96), pp.216–226, Montreal, Canada, 1996.Google Scholar
  8. [Fal94]
    C. Faloutsos and I. Kamel: “Beyond Uniformity and Independence, Analysis of R-trees Using the Concept of Fractal Dimension”, Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '94), pp.4–13, Minneapolis, MN, 1994.Google Scholar
  9. [Frie77]
    J.H. Friedman, J.L. Bentley and R.A. Finkel: “An Algorithm for Finding the Best Matches in Logarithmic Expected Time”, ACM Transactions on Math. Software, vol.3, pp.209–226, 1977.Google Scholar
  10. [Guen89]
    O. Guenther: “The Design of the Cell Tree: an Object-Oriented Index Structure for Geometric Databases”, Proceedings of the 5th IEEE Conference on Data Engineering, pp.598–615, Los Angeles, CA, 1989.Google Scholar
  11. [Guti94]
    R.H. Guting: “An Introduction to Spatial Database Systems”, The VLDB Journal, vol.3, no.4, pp.357–399, 1994.Google Scholar
  12. [Gutt84]
    A. Guttman: “R-trees: a Dynamic Index Structure for Spatial Searching”, Proceedings of the 1984 ACM SIGMOD Conference, pp.47–57, Boston, MA, 1984.Google Scholar
  13. [Henr89]
    A. Henrich, H.W. Six and P. Widmayer: “The LSD-tree: Spatial Access to Multidimensional Point and non-Point Objects”, Proceedings of the 15th VLDB Conference, pp.45–53, Amsterdam, Netherlands, 1989.Google Scholar
  14. [Kame93]
    I. Kamel and C. Faloutsos: “On Packing R-trees”, Proceedings of the 2nd Conference on Information and Knowledge Management (CIKM), Washington DC 1993.Google Scholar
  15. [Kame94]
    I. Kamel and C. Faloutsos: “Hilbert R-tree: an Improved R-tree Using Fractals”, Proceedings of the 20th VLDB Conference, pp.500–509, Santiago, Chile, 1994.Google Scholar
  16. [Laur92]
    R. Laurini and D. Thompson: “Fundamentals of Spatial Information Systems”, Academic Press, London, 1992.Google Scholar
  17. [LoRa94]
    M.L. Lo and C.V. Ravishankar: “Spatial Joins Using Seeded Trees”, Proceedings of the 1994 ACM SIGMOD Conference, pp.209–220, Minneapolis MN 1994.Google Scholar
  18. [Nibl93]
    W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic and P. Yanker: “The QBIC Project: Querying Images by Content Using Color, Texture and Shape”, Proceedings of the SPIE Conference on Storage and Retrieval for Image and Video Databases, vol.1908, pp.173–187, 1993.Google Scholar
  19. [Oren86]
    J. Orenstein: “Spatial Query Processing in an Object-Oriented Database System”, Proceedings of the 1986 ACM SIGMOD Conference, pp.326–336, Washington DC, 1986.Google Scholar
  20. [Page93]
    B.U. Pagel, H.W. Six, H. Toben and P. Widmayer: “Towards an Analysis of Range Query Performance in Spatial Data Structures”, Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '93), pp.214–221, Washington DC, 1993.Google Scholar
  21. [Papa95]
    A. Papadopoulos and Y. Manolopoulos: “Multiple Range Query Optimization in Spatial Databases”, Information Systems, submitted.Google Scholar
  22. [Rous85]
    N. Roussopoulos and D. Leifker: “Direct Spatial Search on Pictorial Databases Using Packed R-trees”, Proceedings of the 1985 ACM SIGMOD Conference, pp.17–31, Austin, TX, 1985.Google Scholar
  23. [Rous95]
    N. Roussopoulos, S. Kelley and P. Vincent: “Nearest Neighbor Queries”, Proceedings of the 1995 ACM SIGMOD Conference, pp.71–79, San Jose, CA, 1995.Google Scholar
  24. [Same90a]
    H. Samet: “The Design and Analysis of Spatial Data Structures”, Addison-Wesley, MA, 1990.Google Scholar
  25. [Same90b]
    H. Samet: “Applications of Spatial Data Structures: Computer Graphics, Image Processing and GIS”, Addison-Wesley, MA, 1990.Google Scholar
  26. [Sell87]
    T. Sellis, N. Roussopoulos and C. Faloutsos: “The R+-tree: a Dynamic Index for Multidimensional Objects”, Proceedings of the 13th VLDB Conference, pp.507–518, Brighton, UK, 1987.Google Scholar
  27. [Theo96]
    Y. Theodoridis and T. Sellis: “A Model for the Prediction of R-tree Performance”, Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '96), Montreal, Canada, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Apostolos Papadopoulos
    • 1
  • Yannis Manolopoulos
    • 1
  1. 1.Department of InformaticsAristotle UniversityThessalonikiGreece

Personalised recommendations