Fetching the paper…
Reading the bibliography…
Recent advances in retrieval models based on learned sparse representations generated by transformers have led us to, once again, consider score-at-a-time query evaluation techniques for the top-k retrieval problem.
Query evaluation: Strategies and optimizations
H. R. Turtle and J. Flood · 1995
Earlier work this paper cites.
Vector-space ranking with effective early termination
V. N. Anh, O. de Kretser, and A. Moffat · 2001
Earlier work this paper cites.
Efficient query evaluation using a two-level retrieval process
A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien · 2003
Earlier work this paper cites.
The probabilistic relevance framework: BM25 and beyond
S. Robertson and H. Zaragoza · 2009
Earlier work this paper cites.
Learning to efficiently rank
L. Wang, J. Lin, and D. Metzler · 2010
Earlier work this paper cites.
Faster top- k k document retrieval using block-max indexes
S. Ding and T. Suel · 2011
Earlier work this paper cites.
A cascade ranking model for efficient ranked retrieval
L. Wang, J. Lin, and D. Metzler · 2011
Earlier work this paper cites.
The tail at scale
J. Dean and L. A. Barroso · 2013
Earlier work this paper cites.
Exploring the magic of WAND
M. Petri, J. S. Culpepper, and A. Moffat · 2013
Earlier work this paper cites.
Decoding billions of integers per second through vectorization
D. Lemire and L. Boytsov · 2015
Earlier work this paper cites.
Anytime ranking for impact-ordered indexes
J. Lin and A. Trotman · 2015
Earlier work this paper cites.
Compressing graphs and indexes with recursive graph bisection
L. Dhulipala, I. Kabiljo, B. Karrer, G. Ottaviano, S. Pupyrev, and A. Shalita · 2016
Earlier work this paper cites.
A comparison of document-at-a-time and score-at-a-time query evaluation
M. Crane, J. S. Culpepper, J. Lin, J. Mackenzie, and A. Trotman · 2017
Earlier work this paper cites.
Early termination heuristics for score-at-a-time index traversal
J. Mackenzie, F. Scholer, and J. S. Culpepper · 2017
Earlier work this paper cites.
Faster BlockMax WAND with variable-sized blocks
A. Mallia, G. Ottaviano, E. Porciani, N. Tonellotto, and R. Venturini · 2017
Earlier work this paper cites.
MS MARCO: A Human Generated MAchine Reading COmprehension Dataset
P. Bajaj, D. Campos, N. Craswell, L. Deng, J. Gao, X. Liu, R. Majumder, A. McNamara, B. Mitra, T. Nguyen, M. Rosenberg, X. Song, A. Stoica, S. Tiwary, and T. Wang · 2018
Earlier work this paper cites.
Efficient query processing for scalable web search
N. Tonellotto, C. Macdonald, and I. Ounis · 2018
Cited alongside, same era.
Elias revisited: Group Elias SIMD coding
A. Trotman and K. Lilly · 2018
Cited alongside, same era.
Anserini: Reproducible ranking baselines using Lucene
P. Yang, H. Fang, and J. Lin · 2018
Cited alongside, same era.
Context-aware sentence/passage term importance estimation for first stage retrieval
Z. Dai and J. Callan · 2019
Cited alongside, same era.
PISA: Performant indexes and search for academia
A. Mallia, M. Siedlaczek, J. Mackenzie, and T. Suel · 2019
Cited alongside, same era.
An experimental study of index compression and DAAT query processing methods
A. Mallia, M. Siedlaczek, and T. Suel · 2019
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Y. A. Malkov and D. A. Yashunin · 2020
Later among the works it cites.
Exploring the limits of transfer learning with a unified text-to-text transformer
C. Raffel, N. Shazeer, A. Roberts, K. Lee, S. Narang, M. Matena, Y. Zhou, W. Li, and P. J. Liu · 2020
Later among the works it cites.
SPLADE v2: Sparse lexical and expansion model for information retrieval
T. Formal, C. Lassance, B. Piwowarski, and S. Clinchant · 2021
Closest in time.
SPLADE: Sparse lexical and expansion model for first stage ranking
T. Formal, B. Piwowarski, and S. Clinchant · 2021
Closest in time.
Complementing lexical retrieval with semantic residual embedding
L. Gao, Z. Dai, T. Chen, Z. Fan, B. V. Durme, and J. Callan · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
From doc2query to docTTTTTquery, 2019
R. Nogueira and J. Lin · 2019
Cited alongside, same era.
Document expansion by query prediction
R. Nogueira, W. Yang, J. Lin, and K. Cho · 2019
Cited alongside, same era.
Micro- and macro-optimizations of SaaT
A. Trotman and M. Crane · 2019
Cited alongside, same era.
SparTerm: Learning term-based sparse representation for fast text retrieval
Y. Bai, X. Li, G. Wang, C. Zhang, L. Shang, J. Xu, Z. Wang, F. Wang, and Q. Liu · 2020
Cited alongside, same era.
From MaxScore to Block-Max WAND: The story of how Lucene significantly improved query evaluation performance
A. Grand, R. Muir, J. Ferenczi, and J. Lin · 2020
Cited alongside, same era.
Dense passage retrieval for open-domain question answering
V. Karpukhin, B. Oğuz, S. Min, P. Lewis, L. Wu, S. Edunov, D. Chen, and W.-t. Yih · 2020
Cited alongside, same era.
J. Lin · 2021
Closest in time.
J. Lin and X. Ma · 2021
Closest in time.
Pyserini: A Python toolkit for reproducible information retrieval research with sparse and dense representations
J. Lin, X. Ma, S.-C. Lin, J.-H. Yang, R. Pradeep, and R. Nogueira · 2021
Closest in time.
On the separation of logical and physical ranking models for text retrieval applications
J. Lin, X. Ma, J. Mackenzie, and A. Mallia · 2021
Closest in time.
Pretrained Transformers for Text Ranking: BERT and Beyond
J. Lin, R. Nogueira, and A. Yates · 2021
Closest in time.
Faster index reordering with bipartite graph partitioning
J. Mackenzie, M. Petri, and A. Moffat · 2021
Closest in time.
Learning passage impacts for inverted indexes
A. Mallia, O. Khattab, T. Suel, and N. Tonellotto · 2021
Closest in time.
Approximate nearest neighbor negative contrastive learning for dense text retrieval
L. Xiong, C. Xiong, Y. Li, K.-F. Tang, J. Liu, P. N. Bennett, J. Ahmed, and A. Overwijk · 2021
Closest in time.
Fast passage re-ranking with contextualized exact term matching and efficient passage expansion
S. Zhuang and G. Zuccon · 2021
Closest in time.
TILDE: Term independent likelihood moDEl for passage re-ranking
S. Zhuang and G. Zuccon · 2021
Closest in time.
Anytime ranking on document-ordered indexes
J. Mackenzie, M. Petri, and A. Moffat · 2022
Closest in time.