Skip to main content
Article thumbnail
Location of Repository

Algorithm for Layered Sorting and Merging of P2P Information Retrieval

By Yi-hong Tan and Ya-ping Lin

Abstract

Due to the intrinsic characteristics, P2P information retrieval has faced quite a few challenges, and it is one of the urgent problems how to sort and merge the retrieval results from multiple nodes. For this reason, we propose a novel algorithm for layered sorting and merging of P2P information retrieval. In the proposed approach, the query submitting node submits the query string to the nodes that more probably acquires retrieval results. These nodes accept query request, sort the retrieval results in the descending order of similarities with traditional sorting method and select top-k documents to send to the query requesting node, and then the query submitting node execute sorting and merging. The final experimental results suggest that our proposed approach is feasible, correct and valid. Key words

Topics: Information Retrieval, Sorting, Merging, Peer-to-Peer
Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.3404
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://paper.ijcsns.org/07_boo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.