An evaluation of fault-tolerant query processing for web search engines

Carlos Gomez-Pantoja, Mauricio Marin, Veronica Gil-Costa, Carolina Bonacic

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

1 Citation (Scopus)

Abstract

A number of strategies to perform parallel query processing in large scale Web search engines have been proposed in recent years. Their design assume that computers never fail. However, in actual data centers supporting Web search engines, individual cluster processors can enter or leave service dynamically due to transient and/or permanent faults. This paper studies the suitability of efficient query processing strategies under a standard setting where processor replication is used to improve query throughput and support fault-tolerance.

Original languageEnglish
Title of host publicationEuro-Par 2011 Parallel Processing - 17th International Conference, Proceedings
Pages393-404
Number of pages12
EditionPART 1
DOIs
Publication statusPublished - 8 Sep 2011
Event17th International Conference on Parallel Processing, Euro-Par 2011 - Bordeaux, France
Duration: 29 Aug 20112 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6852 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Conference on Parallel Processing, Euro-Par 2011
Country/TerritoryFrance
CityBordeaux
Period29/08/112/09/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An evaluation of fault-tolerant query processing for web search engines'. Together they form a unique fingerprint.

Cite this