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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Gomez-Pantoja, C., Marin, M., Gil-Costa, V., & Bonacic, C. (2011). An evaluation of fault-tolerant query processing for web search engines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6852 LNCS, pp. 393–404). https://doi.org/10.1007/978-3-642-23400-2_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
