Efficient Evaluation of K-Range Nearest Neighbor Queries in Road Networks

Free registration required

Executive Summary

A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the network distance. The kRNN query is significantly important for location-based applications in many realistic scenarios. For example, the user's location is uncertain, i.e., user's location is modeled by a spatial region, and the user is not willing to reveal her exact location to preserve her privacy, i.e., her location is blurred into a spatial region. However, the existing solutions for kRNN queries simply apply the traditional k-nearest neighbor query processing algorithm multiple times, which poses a huge redundant searching overhead.

  • Format: PDF
  • Size: 347.4 KB