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

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

2 Citations (Scopus)

Abstract

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.
Original languageUndefined
Title of host publicationMultidisciplinary Information Retrieval
Place of PublicationHeidelberg
PublisherSpringer
Pages134-148
Number of pages15
ISBN (Print)978-3-642-21352-6
DOIs
Publication statusPublished - 6 Jun 2011

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume6653
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • METIS-277579
  • Distributed Query Processing
  • IR-77450
  • CR-H.3.3
  • peer-to-peer simulation
  • DB-DFDB: DISTRIBUTED OR FEDERATED DATABASES
  • EWI-19797

Cite this

Tigelaar, A. S., Hiemstra, D., & Trieschnigg, R. B. (2011). Search Result Caching in Peer-to-Peer Information Retrieval Networks. In Multidisciplinary Information Retrieval (pp. 134-148). (Lecture Notes in Computer Science; Vol. 6653). Heidelberg: Springer. https://doi.org/10.1007/978-3-642-21353-3_11