Static score bucketing in inverted indexes

Authors:
Chavdar Botev;Nadav Eiron;Marcus Fontoura;Ning Li;Eugene Shekita
Affiliations:
Cornell University, Ithaca, NY;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA;IBM Almaden Research Center, San Jose, CA
Venue:
Proceedings of the 14th ACM international conference on Information and knowledge management
Year:
2005

Citing 5
Cited 1

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Comparing Top k Lists

SIAM Journal on Discrete Mathematics
In-place versus re-build versus re-merge: index maintenance strategies for text retrieval systems

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Optimized query execution in large search engines with global page ordering

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
High performance index build algorithms for intranet search engines

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Rank quantization

Proceedings of the sixth ACM international conference on Web search and data mining

Quantified Score

Hi-index	0.01

Visualization

Abstract

Maintaining 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 complex 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.