On the public citation graph

Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations

https://doi.org/10.1145/3576922
0 signed · 67 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/spe.2203openalex-snapshot
Decoding billions of integers per second through vectorization
inferredcites →https://doi.org/10.1002/spe.2683openalex-snapshot
Micro‐ and macro‐optimizations of S aa T search
inferredcites →https://doi.org/10.1007/978-3-030-45442-5_3openalex-snapshot
From MAXSCORE to Block-Max Wand: The Story of How Lucene Significantly Improved Query Evaluation Performance
inferredcites →https://doi.org/10.1007/978-3-540-71496-5_12openalex-snapshot
Sorting Out the Document Identifier Assignment Problem
inferredcites →https://doi.org/10.1007/s10791-016-9291-5openalex-snapshot
The role of index compression in score-at-a-time query evaluation
inferredcites →https://doi.org/10.1007/s10791-017-9298-6openalex-snapshot
Waves: a fast multi-tier top-k query processing algorithm
inferredcites →https://doi.org/10.1016/0306-4573(95)00020-hopenalex-snapshot
Query evaluation: Strategies and optimizations
inferredcites →https://doi.org/10.1109/icde14614.2009openalex-snapshot
2009 IEEE 25th International Conference on Data Engineering
inferredcites →https://doi.org/10.1109/tpami.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferredcites →https://doi.org/10.1145/1132956.1132959openalex-snapshot
Inverted files for text search engines
inferredcites →https://doi.org/10.1145/1835449.1835475openalex-snapshot
Learning to efficiently rank
inferredcites →https://doi.org/10.1145/2009916.2009934openalex-snapshot
A cascade ranking model for efficient ranked retrieval
inferredcites →https://doi.org/10.1145/2009916.2010048openalex-snapshot
Faster top-k document retrieval using block-max indexes
inferredcites →https://doi.org/10.1145/2408776.2408794openalex-snapshot
The tail at scale
inferredcites →https://doi.org/10.1145/2433396.2433412openalex-snapshot
Optimizing top-k document retrieval strategies for block-max indexes
inferredcites →https://doi.org/10.1145/2537734.2537744openalex-snapshot
Exploring the magic of WAND
inferredcites →https://doi.org/10.1145/2808194.2809477openalex-snapshot
Anytime Ranking for Impact-Ordered Indexes
inferredcites →https://doi.org/10.1145/290941.291008openalex-snapshot
A language modeling approach to information retrieval
inferredcites →https://doi.org/10.1145/2939672.2939862openalex-snapshot
Compressing Graphs and Indexes with Recursive Graph Bisection
inferredcites →https://doi.org/10.1145/3015022.3015026openalex-snapshot
Dynamic Cutoff Prediction in Multi-Stage Retrieval Systems
inferredcites →https://doi.org/10.1145/3018661.3018726openalex-snapshot
A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation
inferredcites →https://doi.org/10.1145/3077136.3080780openalex-snapshot
Faster BlockMax WAND with Variable-sized Blocks
inferredcites →https://doi.org/10.1145/3159652.3159676openalex-snapshot
Query Driven Algorithm Selection in Early Stage Retrieval
inferredcites →https://doi.org/10.1145/3166072.3166073openalex-snapshot
Early Termination Heuristics for Score-at-a-Time Index Traversal
inferredcites →https://doi.org/10.1145/3239571openalex-snapshot
Anserini
inferredcites →https://doi.org/10.1145/3291992.3292001openalex-snapshot
Elias Revisited
inferredcites →https://doi.org/10.1145/3397271.3401263openalex-snapshot
Efficiency Implications of Term Weighting for Passage Retrieval
inferredcites →https://doi.org/10.1145/3397271.3401404openalex-snapshot
Supporting Interoperability Between Open-Source Search Engines with the Common Index File Format
inferredcites →https://doi.org/10.1145/3404835.3462922openalex-snapshot
TILDE: Term Independent Likelihood moDEl for Passage Re-ranking
inferredcites →https://doi.org/10.1145/3404835.3462991openalex-snapshot
Faster Index Reordering with Bipartite Graph Partitioning
inferredcites →https://doi.org/10.1145/3404835.3463030openalex-snapshot
Learning Passage Impacts for Inverted Indexes
inferredcites →https://doi.org/10.1145/3404835.3463098openalex-snapshot
SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking
inferredcites →https://doi.org/10.1145/3404835.3463238openalex-snapshot
Pyserini: A Python Toolkit for Reproducible Information Retrieval Research with Sparse and Dense Representations
inferredcites →https://doi.org/10.1145/3415148openalex-snapshot
Techniques for Inverted Index Compression
inferredcites →https://doi.org/10.1145/3437963.3441813openalex-snapshot
Fast Disjunctive Candidate Generation Using Live Block Filtering
inferredcites →https://doi.org/10.1145/3467890openalex-snapshot
Anytime Ranking on Document-Ordered Indexes
inferredcites →https://doi.org/10.1145/3488560.3498489openalex-snapshot
Using Conjunctions for Faster Disjunctive Top-k Queries
inferredcites →https://doi.org/10.1145/3527546.3527552openalex-snapshot
A proposed conceptual framework for a representational approach to information retrieval
inferredcites →https://doi.org/10.1145/383952.383957openalex-snapshot
Vector-space ranking with effective early termination
inferredcites →https://doi.org/10.1145/582415.582416openalex-snapshot
Probabilistic models of information retrieval based on measuring the divergence from randomness
inferredcites →https://doi.org/10.1145/956863.956944openalex-snapshot
Efficient query evaluation using a two-level retrieval process
inferredcites →https://doi.org/10.14778/3402755.3402756openalex-snapshot
Evaluation strategies for top-k queries over memory-resident inverted indexes
inferredcites →https://doi.org/10.1561/1500000019openalex-snapshot
The Probabilistic Relevance Framework: BM25 and Beyond
inferredcites →https://doi.org/10.1561/1500000057openalex-snapshot
Efficient Query Processing for Scalable Web Search
inferredcites →https://doi.org/10.1609/aimag.v17i3.1232openalex-snapshot
Using anytime algorithms in intelligent systems
inferredcites →https://doi.org/10.18653/v1/2020.emnlp-main.550openalex-snapshot
Dense Passage Retrieval for Open-Domain Question Answering
inferredcites →https://doi.org/10.2200/s01123ed1v01y202108hlt053openalex-snapshot
Pretrained Transformers for Text Ranking: BERT and Beyond
inferredcites →https://doi.org/10.3115/1073083openalex-snapshot
Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02
inferredcites →https://doi.org/10.48550/arxiv.1910.10683openalex-snapshot
Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-28241-6_7openalex-snapshot
A Unified Framework for Learned Sparse Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-032-21324-2_1openalex-snapshot
Fast, Compact, Immediate-Access Indexing for Learned Sparse Retrieval Systems
inferred← citeshttps://doi.org/10.1145/3539618.3591806openalex-snapshot
Profiling and Visualizing Dynamic Pruning Algorithms
inferred← citeshttps://doi.org/10.1145/3539618.3591922openalex-snapshot
ReNeuIR at SIGIR 2023: The Second Workshop on Reaching Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3539618.3591941openalex-snapshot
A Static Pruning Study on Sparse Neural Retrievers
inferred← citeshttps://doi.org/10.1145/3578337.3605129openalex-snapshot
Exploring the Representation Power of SPLADE Models
inferred← citeshttps://doi.org/10.1145/3626772.3657769openalex-snapshot
Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations
inferred← citeshttps://doi.org/10.1145/3626772.3657850openalex-snapshot
Revisiting Document Expansion and Filtering for Effective First-Stage Retrieval
inferred← citeshttps://doi.org/10.1145/3626772.3657906openalex-snapshot
Faster Learned Sparse Retrieval with Block-Max Pruning
inferred← citeshttps://doi.org/10.1145/3637528.3671654openalex-snapshot
Text Matching Indexers in Taobao Search
inferred← citeshttps://doi.org/10.1145/3665324openalex-snapshot
Bridging Dense and Sparse Maximum Inner Product Search
inferred← citeshttps://doi.org/10.1145/3673791.3698405openalex-snapshot
Rank-Biased Quality Measurement for Sets and Rankings
inferred← citeshttps://doi.org/10.1145/3701551.3703482openalex-snapshot
Advances in Vector Search
inferred← citeshttps://doi.org/10.1145/3726302.3730197openalex-snapshot
Fast and Effective Early Termination for Simple Ranking Functions
inferred← citeshttps://doi.org/10.1145/3726302.3730281openalex-snapshot
Gosling Grows Up: Retrieval with Learned Dense and Sparse Representations Using Anserini
inferred← citeshttps://doi.org/10.1145/3726302.3731693openalex-snapshot
Neural Lexical Search with Learned Sparse Retrieval
inferred← citeshttps://doi.org/10.1145/3805712.3808554openalex-snapshot
Insights into the Efficiency of Open-Source Score-at-a-Time Search Engines: A Reproducibility Study
inferred← citeshttps://doi.org/10.70675/0e6d7bcbz4ddbz45bczb909z78ab26702a56openalex-snapshot
Towards Effective, Efficient and Explainable Neural Information Retrieval
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.