不确定对象的反向最近邻查询研究

Research on reverse nearest neighbor query on uncertain object

确定对象在空间数据库研究中受到人们的重视,不确定对象的反向最近邻研究成为研究热点。文中给出不确定对象反向最近邻查询的形式化表示,将其称为可能反向最近邻查询,即为检索所有可能成为给定不确定对象的反向最近邻的可能性大于给定阈值的不确定性对象。提出基于各种剪枝规则的算法,解决多维不确定对象的可能反向最近邻查询问题。

The certain object tends to be more important in the spatial database field.Reverse nearest neighbor research on uncertain object is a research focus.Probabilistic reverse nearest neighbor query is formalized to retrieve the objects from the uncertain data that has higher probability than a given threshold to be the RNN of an uncertain query object.An efficient algorithm is provided based on various novel pruning approaches to answer the probabilistic RNN queries on multidimensional uncertain data.