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. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1145/1951365.1951379 | EDBT |
Keywords | Field | DocType |
web search engines,caching approach,top-k document,snippet generation process,computing system,supersnippet cache,query log,cache organization,query-biased snippet,efficient retrieval,interesting result,future query,throughput,efficiency,web search engine | Web search query,World Wide Web,Search engine,Information retrieval,Query expansion,Computer science,Cache,Web query classification,Throughput,Snippet,Database,Computing systems | Conference |
Citations | PageRank | References |
16 | 0.56 | 15 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Diego Ceccarelli | 1 | 123 | 9.91 |
Claudio Lucchese | 2 | 1104 | 73.76 |
Salvatore Orlando | 3 | 1595 | 202.29 |
Raffaele Perego | 4 | 1471 | 108.91 |
Fabrizio Silvestri | 5 | 1819 | 107.29 |