Efficient Continuous K-Nearest Neighbor Query Processing over Moving Objects with Uncertain Speed and Direction

Authors:
Yuan-Ko Huang;Shi-Jei Liao;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:
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Year:
2008

Citing 10
Cited 0

Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Time-parameterized queries in spatio-temporal databases

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
K-Nearest Neighbor Search for Moving Query Point

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Fast Nearest-Neighbor Query Processing in Moving-Object Databases

Geoinformatica
Monitoring k-Nearest Neighbor Queries over Moving Objects

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Continuous K-Nearest Neighbor Query for Moving Objects with Uncertain Velocity

Geoinformatica

Quantified Score

Hi-index	0.00

Visualization

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 [ts, te]. In this paper, we focus on how to process such a CKNN query efficiently when the moving speedand directionof each moving object are uncertain. We thoroughly analyze the complicated problems incurred by this uncertainty and propose a Continuous PKNN(CPKNN)algorithmto effectively tackle these problems.