Cost-aware strategies for query result caching in Web search engines
ACM Transactions on the Web
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21933
Search engines and large-scale IR systems need to cache query results for efficiency and scalability purposes. Static and dynamic caching techniques (as well as their combinations) are employed to effectively cache query results. In this study, we propose cost-aware strategies for static and dynamic caching setups. Our research is motivated by two key observations: (i) query processing costs may significantly vary among different queries, and (ii) the processing cost of a query is not proportional to its popularity (i.e., frequency in the previous logs). The first observation implies that cache misses have different, that is, nonuniform, costs in this context. The latter observation implies that typical caching policies, solely based on query popularity, can not always minimize the total cost. Therefore, we propose to explicitly incorporate the query costs into the caching policies. Simulation results using two large Web crawl datasets and a real query log reveal that the proposed approach improves overall system performance in terms of the average query execution time. © 2011 ACM.
- Research Paper 
Showing items related by title, author, creator and subject.
Ünel G.; Dönderler, M.E.; Ulusoy O.; Güdükbay, U. (2004)The interest for multimedia database management systems has grown rapidly due to the need for the storage of huge volumes of multimedia data in computer systems. An important building block of a multimedia database system ...
Şaykol, E.; Güdükbay, U.; Ulusoy O. (2005)Considering the fact that querying by low-level object features is essential in image and video data, an efficient approach for querying and retrieval by shape and color is proposed. The approach employs three specialized ...
Static index pruning in web search engines: Combining term and document popularities with query views Altingovde I.S.; Ozcan, R.; Ulusoy O. (2012)Static index pruning techniques permanently remove a presumably redundant part of an inverted file, to reduce the file size and query processing time. These techniques differ in deciding which parts of an index can be ...