Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design
Summary: Vector Quotient Filter (VQF) uses power-of-two-choices hashing and SIMD for O(1) cost, stable across loads. Inserts ~2x Morton; lookups/deletes on par with cuckoo; thread-safe variant enables ~3x insertion throughput with four threads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Prashant Pandey (Lawrence Berkeley National Laboratory; University of California Berkeley)
- 2. Alex Conway (VMware)
- 3. Joe Durie (Rutgers University)
- 4. Michael A. Bender (State University of New York at Stony Brook)
- 5. Martin Farach-Colton (Rutgers University)
- 6. Rob Johnson (VMware)
BibTeX Citation
@inproceedings{pandey_sigmod21,
title = {{Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design}},
author = {Pandey, Prashant and Conway, Alex and Durie, Joe and Bender, Michael A. and Farach-Colton, Martin and Johnson, Rob},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3452841},
url = {https://dl.acm.org/doi/10.1145/3448016.3452841},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 446 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD | 0.00018332392 |
| 789 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.0001401724 |
| 1,874 | Storage Management in AsterixDB | 2014 | VLDB | 9.5750002e-05 |
| 1,975 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 9.3645236e-05 |
| 2,043 | A General-Purpose Counting Filter: Making Every Bit Count | 2017 | SIGMOD | 9.2674387e-05 |
| 11,759 | Timely Reporting of Heavy Hitters using External Memory | 2020 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,532 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB |
| 2 | 4,960 | InfiniFilter: Expanding Filters to Infinity and Beyond | 2023 | SIGMOD |
| 3 | 10,225 | Dynamic Flat Filter: A Unified Framework for Scalable and Stable Fingerprint-Based Filters | 2026 | SIGMOD |
| 4 | 10,434 | Breadcrumb Filters: Fast Fully Featured Filters | 2026 | SIGMOD |
| 5 | 3,510 | Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput | 2019 | VLDB |
| 6 | 10,004 | A four-dimensional Analysis of Partitioned Approximate Filters | 2021 | VLDB |
| 7 | 6,539 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB |
| 8 | 2,043 | A General-Purpose Counting Filter: Making Every Bit Count | 2017 | SIGMOD |
| 9 | 8,892 | Adaptive Quotient Filters | 2024 | SIGMOD |
| 10 | 1,975 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB |