Adaptive and High-performance Filters for Modern Workloads

Theoretically grounded, high-performance filters (approximate membership data structures) for modern workloads.

Filters — approximate membership data structures like the Bloom filter — are everywhere in storage systems, databases, networking, and computational biology. This project rethinks filter design to be simultaneously fast, space-efficient, feature-rich, and theoretically grounded.

We introduced the counting quotient filter (Pandey et al., 2017), which packs more functionality into less space, and the vector quotient filter (Pandey et al., 2021) for high throughput on modern hardware. More recent work makes filters adaptive to their workloads (Wen et al., 2025; Chesetti & Pandey, 2026), strongly and monotonically adaptive over ranges (Chesetti et al., 2026), and fully featured (Krapivin et al., 2026). We have also designed filters for similarity search over trajectories (Bhat et al., 2023) and for GPUs (McCoy et al., 2023), and surveyed the emerging design space in a tutorial (Pandey et al., 2024).

References

2026

  1. SIGMOD 2026
    To Adapt or Not to Adapt, That is the Ski Question
    Yuvaraj Chesetti and Prashant Pandey
    In ACM Special Interest Group on Management of Data 2026, 2026
  2. SIGMOD 2026
    Aeris Filter: A Strongly and Monotonically Adaptive Range Filter
    Yuvaraj Chesetti, Navid Eslami, Huanchen Zhang, and 2 more authors
    In ACM Special Interest Group on Management of Data 2026, 2026
  3. SIGMOD 2026
    Breadcrumb Filters: Fast Fully Featured Filters
    Andrew Krapivin, Aaditya Rangarajan, Alex Conway, and 3 more authors
    In ACM Special Interest Group on Management of Data 2026, 2026

2025

  1. SIGMOD 2025
    Adaptive Quotient Filters
    Richard Wen, Hunter McCoy, David Tench, and 6 more authors
    Proc. ACM Manag. Data, 2025

2024

  1. SIGMOD 2024
    Beyond Bloom: A Tutorial on Future Feature-Rich Filters
    Prashant Pandey, Martı́n Farach-Colton, Niv Dayan, and 1 more author
    In Companion of the 2024 International Conference on Management of Data, SIGMOD/PODS 2024, Santiago AA, Chile, June 9-15, 2024, 2024

2023

  1. APOCS 23
    Distance and Time Sensitive Filters for Similarity Search in Trajectory Datasets
    Madhav Narayan Bhat, Paul Cesaretti, Mayank Goswami, and 1 more author
    In 2023 Symposium on Algorithmic Principles of Computer Systems, APOCS 2023, Florence, Italy, January 25, 2023, 2023
  2. PPOPP 2023
    High-Performance Filters for GPUs
    Hunter McCoy, Steven A. Hofmeyr, Katherine A. Yelick, and 1 more author
    In Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023, Montreal, QC, Canada, 25 February 2023 - 1 March 2023, 2023

2021

  1. SIGMOD 2021
    Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design
    Prashant Pandey, Alex Conway, Joe Durie, and 3 more authors
    In SIGMOD ’21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021, 2021

2017

  1. SIGMOD 2017
    A General-Purpose Counting Filter: Making Every Bit Count
    Prashant Pandey, Michael A. Bender, Rob Johnson, and 1 more author
    In Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, May 14-19, 2017, 2017