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

Yuan Ko Huang; Shi Jei Liao; Chiang Lee

doi:10.1007/978-3-540-69497-7_37

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

7 引文斯高帕斯（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	https://doi.org/10.1007/978-3-540-69497-7_37
出版狀態	Published - 2008 8月 14
事件	20th International Conference on Scientific and Statistical Database Management, SSDBM 2008 - Hong Kong, China 持續時間: 2008 7月 9 → 2008 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

Other	20th International Conference on Scientific and Statistical Database Management, SSDBM 2008
國家/地區	China
城市	Hong Kong
期間	08-07-09 → 08-07-11

All Science Journal Classification (ASJC) codes

理論電腦科學
電腦科學(全部)

存取文件

10.1007/978-3-540-69497-7_37

其它文件與鏈接

引用此

Huang, Y. K., Liao, S. J., & Lee, C. (2008). Efficient continuous K-nearest neighbor query processing over moving objects with uncertain speed and direction. 於 Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings (頁 549-557). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 5069 LNCS). https://doi.org/10.1007/978-3-540-69497-7_37

Huang, Yuan Ko ; Liao, Shi Jei ; Lee, Chiang. / Efficient continuous K-nearest neighbor query processing over moving objects with uncertain speed and direction. Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings. 2008. 頁 549-557 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cad533f05edf4a97abbb410eaee3d999,

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

abstract = "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.",

author = "Huang, {Yuan Ko} and Liao, {Shi Jei} and Chiang Lee",

year = "2008",

month = aug,

day = "14",

doi = "10.1007/978-3-540-69497-7_37",

language = "English",

isbn = "3540694765",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "549--557",

booktitle = "Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings",

note = "20th International Conference on Scientific and Statistical Database Management, SSDBM 2008 ; Conference date: 09-07-2008 Through 11-07-2008",

}

Huang, YK, Liao, SJ & Lee, C 2008, Efficient continuous K-nearest neighbor query processing over moving objects with uncertain speed and direction. 於 Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 卷 5069 LNCS, 頁 549-557, 20th International Conference on Scientific and Statistical Database Management, SSDBM 2008, Hong Kong, China, 08-07-09. https://doi.org/10.1007/978-3-540-69497-7_37

Efficient continuous K-nearest neighbor query processing over moving objects with uncertain speed and direction. / Huang, Yuan Ko; Liao, Shi Jei; Lee, Chiang.
Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings. 2008. p. 549-557 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 5069 LNCS).

研究成果: Conference contribution

TY - GEN

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

AU - Huang, Yuan Ko

AU - Liao, Shi Jei

AU - Lee, Chiang

PY - 2008/8/14

Y1 - 2008/8/14

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49049119939&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049119939&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69497-7_37

DO - 10.1007/978-3-540-69497-7_37

M3 - Conference contribution

AN - SCOPUS:49049119939

SN - 3540694765

SN - 9783540694762

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 549

EP - 557

BT - Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings

T2 - 20th International Conference on Scientific and Statistical Database Management, SSDBM 2008

Y2 - 9 July 2008 through 11 July 2008

ER -

Huang YK, Liao SJ, Lee C. Efficient continuous K-nearest neighbor query processing over moving objects with uncertain speed and direction. 於 Scientific and Statistical Database Management - 20th International Conference, SSDBM 2008, Proceedings. 2008. p. 549-557. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-69497-7_37

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

摘要

出版系列

Other

All Science Journal Classification (ASJC) codes

存取文件

其它文件與鏈接

指紋

引用此