A Fault-Tolerant Cache Service for Web Search Engines

Large Web search engines are constructed as a collection of services that are deployed on dedicated clusters of distributed-memory processors. In particular, efficient user query throughput heavily relies on using result cache services devoted to maintaining the answers to most frequent queries. Loa...

Full description

Saved in:
Bibliographic Details
Published in2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications pp. 427 - 434
Main Authors Gomez-Pantoja, C., Gil-Costa, V., Rexachs, D., Marin, M., Luque, E.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2012
Subjects
Caching Services
Fault tolerance
Load Balancing
Load management
Partitioning algorithms
Peer to peer computing
Proposals
Throughput
Time factors
Web Search Engine
Online AccessGet full text

Cover

More Information
Summary:Large Web search engines are constructed as a collection of services that are deployed on dedicated clusters of distributed-memory processors. In particular, efficient user query throughput heavily relies on using result cache services devoted to maintaining the answers to most frequent queries. Load balancing and fault tolerance are critical to this service. This paper proposes the design of a result cache service based on consistent hashing and a strategy for enabling fault tolerance. Performance evaluation is performed by using actual queries from a commercial search engine. The results show that the proposed cache service outperforms baseline approaches, decreases the average query response time, increases query throughput and efficiently recovers performance after processor failures.
ISBN:1467316318
9781467316316
ISSN:2158-9178
DOI:10.1109/ISPA.2012.62