Monitoring Aggregate k-NN Objects in Road Networks

  • Authors:
  • Lu Qin;Jeffrey Xu Yu;Bolin Ding;Yoshiharu Ishikawa

  • Affiliations:
  • The Chinese University of Hong Kong, China;The Chinese University of Hong Kong, China;The Chinese University of Hong Kong, China;Nagoya University, Japan

  • Venue:
  • SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years, there is an increasing need to monitor knearest neighbor (k-NN) in a road network. There are existing solutions on either monitoring k-NN objects from a single query point over a road network, or computing the snapshot k-NN objects over a road network to minimize an aggregate distance function with respect to multiple query points. In this paper, we study a new problem that is to monitor k-NN objects over a road network from multiple query points to minimize an aggregate distance function with respect to the multiple query points. We call it a continuous aggregate k-NN (CANN) query. We propose a new approach that can significantly reduce the cost of computing network distances when monitoring aggregate k-NN objects on road networks. We conducted extensive experimental studies and confirmed the efficiency of our algorithms.