Faster top-k document retrieval using block-max indexes

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

• Publication date

  2011-07-24

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/2009916.2010048
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Interval-based pruning for top-k processing over compressed lists

  2011cited by this paper
• Proceedings of the 19th international conference on World wide web

  2010cited by this paper
• VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming

  2010cited by this paper
• Scalable techniques for document identifier assignment in inverted indexes

  2010cited by this paper
• Probabilistic static pruning of inverted files

  2010cited by this paper
• Challenges in building large-scale information retrieval systems: invited talk

  2009cited by this paper
• Compressing term positions in web indexes

  2009cited by this paper
• Inverted index compression and query processing with optimized document ordering

  2009influential reference
• Performance of compressed inverted list caching in search engines

  2008cited by this paper
• Incremental cluster-based retrieval using compressed cluster-skipping inverted files

  2008cited by this paper
• Efficient document retrieval in main memory

  2007influential reference
• Sorting Out the Document Identifier Assignment Problem

  2007cited by this paper
• Pruning policies for two-tiered inverted index with correctness guarantee

  2007cited by this paper
• Index compression is good, especially for random access

  2007cited by this paper
• The impact of caching on search engines

  2007cited by this paper
• Inverted files for text search engines

  2006cited by this paper
• IO-Top-k: index-access optimized top-k query processing

  2006cited by this paper
• Pruned query evaluation using pre-computed impacts

  2006influential reference
• TSP and cluster-based solutions to the reassignment of document identifiers

  2006cited by this paper
• Query-driven document partitioning and collection selection

  2006cited by this paper
• Simplified similarity scoring using term ranks

  2005cited by this paper
• Optimization strategies for complex queries

  2005cited by this paper
• Optimized Query Execution in Large Search Engines with Global Page Ordering

  2003cited by this paper
• Efficient query evaluation using a two-level retrieval process

  2003influential reference
• Inverted file compression through document identifier reassignment

  2003cited by this paper
• Optimizing result prefetching in web search engines with segmented indices

  2002cited by this paper
• Combining fuzzy information: an overview

  2002influential reference
• Evaluating top-k queries over Web-accessible databases

  2002cited by this paper
• Distributed query processing using partitioned inverted files

  2001cited by this paper
• Optimal aggregation algorithms for middleware

  2001cited by this paper
• Static index pruning for information retrieval systems

  2001cited by this paper
• Vector-space ranking with effective early termination

  2001cited by this paper
• Building a distributed full-text index for the Web

  2001cited by this paper
• Building a distributed full-text index for the web

  2001cited by this paper
• Filtered Document Retrieval with Frequency-Sorted Indexes

  1996cited by this paper
• Query Evaluation: Strategies and Optimizations

  1995influential reference
• Implementations of Partial Document Ranking Using Inverted Files

  1993cited by this paper
• Optimization of inverted vector searches

  1985cited by this paper

• Col-Bandit: Zero-Shot Query-Time Pruning for Late-Interaction Retrieval

  2026cites this paper
• Efficiency Optimizations for Superblock-based Sparse Retrieval

  2026cites this paper
• Neural Lexical Search with Learned Sparse Retrieval

  2025cites this paper
• Empirical Asymptotic Growth of Dynamic Pruning Mechanisms

  2025cites this paper
• Efficient In-Memory Inverted Indexes: Theory and Practice

  2025cites this paper
• Fast and Effective Early Termination for Simple Ranking Functions

  2025cites this paper
• Efficient Recommendation with Millions of Items by Dynamic Pruning of Sub-Item Embeddings

  2025cites this paper
• Balancing the Blend: An Experimental Analysis of Trade-offs in Hybrid Search

  2025cites this paper
• Dynamic Superblock Pruning for Fast Learned Sparse Retrieval

  2025cites this paper
• An Alternative to FLOPS Regularization to Effectively Productionize SPLADE-Doc

  2025cites this paper
• Approximating Opaque Top-k Queries

  2025cites this paper
• Pruning in Snowflake: Working Smarter, Not Harder

  2025influential citation
