Processing Bounded Nearest Neighbor Query for Moving Object

This paper presented a new kind of query, bounded nearest neighbors query, which is based on a special distance, bounded distance, between two objects during given time interval. According to the relationship with continuous nearest neighbor query, a native algorithm is proposed. Based on branch and bound technique and proposed updating and visiting heuristics, recursive depth-first and heap-based best-first query processing algorithms are developed. An extensive study based on experiments performed with synthetic data sets show that the best-first algorithms outperforms the depth-first algorithms.