Performance of compressed inverted list caching in search engines

Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of thousands of queries per second on tens of billions of documents, making query throughput a critical issue. To satisfy this heavy workload, search engines use a variety of performance optimizations including index compression, caching, and early termination. We focus on two techniques, inverted index compression and index caching, which play a crucial rule in web search engines as well as other high-performance information retrieval systems. We perform a comparison and evaluation of several inverted list compression algorithms, including new variants of existing algorithms that have not been studied before. We then evaluate different inverted list caching policies on large query traces, and finally study the possible performance benefits of combining compression and caching. The overall goal of this paper is ...

• Type: Conference
• Year: 2008
• Where: WWW
• Authors: Jiangong Zhang, Xiaohui Long, Torsten Suel
• Keywords: Index Caching, Index Compression, Internet Technology, Inverted List Compression, WWW 2008