Almer S. Tigelaar

A Little Bit of Everything

Query-Load Balancing by Caching Search Results in Peer-to-Peer Information Retrieval Networks

Query-Load Balancing by Caching Search Results in Peer-to-Peer Information Retrieval Networks
Tigelaar, A. S. & Hiemstra, D.
In Proceedings of DIR 2011, Amsterdam, The Netherlands (pp. 28-31).

View in Repository

Abstract

For peer-to-peer web search engines it is important to keep the delay between receiving a query and providing search results within an acceptable range for the end user. How to achieve this remains an open challenge. One way to reduce delays is by caching search results for queries and allowing peers to access each others cache. In this paper we explore the limitations 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 cache hit ratios of at least thirty-three percent are attainable.

Presented at Dutch-Belgian Information Retrieval 2011 Workshop, February 4th 2011, Amsterdam, The Netherlands.

2011-02-04-DIR
Subscribe
Notify of
guest
0 Comments
Inline Feedbacks
View all comments
0
Feel free to share your thoughts!x
()
x