Data Management

Efficient Evaluation of K-NN Queries Using Spatial Mashups

Free registration required

Executive Summary

k-Nearest-Neighbor (k-NN) queries have been widely studied in time-independent and time-dependent spatial networks. In this paper, the authors focus on k-NN queries in time-dependent spatial networks where the driving time between two locations may vary significantly at different time of the day. In practice, it is costly for a database server to collect real-time traffic data from vehicles or roadside sensors to compute the best route from a user to an object of interest in terms of the driving time. Thus, they design a new spatial query processing paradigm that uses a spatial mashup to enable the database server to efficiently evaluate k-NN queries based on the route information accessed from an external Web mapping service, e.g., Google Maps, Yahoo! Maps and Microsoft Bing Maps.

  • Format: PDF
  • Size: 429.08 KB