Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks

  • Authors:
  • Yuan-Ko Huang;Zhi-Wei Chen;Chiang Lee

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C.

  • Venue:
  • APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Continuous K -Nearest Neighbor (CK NN) query is an important type of spatio-temporal queries. A CK NN query is to find among all moving objects the K -nearest neighbors (K NNs) of a moving query object at each timestamp. In this paper, we focus on processing such a CK NN query in road networks, where the criterion for determining the K NNs is the shortest network distance between objects. We first highlight the limitations of the existing approaches, and then propose a cost-effective algorithm, namely the Continuous KNN algorithm , to overcome these limitations. Comprehensive experiments are conducted to demonstrate the efficiency of the proposed approach.