• Guiding Retrieval using LLM-based Listwise Rankers

  2025cites this paper
• Caching Document Identifiers to Speedup Query Processing in Search Servers

  2025cites this paper
• Breaking the Lens of the Telescope: Online Relevance Estimation over Large Retrieval Sets

  2025cites this paper
• Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets

  2025cites this paper
• Text Matching Indexers in Taobao Search

  2024cites this paper
• Approximate Cluster-Based Sparse Document Retrieval with Segmented Maximum Term Weights

  2024cites this paper
• Two-Step SPLADE: Simple, Efficient and Effective Approximation of SPLADE

  2024cites this paper
• Neural Lexical Search with Learned Sparse Retrieval

  2024cites this paper
• Towards Competitive Search Relevance For Inference-Free Learned Sparse Retrievers

  2024cites this paper
• Beyond Quantile Methods: Improved Top-K Threshold Estimation for Traditional and Learned Sparse Indexes

  2024influential citation
• Threshold-driven Pruning with Segmented Maximum Term Weights for Approximate Cluster-based Sparse Retrieval

  2024influential citation
• Annotative Indexing

  2024influential citation
• Neural Passage Quality Estimation for Static Pruning

  2024cites this paper
• Quam: Adaptive Retrieval through Query Affinity Modelling

  2024cites this paper
• Shallow Cross-Encoders for Low-Latency Retrieval

  2024cites this paper
• A Reproducibility Study of PLAID

  2024cites this paper
• Improved Learned Sparse Retrieval with Corpus-Specific Vocabularies

  2024cites this paper
• DyVo: Dynamic Vocabularies for Learned Sparse Retrieval with Entities

  2024cites this paper
• Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations

  2024cites this paper
• Accelerating Spherical K-Means Clustering for Large-Scale Sparse Document Data

  2024cites this paper
• RTop-K: Ultra-Fast Row-Wise Top-K Selection for Neural Network Acceleration on GPUs

  2024cites this paper
• Driving with Regulation: Interpretable Decision-Making for Autonomous Vehicles with Retrieval-Augmented Reasoning via LLM

  2024cites this paper
• Faster Learned Sparse Retrieval with Block-Max Pruning

  2024influential citation
• Efficient Approximate Maximum Inner Product Search Over Sparse Vectors

  2024cites this paper
• Efficient Inverted Index-based Approximate Retrieval over High-dimensional Learned Sparse Representations

  2024cites this paper
• Towards Effective and Efficient Sparse Neural Information Retrieval

  2023cites this paper
• Profiling and Visualizing Dynamic Pruning Algorithms

  2023cites this paper
• Bridging Dense and Sparse Maximum Inner Product Search

  2023cites this paper
• Privacy-aware document retrieval with two-level inverted indexing

  2023influential citation
• Lexically-Accelerated Dense Retrieval

  2023cites this paper
• Many are Better than One: Algorithm Selection for Faster Top-K Retrieval

  2023cites this paper
• Sparkly: A Simple yet Surprisingly Strong TF/IDF Blocker for Entity Matching

  2023cites this paper
• A Survey of Secure Computation Using Trusted Execution Environments

  2023cites this paper
• Reverse Maximum Inner Product Search: Formulation, Algorithms, and Analysis

  2023cites this paper
• Optimizing Guided Traversal for Fast Learned Sparse Retrieval

  2023cites this paper
• Doc2Query-: When Less is More

  2023cites this paper
• Efficient and Effective Tree-based and Neural Learning to Rank

  2023cites this paper
• An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors

  2023cites this paper
• Tradeoff Options for Bipartite Graph Partitioning

  2023cites this paper
• An NVM SSD-Based High Performance Query Processing Framework for Search Engines

  2023cites this paper
• Faster Dynamic Pruning via Reordering of Documents in Inverted Indexes

  2023influential citation
• Efficient query processing techniques for next-page retrieval

  2022cites this paper
• Using Conjunctions for Faster Disjunctive Top-k Queries

  2022influential citation
• Efficient and Accurate Non-Metric k-NN Search with Applications to Text Matching

  2022influential citation
