%0 Journal Article
%T Improve top-k query in peer-to-peer system<br>高P2P下top-k搜索性能的研究*
%A ZHANG Lian-kuan
%A YANG Bo
%A TANG Yi
%A <br>张连宽
%A 杨波
%A 唐屹
%J 计算机应用研究
%D 2009
%I 
%X This paper analysed the character of resource distributing in P2P system. According to the query, based on document match degree,proposed the concept of peer match degree, and based on peer match degree and small world character of resource,proposed a new arithmetic to search and rank resource.The arithmetic could search resource in all network, and make searching toward high matching degree field.The arithmetic ensure the resource, which selected at last, is top-k resource.According to the query,select peer match degree can balance bandwidth and computing power.
%K P2P system
%K top-k query
%K small world model
%K peer match degree<br>对等网络
%K top-k搜索
%K small
%K world模型
%K 节点匹配度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=F0ADBECC7FAD1D57CCA9B90E1DB9065B&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=CA4FD0336C81A37A&sid=30897FA31CA3354D&eid=FDC7AF55F77D8CD4&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=19