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

A.S. Tigelaar; Djoerd Hiemstra

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

A.S. Tigelaar, Djoerd Hiemstra

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 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

Access to Document

http://ilps.science.uva.nl/dir2011/proceedings.html

Cite this

@inproceedings{e171c0aa328644c19f110f1b9ebb444c,

title = "Query Load Balancing by Caching Search Results in Peer-to-Peer Information Retrieval Networks",

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.",

keywords = "METIS-277482, Distributed Query Processing, IR-76390, EWI-19226, DB-DFDB: DISTRIBUTED OR FEDERATED DATABASES, CR-H.3.3, peer-to-peer simulation",

author = "A.S. Tigelaar and Djoerd Hiemstra",

year = "2011",

month = feb,

day = "4",

language = "Undefined",

isbn = "not assigned",

publisher = "Amsterdam University Press",

pages = "28--31",

booktitle = "Proceedings of the 2011 Dutch-Belgian Information Retrieval Workshop (DIR 2011)",

address = "Netherlands",

note = "11th Dutch-Belgian Information Retrieval Workshop, DIR 2011 ; Conference date: 04-02-2011 Through 04-02-2011",

}

Tigelaar, AS & Hiemstra, D 2011, Query Load Balancing by Caching Search Results in Peer-to-Peer Information Retrieval Networks. in Proceedings of the 2011 Dutch-Belgian Information Retrieval Workshop (DIR 2011). Amsterdam University Press, Amsterdam, pp. 28-31, 11th Dutch-Belgian Information Retrieval Workshop, DIR 2011, Amsterdam, Netherlands, 4/02/11. <http://ilps.science.uva.nl/dir2011/proceedings.html>

Query Load Balancing by Caching Search Results in Peer-to-Peer Information Retrieval Networks. / Tigelaar, A.S.; Hiemstra, Djoerd.
Proceedings of the 2011 Dutch-Belgian Information Retrieval Workshop (DIR 2011). Amsterdam: Amsterdam University Press, 2011. p. 28-31.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Tigelaar, A.S.

AU - Hiemstra, Djoerd

N1 - Conference code: 11

PY - 2011/2/4

Y1 - 2011/2/4

N2 - 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.

AB - 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.

KW - METIS-277482

KW - Distributed Query Processing

KW - IR-76390

KW - EWI-19226

KW - DB-DFDB: DISTRIBUTED OR FEDERATED DATABASES

KW - CR-H.3.3

KW - peer-to-peer simulation

M3 - Conference contribution

SN - not assigned

SP - 28

EP - 31

BT - Proceedings of the 2011 Dutch-Belgian Information Retrieval Workshop (DIR 2011)

PB - Amsterdam University Press

CY - Amsterdam

T2 - 11th Dutch-Belgian Information Retrieval Workshop, DIR 2011

Y2 - 4 February 2011 through 4 February 2011

ER -