DMCA
Session 6: Summaries Fast Generation of Result Snippets in Web Search
BibTeX
@MISC{Turpin_session6:,
author = {Andrew Turpin and Yohannes Tsegay and David Hawking and Hugh E. Williams},
title = {Session 6: Summaries Fast Generation of Result Snippets in Web Search},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The presentation of query biased document snippets as part of results pages presented by search engines has become an expectation of search engine users. In this paper we explore the algorithms and data structures required as part of a search engine to allow efficient generation of query biased snippets. We begin by proposing and analysing a document compression method that reduces snippet generation time by 58 % over a baseline using the zlib compression library. These experiments reveal that finding documents on secondary storage dominates the total cost of generating snippets, and so caching documents in RAM is essential for a fast snippet generation process. Using simulation, we examine snippet generation performance for different size RAM caches. Finally we propose and analyse document reordering and compaction, revealing a scheme that increases the number of document cache hits with only a marginal affect on snippet quality. This scheme effectively doubles the number of documents that can fit in a fixed size cache.
Keyphrases
web search summary fast generation result snippet search engine efficient generation document compression method fixed size cache secondary storage document snippet document reordering result page search engine user data structure snippet quality caching document fast snippet generation process document cache hit zlib compression library marginal affect snippet generation performance different size ram cache generation time total cost
