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

A.S. Tigelaar, Djoerd Hiemstra

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

78 Downloads (Pure)

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 languageUndefined
Title of host publicationProceedings of the 2011 Dutch-Belgian Information Retrieval Workshop (DIR 2011)
Place of PublicationAmsterdam
PublisherAmsterdam University Press
Pages28-31
Number of pages4
ISBN (Print)not assigned
Publication statusPublished - 4 Feb 2011
Event11th Dutch-Belgian Information Retrieval Workshop, DIR 2011 - Amsterdam, Netherlands
Duration: 4 Feb 20114 Feb 2011
Conference number: 11

Publication series

Name
PublisherAmsterdam University Press

Workshop

Workshop11th Dutch-Belgian Information Retrieval Workshop, DIR 2011
Abbreviated titleDIR
Country/TerritoryNetherlands
CityAmsterdam
Period4/02/114/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

Cite this