Scalable content-based ranking in P2P information retrieval

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Numerous retrieval models have been defined within the field of information retrieval (IR) to produce a ranked and ordered list of documents relevant to a given query. Existing models are in general well-explored and thoroughly evaluated using traditionally centralized IR engines. However, the problem of producing global relevance scores to enable document ranking in peer-to-peer (P2P) IR systems has largely been neglected. Traditional ranking models in general require global document collection metrics such as document frequency, average document length, or the number of collection documents, which are not readily available in P2P IR systems. In this paper, we present a scalable solution for content-based ranking using global relevance scores in P2P IR systems that has been implemented as a part of ALVIS PEERS, a full-text IR engine developed for structured P2P networks. The provided experimental results show efficient and scalable performance of here proposed ranking implementation. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Puh, M., Luu, T., Podnar Zarko, I., & Rajman, M. (2008). Scalable content-based ranking in P2P information retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5177 LNAI, pp. 633–640). Springer Verlag. https://doi.org/10.1007/978-3-540-85563-7_80

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free