Ceccarelli, Diego and Lucchese, Claudio and Orlando, Salvatore and Perego, Raffaele and Silvestri, Fabrizio Caching query-biased snippets for efficient retrieval. In: Proceedings of EDBT ’11: 14th International Conference on Extending Database Technology. EDBT/ICDT, pp. 93-104. ISBN 978-1-4503-0528-0 (2011)
Full text not available from this repository.Abstract
Web Search Engines' result pages contain references to the top-k documents relevant for the query submitted by a user. Each document is represented by a title, a snippet and a URL. Snippets, i.e. short sentences showing the portions of the document being relevant to the query, help users to select the most interesting results. The snippet generation process is very expensive, since it may require to access a number of documents for each issued query. We assert that caching, a popular technique used to enhance performance at various levels of any computing systems, can be very effective in this context. We design and experiment several cache organizations, and we introduce the concept of supersnippet, that is the set of sentences in a document that are more likely to answer future queries. We show that supersnippets can be built by exploiting query logs, and that in our experiments a supersnippet cache answers up to 62% of the requests, remarkably outperforming other caching approaches.
| Item Type: | Book Section |
|---|---|
| Additional Information: | EDBT/ICDT 2011 - 14th International Conference on Extending Database Technology - March 21-25, 2011, Uppsala, Sweden |
| Uncontrolled Keywords: | caching, efficiency, snippet generation, throughput, web search engines |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Economics and Institutional Change |
| Depositing User: | Users 43 not found. |
| Date Deposited: | 19 Dec 2012 09:15 |
| Last Modified: | 12 Mar 2013 14:57 |
| URI: | http://eprints.imtlucca.it/id/eprint/1449 |
Actions (login required)
 |
Edit Item |
