On the public citation graph

Anytime Ranking on Document-Ordered Indexes

0 signed · 88 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.1000/604faketemporaryforimportopenalex-snapshot
PISA: Performant indexes and search for academia
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-15712-8_22openalex-snapshot
Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study
inferredcites →https://doi.org/10.1007/978-3-030-15712-8_23openalex-snapshot
An Experimental Study of Index Compression and DAAT Query Processing Methods
inferredcites →https://doi.org/10.1007/978-3-030-45442-5_4openalex-snapshot
Which BM25 Do You Mean? A Large-Scale Reproducibility Study of Scoring Variants
inferredcites →https://doi.org/10.1007/978-3-319-23826-5_32openalex-snapshot
ShRkC: Shard Rank Cutoff Prediction for Selective Search
inferredcites →https://doi.org/10.1007/978-3-319-30671-1_11openalex-snapshot
Does Selective Search Benefit from WAND Optimization?
inferredcites →https://doi.org/10.1007/978-3-319-56608-5_69openalex-snapshot
On the Efficiency of Selective Search
inferredcites →https://doi.org/10.1007/978-3-319-76941-7_42openalex-snapshot
On the Cost of Negation for Dynamic Pruning
inferredcites →https://doi.org/10.1007/978-3-540-30480-7_1openalex-snapshot
What Does It Mean to “Measure 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-9279-1openalex-snapshot
Assessing efficiency–effectiveness tradeoffs in multi-stage retrieval systems without using relevance judgments
inferredcites →https://doi.org/10.1007/s10791-016-9290-6openalex-snapshot
Efficient distributed selective search
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.1016/s0306-4379(03)00062-0openalex-snapshot
Efficiency and effectiveness of query processing in cluster-based retrieval
inferredcites →https://doi.org/10.1023/a:1013002601898openalex-snapshot
Binary Interpolative Coding for Effective Index Compression
inferredcites →https://doi.org/10.1145/1148170.1148235openalex-snapshot
Pruned query evaluation using pre-computed impacts
inferredcites →https://doi.org/10.1145/1361684.1361688openalex-snapshot
Incremental cluster-based retrieval using compressed cluster-skipping inverted files
inferredcites →https://doi.org/10.1145/1390334.1390543openalex-snapshot
Site-based dynamic pruning for query processing in search engines
inferredcites →https://doi.org/10.1145/1416950.1416952openalex-snapshot
Rank-biased precision for measurement of retrieval effectiveness
inferredcites →https://doi.org/10.1145/1852102.1852106openalex-snapshot
A similarity measure for indefinite rankings
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/2348283.2348367openalex-snapshot
Learning to predict response times for online query scheduling
inferredcites →https://doi.org/10.1145/2348283.2348464openalex-snapshot
Effect of dynamic pruning safety on learning to rank effectiveness
inferredcites →https://doi.org/10.1145/237496.237497openalex-snapshot
Self-indexing inverted files for fast text retrieval
inferredcites →https://doi.org/10.1145/2396761.2396833openalex-snapshot
Shard ranking and cutoff estimation for topically partitioned collections
inferredcites →https://doi.org/10.1145/2408776.2408794openalex-snapshot
The tail at scale
inferredcites →https://doi.org/10.1145/2433396.2433407openalex-snapshot
Efficient and effective retrieval using selective pruning
inferredcites →https://doi.org/10.1145/2433396.2433486openalex-snapshot
Maguro, a system for indexing and searching over very large text collections
inferredcites →https://doi.org/10.1145/2484028.2484033openalex-snapshot
Taily
inferredcites →https://doi.org/10.1145/2505515.2505699openalex-snapshot
Load-sensitive selective pruning for distributed search
inferredcites →https://doi.org/10.1145/2505515.2507860openalex-snapshot
Maintaining discriminatory power in quantized indexes
inferredcites →https://doi.org/10.1145/2537734.2537744openalex-snapshot
Exploring the magic of WAND
inferredcites →https://doi.org/10.1145/2600428.2609572openalex-snapshot
Predictive parallelization
inferredcites →https://doi.org/10.1145/2600428.2609615openalex-snapshot
Partitioned Elias-Fano indexes
inferredcites →https://doi.org/10.1145/2682862.2682863openalex-snapshot
Improvements to BM25 and Language Models Examined
inferredcites →https://doi.org/10.1145/2684822.2685289openalex-snapshot
Delayed-Dynamic-Selective (DDS) Prediction for Reducing Extreme Tail Latency in Web Search
inferredcites →https://doi.org/10.1145/2738035openalex-snapshot
Selective Search
inferredcites →https://doi.org/10.1145/2766462.2767708openalex-snapshot
Optimal Aggregation Policy for Reducing Tail Latency of Web Search
inferredcites →https://doi.org/10.1145/2808194.2809477openalex-snapshot
Anytime Ranking for Impact-Ordered Indexes
inferredcites →https://doi.org/10.1145/2911451.2911515openalex-snapshot
Fast First-Phase Candidate Generation for Cascading Rankers
inferredcites →https://doi.org/10.1145/2939672.2939862openalex-snapshot
Compressing Graphs and Indexes with Recursive Graph Bisection
inferredcites →https://doi.org/10.1145/2943784openalex-snapshot
Prediction and Predictability for Search Query Acceleration
inferredcites →https://doi.org/10.1145/2983323.2983706openalex-snapshot
Query-Biased Partitioning for Selective Search
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.3080657openalex-snapshot
Learning To Rank Resources
inferredcites →https://doi.org/10.1145/3077136.3080780openalex-snapshot
Faster BlockMax WAND with Variable-sized Blocks
inferredcites →https://doi.org/10.1145/3077136.3080819openalex-snapshot
Efficient Cost-Aware Cascade Ranking in Multi-Stage Retrieval
inferredcites →https://doi.org/10.1145/3130348.3130368openalex-snapshot
A Language Modeling Approach to Information Retrieval
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/3209978.3210005openalex-snapshot
Dynamic Shard Cutoff Prediction for Selective Search
inferredcites →https://doi.org/10.1145/3209978.3210066openalex-snapshot
Split-Lists and Initial Thresholds for WAND-based Search
inferredcites →https://doi.org/10.1145/3239571openalex-snapshot
Anserini
inferredcites →https://doi.org/10.1145/3289600.3290986openalex-snapshot
Joint Optimization of Cascade Ranking Models
inferredcites →https://doi.org/10.1145/3291992.3292001openalex-snapshot
Elias Revisited
inferredcites →https://doi.org/10.1145/3331184.3331207openalex-snapshot
Accelerated Query Processing Via Similarity Score Prediction
inferredcites →https://doi.org/10.1145/3340531.3412080openalex-snapshot
A Comparison of Top-k Threshold Estimation Techniques for Disjunctive Query Processing
inferredcites →https://doi.org/10.1145/3357384.3358154openalex-snapshot
Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines
inferredcites →https://doi.org/10.1145/3389795openalex-snapshot
Using an Inverted Index Synopsis for Query Latency and Performance Prediction
inferredcites →https://doi.org/10.1145/3397271.3401075openalex-snapshot
ColBERT
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.3462991openalex-snapshot
Faster Index Reordering with Bipartite Graph Partitioning
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.1561/1500000019openalex-snapshot
The Probabilistic Relevance Framework: BM25 and Beyond
inferredcites →https://doi.org/10.21236/ada477388openalex-snapshot
Million Query Track 2007 Overview

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-032-21321-1_1openalex-snapshot
Practical, Efficient, In-Memory Inverted Indexes
inferred← citeshttps://doi.org/10.1007/s11390-024-3040-9openalex-snapshot
Caching Document Identifiers to Speedup Query Processing in Search Servers
inferred← citeshttps://doi.org/10.1016/j.ipm.2023.103359openalex-snapshot
Many are Better than One: Algorithm Selection for Faster Top-K Retrieval
inferred← citeshttps://doi.org/10.1109/tkde.2022.3208902openalex-snapshot
Tradeoff Options for Bipartite Graph Partitioning
inferred← citeshttps://doi.org/10.1145/3503516.3503528openalex-snapshot
Cost-Effective Updating of Distributed Reordered Indexes
inferred← citeshttps://doi.org/10.1145/3539618.3591806openalex-snapshot
Profiling and Visualizing Dynamic Pruning Algorithms
inferred← citeshttps://doi.org/10.1145/3539618.3591941openalex-snapshot
A Static Pruning Study on Sparse Neural Retrievers
inferred← citeshttps://doi.org/10.1145/3539618.3591983openalex-snapshot
Exploiting Cluster-Skipping Inverted Index for Semantic Place Retrieval
inferred← citeshttps://doi.org/10.1145/3539618.3592051openalex-snapshot
Representation Sparsification with Hybrid Thresholding for Fast SPLADE-based Document Retrieval
inferred← citeshttps://doi.org/10.1145/3576922openalex-snapshot
Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations
inferred← citeshttps://doi.org/10.1145/3626772.3657906openalex-snapshot
Faster Learned Sparse Retrieval with Block-Max Pruning
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.3731688openalex-snapshot
Efficient In-Memory Inverted Indexes: Theory and Practice
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.18653/v1/2022.findings-emnlp.205openalex-snapshot
Accelerating Learned Sparse Indexes Via Term Impact Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.2110.11540openalex-snapshot
Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation
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.