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

Share/Save/Bookmark

Tigelaar, Almer S. and Hiemstra, Djoerd (2011) Query Load Balancing by Caching Search Results in Peer-to-Peer Information Retrieval Networks. In: Dutch-Belgian Information Retrieval Workshop, DIR 2011, 4 February 2011, Amsterdam, The Netherlands.

[img]
Preview
PDF
285Kb
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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/76390
Proceedings URL:http://ilps.science.uva.nl/dir2011/proceedings.html
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page