PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
Character N-Gram Tokenization for European Language Text Retrieval
Information Retrieval
ARC: A Self-Tuning, Low Overhead Replacement Cache
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Full-text federated search of text-based digital libraries in peer-to-peer networks
Information Retrieval
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Distributed cache table: efficient query-driven processing of multi-term queries in P2P networks
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
Information re-retrieval: repeat queries in Yahoo's logs
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
TRIBLER: a social-based peer-to-peer system: Research Articles
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
Full-text federated search in peer-to-peer networks
Full-text federated search in peer-to-peer networks
Search Engines: Information Retrieval in Practice
Search Engines: Information Retrieval in Practice
Stratified analysis of AOL query log
Information Sciences: an International Journal
Caching search engine results over incremental indices
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
On caching search engine query results
Computer Communications
Peer-to-Peer Information Retrieval: An Overview
ACM Transactions on Information Systems (TOIS)
Web search results caching service for structured P2P networks
Future Generation Computer Systems
| Hi-index | 0.00 |
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.