Analysis of nearest neighbor query performance in multidimensional index structures

  • Guang-Ho Cha
  • Ho-Hyun Park
  • Chin-Wan Chung
Optimization Performance
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1308)


A frequently encountered type of query in geographic information systems and multimedia database systems is to find k nearest neighbors to a given point in a multidimensional space. Examples would be to find the nearest bus stop to a given location or to find some most similar images when an image is given. In this paper, we develop an analytic formula that estimates the performance for nearest neighbor queries and characterize the efficiency of multidimensional index structures for nearest neighbor queries. The developed formula can be used directly in the query optimizers and the characteristics of efficiency will become the basis for the design of the index structure. Experimental results show that our analytic formula is accurate within some acceptable error range. It is exhibited that the efficiency of the index structure depends on the storage utilization and the directory coverage of it.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Brin, “Near Neighbor Search in Large Metric Spaces,” Proc. of the 21 th Int'l. Conf on VLDB, pp. 574–584, 1995.Google Scholar
  2. [2]
    G.-H. Cha and C.-W. Chung, “HG-tree: An Index Structure for Multimedia Databases,” Proc. of the IEEE Int'l. Conf on Multimedia Computing and Systems, pp. 449–452, June 1996.Google Scholar
  3. [3]
    T. Chiueh, “Content-Based Image Indexing,” Proc. of the 20'h Int'l. Conf. on VLDB, pp. 582–593, 1994.Google Scholar
  4. [4]
    C. Faloutsos and I. Kamel, “Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension,” Proc. of the 13'h ACM Symposium on Principles of Database Systems, pp. 4–13, 1994.Google Scholar
  5. [5]
    A. Guttman, “R-trees: a dynamic index structures for spatial searching,” Proc. of the ACM SIGMOD Int'l. Conf. on Management of Data, pp. 47–57,1984.Google Scholar
  6. [6]
    B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer, “Towards an Analysis of Range Query Performance in Spatial Data Structures,” Proc. of the 12'h ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 214–221, 1993.Google Scholar
  7. [7]
    N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. of the ACMSIGMOD Int'l. Conf on Management of Data, pp. 71–79, 1995.Google Scholar
  8. [8]
    B. Seeger and H.-P. Kriegel, “The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems,” Proc. of the 16'h Int'l. Conf. on VLDB, pp. 590–601, 1990.Google Scholar
  9. [9]
    Y. Theodoridis and T. Sellis, “A Model for Prediction of R-tree Performance,” Proc. of the 16 'h ACM SIGART-SIDMOD-SIGART Symposium on Principles of Database Systems, pp. 161–169, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Guang-Ho Cha
    • 1
  • Ho-Hyun Park
    • 2
  • Chin-Wan Chung
    • 2
  1. 1.Dept. of Multimedia EngineeringTongmyong University of Information TechnologyPusanSouth Korea
  2. 2.Dept. of Computer ScienceKorea Advanced Institute of Science and TechnologyTaejonSouth Korea

Personalised recommendations