純Peer to Peer環(huán)境下有效的Top-k查詢
發(fā)布時間:2019-03-05 11:24
【摘要】:目前大多數(shù)的Peer-to-Peer(P2P)系統(tǒng)只支持基于文件標識的搜索,用戶不能根據(jù)文件的內(nèi)容進行搜索.Top-k查詢被廣泛地應(yīng)用于搜索引擎中,獲得了巨大的成功.可是,由于P2P系統(tǒng)是一個動態(tài)的、分散的系統(tǒng),在純的P2P環(huán)境下進行top-k查詢是具有挑戰(zhàn)性的.提出了一種基于直方圖的分層top-k查詢算法.首先,采用層次化的方法實現(xiàn)分布式的top-k查詢,將結(jié)果的合并和排序分散到P2P網(wǎng)絡(luò)中的各個節(jié)點上,充分利用了網(wǎng)絡(luò)中的資源.其次,根據(jù)節(jié)點返回的結(jié)果為節(jié)點構(gòu)建直方圖,利用直方圖估計節(jié)點可能的分數(shù)上限,對節(jié)點進行選擇,提高了查詢效率.實驗證明,top-k查詢提高了查詢效果,而直方圖則提高了查詢效率.
[Abstract]:At present, most Peer-to-Peer (P2P) systems only support search based on file identification, and users can not search according to the contents of files. Top-k query has been widely used in search engines and has achieved great success. However, because P2P system is a dynamic and decentralized system, it is challenging to carry out top-k query in pure P2P environment. A hierarchical top-k query algorithm based on histogram is proposed. Firstly, a hierarchical approach is used to implement distributed top-k query, and the merging and sorting of the results are dispersed to each node in P2P network, which makes full use of the resources in the network. Secondly, the histogram is constructed for the node according to the result returned by the node, and the upper limit of the possible score of the node is estimated by using the histogram to select the node, which improves the efficiency of the query. Experimental results show that top-k query improves the query efficiency, while histogram improves the query efficiency.
【作者單位】: 中國人民大學(xué)信息學(xué)院 中國人民大學(xué)信息學(xué)院 中國人民大學(xué)信息學(xué)院
【基金】:國家自然科學(xué)基金 國家高技術(shù)研究發(fā)展計劃(863) 國家重點基礎(chǔ)研究發(fā)展規(guī)劃(973) 北京市科技計劃重大項目~~
【分類號】:TP393.09
[Abstract]:At present, most Peer-to-Peer (P2P) systems only support search based on file identification, and users can not search according to the contents of files. Top-k query has been widely used in search engines and has achieved great success. However, because P2P system is a dynamic and decentralized system, it is challenging to carry out top-k query in pure P2P environment. A hierarchical top-k query algorithm based on histogram is proposed. Firstly, a hierarchical approach is used to implement distributed top-k query, and the merging and sorting of the results are dispersed to each node in P2P network, which makes full use of the resources in the network. Secondly, the histogram is constructed for the node according to the result returned by the node, and the upper limit of the possible score of the node is estimated by using the histogram to select the node, which improves the efficiency of the query. Experimental results show that top-k query improves the query efficiency, while histogram improves the query efficiency.
【作者單位】: 中國人民大學(xué)信息學(xué)院 中國人民大學(xué)信息學(xué)院 中國人民大學(xué)信息學(xué)院
【基金】:國家自然科學(xué)基金 國家高技術(shù)研究發(fā)展計劃(863) 國家重點基礎(chǔ)研究發(fā)展規(guī)劃(973) 北京市科技計劃重大項目~~
【分類號】:TP393.09
【參考文獻】
相關(guān)期刊論文 前1條
1 黃維雄,黃銘鈞,陳建利,王曉宇,凌波,周傲英;一種基于自配置策略的新型Peer to Peer平臺系統(tǒng)[J];軟件學(xué)報;2003年02期
【共引文獻】
相關(guān)期刊論文 前10條
1 蔡銘;孫樂昌;潘祖烈;姜欣;李永祥;;利用智能疫苗防治多網(wǎng)絡(luò)蠕蟲的方法[J];北京郵電大學(xué)學(xué)報;2007年02期
2 茅洪波,于萬波,魏小鵬,姜麗麗;BDI agent導(dǎo)引修改機制用于Peer to Peer系統(tǒng)文件操作[J];大連理工大學(xué)學(xué)報;2003年S1期
3 聶榮;張洪欣;呂英華;雷振明;;P2P網(wǎng)絡(luò)的研究與進展(下)[J];電信科學(xué);2008年04期
4 姜靈;李紹滋;;一種混合式P2P文件共享與檢索模型[J];福建電腦;2007年03期
5 唐九陽;葛斌;張,
本文編號:2434852
本文鏈接:http://sikaile.net/kejilunwen/sousuoyinqinglunwen/2434852.html
最近更新
教材專著