A novel ranking strategy in hybrid peer-to-peer networks

Authors:
Qian Zhang;Zheng Liu;Xia Zhang;Xuezhi Wen;Yu Sun
Affiliations:
National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 5
Cited 1

Searching distributed collections with inference networks

SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Cluster-based language models for distributed retrieval

Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Real life, real users, and real needs: a study and analysis of user queries on the web

Information Processing and Management: an International Journal
Generalizing GlOSS to Vector-Space Databases and Broker Hierarchies

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Merging retrieval results in hierarchical peer-to-peer networks

Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval

Novel applications of information retrieval techniques to peer-to-peer file-sharing systems

P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The state of the art of hybrid P2P-based information retrieval is still at its infant stage and confronted with many challenges. One of the most urgent problems is how to combine the retrieval results from different neighboring nodes into a single, integrated ranked list. In this paper, we propose a result merging algorithm to address the challenge. Our algorithm is deterministic and doesn’t require neighboring nodes to provide any information for result merging, which makes it different from other algorithms that require cooperation from neighboring nodes. A variety of experiments demonstrate that the new approach is effective.