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.
Original language | Undefined |
---|---|
Title of host publication | Proceedings of the 2011 Dutch-Belgian Information Retrieval Workshop (DIR 2011) |
Place of Publication | Amsterdam |
Publisher | Amsterdam University Press |
Pages | 28-31 |
Number of pages | 4 |
ISBN (Print) | not assigned |
Publication status | Published - 4 Feb 2011 |
Event | 11th Dutch-Belgian Information Retrieval Workshop, DIR 2011 - Amsterdam, Netherlands Duration: 4 Feb 2011 → 4 Feb 2011 Conference number: 11 |
Publication series
Name | |
---|---|
Publisher | Amsterdam University Press |
Workshop
Workshop | 11th Dutch-Belgian Information Retrieval Workshop, DIR 2011 |
---|---|
Abbreviated title | DIR |
Country/Territory | Netherlands |
City | Amsterdam |
Period | 4/02/11 → 4/02/11 |
Keywords
- METIS-277482
- Distributed Query Processing
- IR-76390
- EWI-19226
- DB-DFDB: DISTRIBUTED OR FEDERATED DATABASES
- CR-H.3.3
- peer-to-peer simulation