Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

19797 Search Result Caching in Peer-to-Peer Information Retrieval Networks
Home Policy Brochure Browse Search User Area Contact Help

Tigelaar, A.S. and Hiemstra, D. and Trieschnigg, R.B. (2011) Search Result Caching in Peer-to-Peer Information Retrieval Networks. In: Multidisciplinary Information Retrieval, 6 Jun 2011, Vienna, Austria. pp. 134-148. Lecture Notes in Computer Science 6653. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-21352-6

Full text available as:

- Univ. of Twente only
326 Kb

Official URL:

Exported to Metis


For peer-to-peer web search engines it is important to quickly process queries and return search results. How to keep the perceived latency low is an open challenge. In this paper we explore the solution potential of search result caching in large-scale peer-to-peer information retrieval networks by simulating such networks with increasing levels of realism. We find that a small bounded cache offers performance comparable to an unbounded cache. Furthermore, we explore partially centralised and fully distributed scenarios, and find that in the most realistic distributed case caching can reduce the query load by thirty-three percent. With optimisations this can be boosted to nearly seventy percent.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-DB: Databases
Research Program:CTIT-NICE: Natural Interaction in Computer-mediated Environments
Research Project:DIRKA: Distributed Information Retrieval by means of Keyword Auctions
Uncontrolled Keywords:Distributed query processing, peer-to-peer simulation
ID Code:19797
Deposited On:10 June 2011
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item