Show simple item record

dc.contributor.authorBotev, Chavdaren_US
dc.contributor.authorEiron, Nadav
dc.contributor.authorFontoura, Marcus
dc.contributor.authorLi, Ning
dc.date.accessioned2007-04-04T19:51:54Z
dc.date.available2007-04-04T19:51:54Z
dc.date.issued2005-11-23en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2005-2005en_US
dc.identifier.urihttps://hdl.handle.net/1813/5705
dc.description.abstractMaintaining strict static score order of inverted lists is a heuristic used by search engines to improve the quality of query results when the entire inverted lists cannot be processed. This heuristic, however, increases the cost of index generation and requires time-consuming index build algorithms. In this paper, we study a new index organization based on static score bucketing. We show that this new technique significantly improves in index build performance while having minimal impact on the quality of search results. We also provide upper bounds on the quality degradation and verify experimentally the benefits of the proposed approach.en_US
dc.format.extent230988 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleStatic Score Bucketing in Inverted Indexesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics