On the public citation graph

Efficient Query Processing for Scalable Web Search

https://doi.org/10.1561/1500000057
0 signed · 84 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 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-030-45439-5_47openalex-snapshot
Accelerating Substructure Similarity Search for Formula Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-031-28241-6_6openalex-snapshot
Index-Based Batch Query Processing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-56060-6_23openalex-snapshot
Two-Step SPLADE: Simple, Efficient and Effective Approximation of SPLADE
inferred← citeshttps://doi.org/10.1007/978-3-031-88714-7_15openalex-snapshot
Approximate Bag-of-Words Top-k Corpus Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-88714-7_43openalex-snapshot
Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets
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/978-3-032-21324-2_1openalex-snapshot
Fast, Compact, Immediate-Access Indexing for Learned Sparse Retrieval Systems
inferred← citeshttps://doi.org/10.1007/s11804-025-00772-8openalex-snapshot
An Integrated Lightweight YOLO Framework Combining Structured Pruning, Knowledge Distillation, and Multi-Frame Linear Interpolation for Robust Real-Time Nonlinear Dynamic Response Analysis of Small-Scale Underwater Targets under Bubble Loading
inferred← citeshttps://doi.org/10.1016/j.ipm.2019.102193openalex-snapshot
Topical result caching in web search engines
inferred← citeshttps://doi.org/10.1016/j.ipm.2021.102682openalex-snapshot
Adaptive utterance rewriting for conversational search
inferred← citeshttps://doi.org/10.1016/j.ipm.2022.103248openalex-snapshot
Efficient immediate-access dynamic indexing
inferred← citeshttps://doi.org/10.1063/5.0199088openalex-snapshot
Effect of ’Wh’ questions in ask search engine’s performance
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00264openalex-snapshot
A Sketch-based Index for Correlated Dataset Search
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00138openalex-snapshot
Columnar Formatted Inverted Index for Highly-Paralleled, Vectorized Query Processing
inferred← citeshttps://doi.org/10.1109/isca52012.2021.00030openalex-snapshot
BOSS: Bandwidth-Optimized Search Accelerator for Storage-Class Memory
inferred← citeshttps://doi.org/10.1109/tsc.2024.3451185openalex-snapshot
When Search Engine Services Meet Large Language Models: Visions and Challenges
inferred← citeshttps://doi.org/10.1145/3331184.3331297openalex-snapshot
Multiple Query Processing via Logic Function Factoring
inferred← citeshttps://doi.org/10.1145/3340531.3412000openalex-snapshot
Examining the Additivity of Top-k Query Processing Innovations
inferred← citeshttps://doi.org/10.1145/3389795openalex-snapshot
Using an Inverted Index Synopsis for Query Latency and Performance Prediction
inferred← citeshttps://doi.org/10.1145/3397271.3401076openalex-snapshot
Finding the Best of Both Worlds
inferred← citeshttps://doi.org/10.1145/3397271.3401093openalex-snapshot
Efficient Document Re-Ranking for Transformers by Precomputing Term Representations
inferred← citeshttps://doi.org/10.1145/3397271.3401262openalex-snapshot
Expansion via Prediction of Importance with Contextualization
inferred← citeshttps://doi.org/10.1145/3397271.3401263openalex-snapshot
Efficiency Implications of Term Weighting for Passage Retrieval
inferred← citeshttps://doi.org/10.1145/3404835.3463109openalex-snapshot
Window Navigation with Adaptive Probing for Executing BlockMax WAND
inferred← citeshttps://doi.org/10.1145/3409256.3409829openalex-snapshot
Declarative Experimentation in Information Retrieval using PyTerrier
inferred← citeshttps://doi.org/10.1145/3428687openalex-snapshot
Weighting Passages Enhances Accuracy
inferred← citeshttps://doi.org/10.1145/3459637.3482013openalex-snapshot
PyTerrier: Declarative Experimentation in Python from BM25 to Dense Retrieval
inferred← citeshttps://doi.org/10.1145/3459637.3482162openalex-snapshot
Query Embedding Pruning for Dense Retrieval
inferred← citeshttps://doi.org/10.1145/3477495.3531740openalex-snapshot
The Istella22 Dataset
inferred← citeshttps://doi.org/10.1145/3477495.3531766openalex-snapshot
Reduce, Reuse, Recycle
inferred← citeshttps://doi.org/10.1145/3477495.3531774openalex-snapshot
Faster Learned Sparse Retrieval with Guided Traversal
inferred← citeshttps://doi.org/10.1145/3511808.3557231openalex-snapshot
Adaptive Re-Ranking with a Corpus Graph
inferred← citeshttps://doi.org/10.1145/3511808.3557325openalex-snapshot
PLAID
inferred← citeshttps://doi.org/10.1145/3527546.3527552openalex-snapshot
A proposed conceptual framework for a representational approach to information retrieval
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/3543507.3583497openalex-snapshot
Optimizing Guided Traversal for Fast Learned Sparse Retrieval
inferred← citeshttps://doi.org/10.1145/3573128.3604896openalex-snapshot
Static Pruning for Multi-Representation Dense 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/3578337.3605129openalex-snapshot
Exploring the Representation Power of SPLADE Models
inferred← citeshttps://doi.org/10.1145/3578337.3605131openalex-snapshot
KALE: Using a K-Sparse Projector for Lexical Expansion
inferred← citeshttps://doi.org/10.1145/3609797openalex-snapshot
An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors
inferred← citeshttps://doi.org/10.1145/3624988openalex-snapshot
Personalized Query Expansion with Contextual Word Embeddings
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.3657794openalex-snapshot
Fairness-Aware Exposure Allocation via Adaptive Reranking
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/3626772.3657931openalex-snapshot
A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3634912openalex-snapshot
Towards Effective and Efficient Sparse Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3641203openalex-snapshot
Special Section on Efficiency in Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3664190.3672508openalex-snapshot
CFE2: Counterfactual Editing for Search Result Explanation
inferred← citeshttps://doi.org/10.1145/3664190.3672513openalex-snapshot
Learning to Rank for Non Independent and Identically Distributed Datasets
inferred← citeshttps://doi.org/10.1145/3665324openalex-snapshot
Bridging Dense and Sparse Maximum Inner Product Search
inferred← citeshttps://doi.org/10.1145/3674127openalex-snapshot
Information Retrieval
inferred← citeshttps://doi.org/10.1145/3674127.3674128openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3674127.3674129openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3674127.3674130openalex-snapshot
Neural Information Retrieval
inferred← citeshttps://doi.org/10.1145/3674127.3674131openalex-snapshot
Recommender Systems
inferred← citeshttps://doi.org/10.1145/3674127.3674132openalex-snapshot
Evaluation of IR Systems
inferred← citeshttps://doi.org/10.1145/3674127.3674133openalex-snapshot
Query-driven Search Functionality
inferred← citeshttps://doi.org/10.1145/3674127.3674134openalex-snapshot
Knowledge Graphs and Search
inferred← citeshttps://doi.org/10.1145/3674127.3674135openalex-snapshot
Conversational Search
inferred← citeshttps://doi.org/10.1145/3674127.3674136openalex-snapshot
Cross-language Retrieval
inferred← citeshttps://doi.org/10.1145/3674127.3674137openalex-snapshot
Temporal Extraction and Retrieval
inferred← citeshttps://doi.org/10.1145/3674127.3674138openalex-snapshot
Bias in Retrieval Systems
inferred← citeshttps://doi.org/10.1145/3674127.3674139openalex-snapshot
Privacy in Information Retrieval
inferred← citeshttps://doi.org/10.1145/3674127.3674140openalex-snapshot
eCommerce Search and Discovery
inferred← citeshttps://doi.org/10.1145/3674127.3674141openalex-snapshot
Professional Search
inferred← citeshttps://doi.org/10.1145/3674127.3674142openalex-snapshot
Searching Personal Collections
inferred← citeshttps://doi.org/10.1145/3674127.3702959openalex-snapshot
Audio-based Music Retrieval
inferred← citeshttps://doi.org/10.1145/3674127.3702960openalex-snapshot
IR in Biomedicine
inferred← citeshttps://doi.org/10.1145/3674127.3702961openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1145/3674127.3702962openalex-snapshot
Authors’ Biography/Index
inferred← citeshttps://doi.org/10.1145/3701551.3703482openalex-snapshot
Advances in Vector Search
inferred← citeshttps://doi.org/10.1145/3726302.3729963openalex-snapshot
Efficient Recommendation with Millions of Items by Dynamic Pruning of Sub-Item Embeddings
inferred← citeshttps://doi.org/10.1145/3726302.3730051openalex-snapshot
Optimizing Compound Retrieval Systems
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.3731688openalex-snapshot
Efficient In-Memory Inverted Indexes: Theory and Practice
inferred← citeshttps://doi.org/10.1145/3767695.3769477openalex-snapshot
Empirical Asymptotic Growth of Dynamic Pruning Mechanisms
inferred← citeshttps://doi.org/10.1145/3805712.3809875openalex-snapshot
Load-sensitive Selective Pruning in Dense Retrieval
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
inferred← citeshttps://doi.org/10.54195/irrj.23893openalex-snapshot
Simple Techniques for Efficient Top-k Batch Query Processing
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.