摘要
给出了概率查询的分类,描述了最近邻查询及其基于R-树的深度优先算法,针对此算法的不足,提出了对mindist的改进以完成移动对象的最近邻查询。
This paper gives the classification of the probabilistic query,describes the nearest neighbor query and algorithm of R-Tree-Based depth-first.For the shortcomings of this algorithm,an improved mindist is presented to accomplish the nearest neighbor query of moving objects.
出处
《计算机与数字工程》
2011年第2期26-28,51,共4页
Computer & Digital Engineering
关键词
概率查询
最近邻查询
距离度量
probabilistic query
nearest neighbor query
distance measurement
