Inverted File Partitioning Schemes in Multiple Disk Systems
IEEE Transactions on Parallel and Distributed Systems
Filtered document retrieval with frequency-sorted indexes
Journal of the American Society for Information Science
Modern Information Retrieval
Hybrid Partition Inverted Files: Experimental Validation
ECDL '02 Proceedings of the 6th European Conference on Research and Advanced Technology for Digital Libraries
Parallel Search using Partitioned Inverted Files
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Efficient query evaluation using a two-level retrieval process
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
A pipelined architecture for distributed text query evaluation
Information Retrieval
Heavy-tailed distributions and multi-keyword queries
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
High-performance distributed inverted files
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Exploiting Hybrid Parallelism in Web Search Engines
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Search advertising using web relevance feedback
Proceedings of the 17th ACM conference on Information and knowledge management
New caching techniques for web search engines
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Batch query processing for web search engines
Proceedings of the fourth ACM international conference on Web search and data mining
3D inverted index with cache sharing for web search engines
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
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.