Geodetic Distance Queries on R-Trees for Indexing Geographic Data

  • Erich Schubert
  • Arthur Zimek
  • Hans-Peter Kriegel
Conference paper

DOI: 10.1007/978-3-642-40235-7_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8098)
Cite this paper as:
Schubert E., Zimek A., Kriegel HP. (2013) Geodetic Distance Queries on R-Trees for Indexing Geographic Data. In: Nascimento M.A. et al. (eds) Advances in Spatial and Temporal Databases. SSTD 2013. Lecture Notes in Computer Science, vol 8098. Springer, Berlin, Heidelberg

Abstract

Geographic data have become abundantly available in the recent years due to the widespread deployment of GPS devices for example in mobile phones. At the same time, the data covered are no longer restricted to the local area of a single application, but often span the whole world. However, we do still use very rough approximations when indexing these data, which are usually stored and indexed using an equirectangular projection. When distances are measured using Euclidean distance in this projection, a non-neglibile error may occur. Databases are lacking good support for accelerated nearest neighbor queries and range queries in such datasets for the much more appropriate geodetic (great-circle) distance. In this article, we will show two approaches how a widely known spatial index structure – the R-tree – can be easily used for nearest neighbor queries with the geodetic distance, with no changes to the actual index structure. This allows existing database indexes immediately to be used with low distortion and highly efficient nearest neighbor queries and radius queries as well as window queries.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Erich Schubert
    • 1
  • Arthur Zimek
    • 1
  • Hans-Peter Kriegel
    • 1
  1. 1.Ludwig-Maximilians-Universität MünchenMünchenGermany

Personalised recommendations