Merging Retrieval Results in Peer-to-Peer Networks

摘要

P2P-based information retrieval is still at its infant stage and confronted with many challenges. And how to rank and merge the results retrieved from different peers is one of the most urgent problems, hi this paper, we propose a result merging algorithm to address the challenge. Our algorithm has the advantage of being simple, since as input it only uses result lengths and document ranks. First, we rank the results from each neighboring leaf node based on result lengths returned by them. Then we merge results retrieved from directory nodes. Our experiments demonstrate that the new approach is effective.