A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases

  • Authors:

  • Cyrus Shahabi;Mohammad R. Kolahdouzan;Mehdi Sharifzadeh

  • Affiliations:

  • Department of Computer Science, University of Southern California, Los Angeles, California 90089 shahabi@usc.edu;Department of Computer Science, University of Southern California, Los Angeles, California 90089 kolahdoz@usc.edu;Department of Computer Science, University of Southern California, Los Angeles, California 90089 sharifza@usc.edu

  • Venue:
  • Geoinformatica
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A very important class of queries in GIS applications is the class of K-nearest neighbor queries. Most of the current studies on the K-nearest neighbor queries utilize spatial index structures and hence are based on the Euclidean distances between the points. In real-world road networks, however, the shortest distance between two points depends on the actual path connecting the points and cannot be computed accurately using one of the Minkowski metrics. Thus, the Euclidean distance may not properly approximate the real distance. In this paper, we apply an embedding technique to transform a road network to a high dimensional space in order to utilize computationally simple Minkowski metrics for distance measurement. Subsequently, we extend our approach to dynamically transform new points into the embedding space. Finally, we propose an efficient technique that can find the actual shortest path between two points in the original road network using only the embedding space. Our empirical experiments indicate that the Chessboard distance metric (L∞) in the embedding space preserves the ordering of the distances between a point and its neighbors more precisely as compared to the Euclidean distance in the original road network.