Saliwanchik, Lloyd & Eisenschenk
Efficient progressive continuous k-nearest neighbor query algorithm for moving objects with a tree-like index
Methods and systems for computing continuous k nearest neighbor (CkNN) queries in location based services for moving objects, to produce ordered kNN query results in a continuous and progressive manner, are provided. One method comprises receiving a continuous k nearest neighbor query, computing the initial set comprised of the k interest points nearest to the reference point and a set of remaining nodes stored in a distance-priority queue, generating and storing split points in a min-heap, iteratively moving current reference point to the nearest split point, swapping interest points, updating the corresponding split points in the min-heap, and reporting the kNN result progressively until a termination condition is reached.
The Florida International University Board of Trustees
G G G G G G G H
G06F G06F G06F G06K G06F G06K G06K H04W
inventional inventional inventional inventional inventional inventional inventional inventional
Naphtali Mingjin Tao Jahkell Weitong
Rishe Zhang Li Lazarre Liu