Efficient continuous K-nearest neighbor query processing over moving objects with uncertain speed and direction

Yuan Ko Huang, Shi Jei Liao, Chiang Lee

研究成果: Conference contribution

9 引文 斯高帕斯(Scopus)

摘要

One of the important types of queries in spatio-temporal databases is the Continuous K-Nearest Neighbor (CKNN) query, which is to find among all moving objects the K-Nearest Neighbors (KNNs) of a mobile user at each time instant within a user-given time interval [t s , t e ]. In this paper, we focus on how to process such a CKNN query efficiently when the moving speed and direction of each moving object are uncertain. We thoroughly analyze the complicated problems incurred by this uncertainty and propose a Continuous PKNN (CPKNN) algorithm to effectively tackle these problems.

原文English
主出版物標題Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings
頁面549-557
頁數9
DOIs
出版狀態Published - 2008 8月 14
事件20th International Conference on Scientific and Statistical Database Management, SSDBM 2008 - Hong Kong, China
持續時間: 2008 7月 92008 7月 11

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5069 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Other

Other20th International Conference on Scientific and Statistical Database Management, SSDBM 2008
國家/地區China
城市Hong Kong
期間08-07-0908-07-11

All Science Journal Classification (ASJC) codes

  • 理論電腦科學
  • 一般電腦科學

指紋

深入研究「Efficient continuous K-nearest neighbor query processing over moving objects with uncertain speed and direction」主題。共同形成了獨特的指紋。

引用此