Closest pair queries in spatial databases

  • Authors:

  • Antonio Corral;Yannis Manolopoulos;Yannis Theodoridis;Michael Vassilakopoulos

  • Affiliations:

  • Dept.of Languages Computation, University of Almeria, 04120 Almeria, Spain.;Data Eng.Lab, Dept.of Informatic, Aristotic University, of Thessaloniki, GR-54006 Greece;Computer Technology, Institute, P.O.Box 1122, GR-26110 Patras, Greece;Data Eng.Lab, Dept.of Informatic, Aristotic University, of Thessaloniki, GR-54006 Greece

  • Venue:
  • SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five different algorithms (four recursive and one iterative) are presented for solving this problem. The case of 1 closest pair is treated as a special case. An extensive study, based on experiments performed with synthetic as well as with real point data sets, is presented. A wide range of values for the basic parameters affecting the performance of the algorithms, especially the effect of overlap between the two data sets, is explored. Moreover, an algorithmic as well as an experimental comparison with existing incremental algorithms addressing the same problem is presented. In most settings, the new algorithms proposed clearly outperform the existing ones.