Static score bucketing in inverted indexes | Zendy

Chavdar Botev | Zendy; Nadav Eiron | Zendy; Marcus Fontoura | Zendy; Ning Li | Zendy; Eugene J. Shekita | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Static score bucketing in inverted indexes

Author(s) -

Chavdar Botev,

Nadav Eiron,

Marcus Fontoura,

Ning Li,

Eugene J. Shekita

Publication year - 2005

Publication title -

ecommons (cornell university)

Language(s) - English

Resource type - Conference proceedings

ISBN - 1-59593-140-6

DOI - 10.1145/1099554.1099642

Subject(s) - index (typography) , computer science , inverted index , heuristic , quality (philosophy) , data mining , artificial intelligence , search engine indexing , world wide web , philosophy , epistemology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research