Almer S. Tigelaar

A Little Bit of Everything

Search Result Caching in Peer-to-Peer Information Retrieval Networks

Search Result Caching in Peer-to-Peer Information Retrieval Networks
Tigelaar, A. S. & Hiemstra, D. & Trieschnigg, D.
In Proceedings of IRFC 2011, Vienna, Austria (pp. 134-148).

View in Repository


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.

Presented at the Information Retrieval Facility Conference 2011 on June 6th 2011 in Vienna, Austria.

Notify of

1 Comment
Inline Feedbacks
View all comments
Feel free to share your thoughts!x