Efficient KNN processing over moving objects with uncertain velocity

Authors:
Yuan-Ko Huang;Chao-Chun Chen;Chiang Lee
Affiliations:
National Cheng-Kung University, Tainan, Taiwan, R.O.C.;Southern Taiwan University of Technology, Tainan, Taiwan, R.O.C.;National Cheng-Kung University, Tainan, Taiwan, R.O.C.
Venue:
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Year:
2007

Citing 8
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spatio-temporal databases aim at combining the spatial and temporal characteristics of data. The continuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal query that finds the K-Nearest Neighbors (KNNs) of a moving query object at each time instant within a given time interval [ts, te]. In this paper, we investigate how to process a CKNN query efficiently under the situation that each object moves with an uncertain velocity. This uncertainty on the velocity of each object inevitably results in high complexity of the CKNN problem. We propose a cost-effective PKNN algorithm to tackle the complicated problem incurred by this uncertainty.