Continuous K-nearest neighbor query over moving objects in road networks

Yuan Ko Huang; Zhi Wei Chen; Chiang Lee

doi:10.1007/978-3-642-00672-2_5

Continuous K-nearest neighbor query over moving objects in road networks

Yuan Ko Huang, Zhi Wei Chen, Chiang Lee

資訊工程學系

研究成果: Conference contribution

35 引文斯高帕斯（Scopus）

摘要

Continuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal queries. A CKNN query is to find among all moving objects the K-nearest neighbors (KNNs) of a moving query object at each timestamp. In this paper, we focus on processing such a CKNN query in road networks, where the criterion for determining the KNNs 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.

原文	English
主出版物標題	Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings
發行者	Springer Verlag
頁面	27-38
頁數	12
ISBN（列印）	9783642006715
DOIs	https://doi.org/10.1007/978-3-642-00672-2_5
出版狀態	Published - 2009
事件	Joint International Conference on Advances in Data and Web Management, APWeb/WAIM 2009 - Suzhou, China 持續時間: 2009 4月 2 → 2009 4月 4

出版系列

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

Other

Other	Joint International Conference on Advances in Data and Web Management, APWeb/WAIM 2009
國家/地區	China
城市	Suzhou
期間	09-04-02 → 09-04-04

All Science Journal Classification (ASJC) codes

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

存取文件

10.1007/978-3-642-00672-2_5

其它文件與鏈接

引用此

Huang, Y. K., Chen, Z. W., & Lee, C. (2009). Continuous K-nearest neighbor query over moving objects in road networks. 於 Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings (頁 27-38). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 5446). Springer Verlag. https://doi.org/10.1007/978-3-642-00672-2_5

Huang, Yuan Ko ; Chen, Zhi Wei ; Lee, Chiang. / Continuous K-nearest neighbor query over moving objects in road networks. Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings. Springer Verlag, 2009. 頁 27-38 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cd3875c4ba45428696f0bdd31cafac3f,

title = "Continuous K-nearest neighbor query over moving objects in road networks",

abstract = "Continuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal queries. A CKNN query is to find among all moving objects the K-nearest neighbors (KNNs) of a moving query object at each timestamp. In this paper, we focus on processing such a CKNN query in road networks, where the criterion for determining the KNNs 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.",

author = "Huang, {Yuan Ko} and Chen, {Zhi Wei} and Chiang Lee",

year = "2009",

doi = "10.1007/978-3-642-00672-2_5",

language = "English",

isbn = "9783642006715",

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

publisher = "Springer Verlag",

pages = "27--38",

booktitle = "Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings",

address = "Germany",

note = "Joint International Conference on Advances in Data and Web Management, APWeb/WAIM 2009 ; Conference date: 02-04-2009 Through 04-04-2009",

}

Huang, YK, Chen, ZW & Lee, C 2009, Continuous K-nearest neighbor query over moving objects in road networks. 於 Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 卷 5446, Springer Verlag, 頁 27-38, Joint International Conference on Advances in Data and Web Management, APWeb/WAIM 2009, Suzhou, China, 09-04-02. https://doi.org/10.1007/978-3-642-00672-2_5

Continuous K-nearest neighbor query over moving objects in road networks. / Huang, Yuan Ko; Chen, Zhi Wei; Lee, Chiang.
Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings. Springer Verlag, 2009. p. 27-38 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 5446).

研究成果: Conference contribution

TY - GEN

T1 - Continuous K-nearest neighbor query over moving objects in road networks

AU - Huang, Yuan Ko

AU - Chen, Zhi Wei

AU - Lee, Chiang

PY - 2009

Y1 - 2009

N2 - Continuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal queries. A CKNN query is to find among all moving objects the K-nearest neighbors (KNNs) of a moving query object at each timestamp. In this paper, we focus on processing such a CKNN query in road networks, where the criterion for determining the KNNs 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.

AB - Continuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal queries. A CKNN query is to find among all moving objects the K-nearest neighbors (KNNs) of a moving query object at each timestamp. In this paper, we focus on processing such a CKNN query in road networks, where the criterion for determining the KNNs 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.

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

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

U2 - 10.1007/978-3-642-00672-2_5

DO - 10.1007/978-3-642-00672-2_5

M3 - Conference contribution

AN - SCOPUS:67649974533

SN - 9783642006715

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

SP - 27

EP - 38

BT - Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings

PB - Springer Verlag

T2 - Joint International Conference on Advances in Data and Web Management, APWeb/WAIM 2009

Y2 - 2 April 2009 through 4 April 2009

ER -

Huang YK, Chen ZW, Lee C. Continuous K-nearest neighbor query over moving objects in road networks. 於 Advances in Data and Web Management - Joint International Conferences, APWeb/WAIM 2009, Proceedings. Springer Verlag. 2009. p. 27-38. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-00672-2_5

Continuous K-nearest neighbor query over moving objects in road networks

摘要

出版系列

Other

All Science Journal Classification (ASJC) codes

存取文件

其它文件與鏈接

指紋

引用此