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

摘要

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{sub}s, t{sub}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.