Cache - based query processing for search engines
Cambazoglu, B. B.
Altıngovde, I. S.
ACM Transactions on the Web
1559-1131 (print)1559-114X (online)
Association for Computing Machinery
14:1 - 14:23
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/13044
In practice, a search engine may fail to serve a query due to various reasons such as hardware/network failures, excessive query load, lack of matching documents, or service contract limitations (e.g., the query rate limits for third-party users of a search service). In this kind of scenarios, where the backend search system is unable to generate answers to queries, approximate answers can be generated by exploiting the previously computed query results available in the result cache of the search engine.In this work, we propose two alternative strategies to implement this cache-based query processing idea. The first strategy aggregates the results of similar queries that are previously cached in order to create synthetic results for new queries. The second strategy forms an inverted index over the textual information (i.e., query terms and result snippets) present in the result cache and uses this index to answer new queries. Both approaches achieve reasonable result qualities compared to processing queries with an inverted index built on the collection. © 2012 ACM.