概率查询及其算法研究

摘要

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.%给出了概率查询的分类,描述了最近邻查询及其基于R-树的深度优先算法,针对此算法的不足,提出了对mindist的改进以完成移动对象的最近邻查询.