The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Faster top-k document retrieval using block-max indexes
Abstract
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization techniques called early termination achieves faster query processing by avoiding the scoring of documents that are unlikely to be in the top results. We study new algorithms for early termination that outperform previous methods. In particular, we focus on safe techniques for disjunctive queries, which return the same result as an exhaustive evaluation over the disjunction of the query terms. The current state-of-the-art methods for this case, the WAND algorithm by Broder et al. [11] and the approach of Strohman and Croft [30], achieve great benefits but still leave a large performance gap between disjunctive and (even non-early terminated) conjunctive queries. We propose a new set of algorithms by introducing a simple augmented inverted index structure called a block-max index. Essentially, this is a structure that stores the maximum impact score for each block of a compressed inverted list in uncompressed form, thus enabling us to skip large parts of the lists. We show how to integrate this structure into the WAND approach, leading to considerable performance gains. We then describe extensions to a layered index organization, and to indexes with reassigned document IDs, that achieve additional gains that narrow the gap between disjunctive and conjunctive top-k query processing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Efficient query evaluation using a two-level retrieval process
Broder, A. Z., Carmel, D., Herscovici, M., Soffer, A., & Zien, J. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956944 · Cited by 407
Cited by
A Survey on Trajectory Data Management, Analytics, and Learning
Wang, S., Bao, Z., Culpepper, J. S., & Cong, G. (2022) · ACM Computing Surveys · doi:10.1145/3440207 · Cited by 267
(2022) · doi:10.1145/3511808.3557325 · Cited by 67
Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search
Boytsov, L., Novak, D., Malkov, Y., & Nyberg, E. (2016) · Proceedings of the 25th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2983323.2983815 · Cited by 50
Metadata
- Authors
- Ding, S., & Suel, T.
- Venue
- Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
- Publisher
- ACM
- Published
- 2011-07-24
- Pages
- 993-1002
- OpenAlex
- W1980344365
- Cited by
- 220
- References
- 1
- FWCI
- 10.80
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Faster top-k document retrieval using block-max indexes. https://app.cochat.ai/papers/10.1145/2009916.2010048
- The paper
- Ding, S., & Suel, T. (2011). Faster top-k document retrieval using block-max indexes. Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval. https://doi.org/10.1145/2009916.2010048
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.