New caching techniques for web search engines

This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data which are useful to solve frequent queries. Cached items range from specific data such as query answers to generic data such as segments of index retrieved from secondary memory. The paper also presents a comparative study based on discrete-event simulation and bulk-synchronous parallelism. The studied performance metrics include overall query throughput, single-user query latency and power consumption. In all cases, the results show that the proposed cache hierarchy leads to better performance than a baseline approach built on state of the art caching techniques. Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval--Search process General Terms Algorithms, Performance Keywords Web Search Engines, Caching Strategies, Discrete-Event Simulation, Models fo...

• Type: Conference
• Year: 2010
• Where: HPDC
• Authors: Mauricio Marín, Veronica Gil Costa, Carlos Gómez-Pantoja
• Keywords: Cache Hierarchy, Discrete-event Simulation, Distributed And Parallel Computing, HPDC 2010, Web Search Engines