Continuous K-Nearest neighbor query for moving objects with uncertain velocity

Yuan Ko Huang, Chao Chun Chen, Chiang Lee

研究成果: Article同行評審

19 引文 斯高帕斯(Scopus)


One of the most important queries in spatio-temporal databases that aim at managing moving objects efficiently is the continuous K-nearest neighbor (CK NN) query. A CKNN query is to retrieve the K-nearest neighbors (KNNs) of a moving user at each time instant within a user-given time interval [ts, te]. In this paper, we investigate how to process a CK NN query efficiently. Different from the previous related works, our work relieves the past assumption, that an object moves with a fixed velocity, by allowing that the velocity of the object can vary within a known range. Due to the introduction of this uncertainty on the velocity of each object, processing a CK NN query becomes much more complicated. We will discuss the complications incurred by this uncertainty and propose a cost-effective P2 KNN algorithm to find the objects that could be the KNNs at each time instant within the given query time interval. Besides, a probability-based model is designed to quantify the possibility of each object being one of the KNNs. Comprehensive experiments demonstrate the efficiency and the effectiveness of the proposed approach.

頁(從 - 到)1-25
出版狀態Published - 2009

All Science Journal Classification (ASJC) codes

  • 資訊系統
  • 地理、規劃與發展


深入研究「Continuous K-Nearest neighbor query for moving objects with uncertain velocity」主題。共同形成了獨特的指紋。