首页>
外国专利>
Efficient progressive continuous k-nearest neighbor query algorithm for moving objects with a tree-like index
Efficient progressive continuous k-nearest neighbor query algorithm for moving objects with a tree-like index
展开▼
机译:具有树状索引的运动物体的高效渐进连续k近邻查询算法
展开▼
页面导航
摘要
著录项
相似文献
摘要
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.
展开▼