• PLAID: An Efficient Engine for Late Interaction Retrieval

  2022cites this paper
• Expanding Spatial Regions and Incorporating IDF for PHOC-Based Math Formula Retrieval at ARQMath-3

  2022cites this paper
• A Sketch-based Index for Correlated Dataset Search

  2022cites this paper
• Accelerating Learned Sparse Indexes Via Term Impact Decomposition

  2022influential citation
• Efficient Immediate-Access Dynamic Indexing

  2022cites this paper
• A Python Interface to PISA!

  2022cites this paper
• SpaDE: Improving Sparse Representations using a Dual Document Encoder for First-stage Retrieval

  2022cites this paper
• Efficient Document-at-a-time and Score-at-a-time Query Evaluation for Learned Sparse Representations

  2022cites this paper
• Faster Learned Sparse Retrieval with Guided Traversal

  2022cites this paper
• Dual Skipping Guidance for Document Retrieval with Learned Sparse Representations

  2022influential citation
• An Efficiency Study for SPLADE Models

  2022cites this paper
• Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation

  2021cites this paper
• Cost-Effective Updating of Distributed Reordered Indexes

  2021cites this paper
• XY-PHOC Symbol Location Embeddings for Math Formula Retrieval and Autocompletion

  2021cites this paper
• A DFT-Based Running Time Prediction Algorithm for Web Queries

  2021cites this paper
• Window Navigation with Adaptive Probing for Executing BlockMax WAND

  2021influential citation
• Faster Index Reordering with Bipartite Graph Partitioning

  2021cites this paper
• Reverse Maximum Inner Product Search: How to efficiently find users who would like to buy my item?

  2021cites this paper
• Fast Disjunctive Candidate Generation Using Live Block Filtering

  2021influential citation
• Anytime Ranking on Document-Ordered Indexes

  2021cites this paper
• BOSS: Bandwidth-Optimized Search Accelerator for Storage-Class Memory

  2021influential citation
• Dr. Top-k: Delegate-Centric Top-k on GPUs

  2021cites this paper
• Index Obfuscation for Oblivious Document Retrieval in a Trusted Execution Environment

  2020influential citation
• Examining the Additivity of Top-k Query Processing Innovations

  2020cites this paper
• Gemini: Learning to Manage CPU Power for Latency-Critical Search Engines

  2020cites this paper
• A Comparison of Top-k Threshold Estimation Techniques for Disjunctive Query Processing

  2020cites this paper
• Pipelined Query Processing Using Non-volatile Memory SSDs

  2020cites this paper
• Hybrid Dynamic Pruning for Efficient and Effective Query Processing

  2020influential citation
• Using an Inverted Index Synopsis for Query Latency and Performance Prediction

  2020cites this paper
• Scalable top-k retrieval with Sparta

  2020cites this paper
• A Survey on Trajectory Data Management, Analytics, and Learning

  2020cites this paper
• Combining instance and feature neighbours for extreme multi-label classification

  2020cites this paper
• Accelerating Substructure Similarity Search for Formula Retrieval

  2020cites this paper
• Efficiency Implications of Term Weighting for Passage Retrieval

  2020cites this paper
• To index or not to index: Time-space trade-offs for positional ranking functions in search engines

  2020cites this paper
• From MAXSCORE to Block-Max Wand: The Story of How Lucene Significantly Improved Query Evaluation Performance

  2020influential citation
• An NVM SSD-Optimized Query Processing Framework

  2020influential citation
• Finding the Best of Both Worlds: Faster and More Robust Top-k Document Retrieval

  2020influential citation
• Optimizing Scoring and Sorting Operations for Faster WAND Processing

  2020cites this paper
• The Performance Envelope of Inverted Indexing on Modern Hardware

  2019cites this paper
• Efficient Main-Memory Top-K Selection For Multicore Architectures

  2019cites this paper
• Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines

  2019cites this paper
• Faster BlockMax WAND with Longer Skipping

  2019influential citation
• Fast trajectory search for real-world applications

  2019cites this paper