%0 Journal Article
%T Top-k probabilistic mutual nearest neighbor query on uncertain data<br>基于不确定数据的top-k概率相互最近邻查询*
%A LIANG Yu
%A ZHANG Yan
%A ZHOU Song
%A BAI Wen-yang
%A <br>梁瑜
%A 张剡
%A 周嵩
%A 柏文阳
%J 计算机应用研究
%D 2011
%I 
%X Probabilistic mutual nearest neighbors query has important practical applications,but there are few researches about this problem so far.This paper proposed an algorithm to find the top-k probabilistic mutual nearest neighbors on uncertain data.First,described and formalized the problem.Second,proposed some pruning rules to cut some instances that were not need to be accessed in the query object.As the experimental results show that this algorithm can reduce the I/O cost effectively,and improve the response...
%K spatial query
%K uncertain data
%K mutual nearest neighbor
%K reverse nearest neighbor
%K query processing<br>空间查询
%K 不确定数据
%K 概率相互最近邻
%K 反向最近邻
%K 查询处理
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1F8EB868F38CE0726B41AA2E5FBD8D80&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=DF92D298D3FF1E6E&sid=BD645585791E8E29&eid=C517778D8EA6C920&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=14