Cache-Based Query Processing for Search Engines

Download

index.pdf

Date

2012-11-01

Author

Cambazoglu, B. Barla
Altıngövde, İsmail Sengör
Ozcan, Rifat
Ulusoy, Ozgur

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

347
views

0
downloads

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.

Subject Keywords

Computer Networks and Communications

URI

https://hdl.handle.net/11511/49176

Journal

ACM TRANSACTIONS ON THE WEB

DOI

https://doi.org/10.1145/2382616.2382617

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Cost-Aware Strategies for Query Result Caching in Web Search Engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Ulusoy, Ozgor (Association for Computing Machinery (ACM), 2011-05-01) 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 po...
Second Chance: A Hybrid Approach for Dynamic Result Caching and Prefetching in Search Engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Barla Cambazoglu, B.; ULUSOY, ÖZGÜR (Association for Computing Machinery (ACM), 2013-12-01) Web search engines are known to cache the results of previously issued queries. The stored results typically contain the document summaries and some data that is used to construct the final search result page returned to the user. An alternative strategy is to store in the cache only the result document IDs, which take much less space, allowing results of more queries to be cached. These two strategies lead to an interesting trade-off between the hit rate and the average query response latency. In this work...
Frame-counter scheduler: A novel QoS scheduler for real-time traffic Schmidt, Şenan Ece (Elsevier BV, 2006-08-04) Real-time traffic communication has Quality of Service (QoS) requirements such as end-to-end bandwidth and delay guarantees.
Exploiting Navigational Queries for Result Presentation and Caching in Web Search Engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Ulusoy, Ozgur (Wiley, 2011-04-01) Caching of query results is an important mechanism for efficiency and scalability of web search engines. Query results are cached and presented in terms of pages, which typically include 10 results each. In navigational queries, users seek a particular website, which would be typically listed at the top ranks (maybe, first or second) by the search engine, if found. For this type of query, caching and presenting results in the 10-per-page manner may waste cache space and network bandwidth. In this article, w...
Incremental view maintenance in object-oriented databases Alhajj, R; Polat, Faruk (Association for Computing Machinery (ACM), 1998-06-01) A database management system should support views to facilitate filtering of information in order to have only necessary and required information available to users with minimal delay Although a lot of research efforts concentrated on views within the conventional relational model, much more effort is required when object-oriented models are considered. However, supporting views is only a step forward in achieving the purpose that requires improving the performance of the system by considering incremental m...

Citation Formats

B. B. Cambazoglu, İ. S. Altıngövde, R. Ozcan, and O. Ulusoy, “Cache-Based Query Processing for Search Engines,” ACM TRANSACTIONS ON THE WEB, pp. 0–0, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/49176.