A threshold-based algorithm for continuous monitoring of k nearest neighbors
Citations Over TimeTop 10% of 2005 papers
Abstract
Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could constantly obtain the most recent position of all objects. However, this naive solution requires the transmission of a large number of rapid data streams corresponding to location updates. Intuitively, current information is necessary only for objects that may influence some query result (i.e., they may be included in the nearest neighbor set of some client). Motivated by this observation, we present a threshold-based algorithm for the continuous monitoring of nearest neighbors that minimizes the communication overhead between the server and the data objects. The proposed method can be used with multiple, static, or moving queries, for any distance definition, and does not require additional knowledge (e.g., velocity vectors) besides object locations.
Related Papers
- → Depth-first k-nearest neighbor finding using the MaxNearestDist estimator(2004)19 cited
- Approximate Nearest Neighbor Queries among Parallel Segments(2010)
- → Effective nearest neighbor indexing with the euclidean metric(2001)2 cited
- → Aren't we all nearest neighbors: Spatial trees, high dimensional reductions and batch nearest neighbor search(2015)
- An Approximate k-Nearest Neighbor Search Algorithm for Content- Based Multimedia Information Retrieval(2000)