A General-Purpose Counting Filter: Making Every Bit Count
Summary: Counting Quotient Filter (CQF): a general AMQ with counting, deletions, resizing, merging, and high-concurrency, strong locality. Outperforms Bloom/quotient/cuckoo; fast counting to 95% load via metadata reorg into rank–select; Haswell tricks boost speed. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Prashant Pandey (State University of New York at Stony Brook)
- 2. Michael A. Bender (State University of New York at Stony Brook)
- 3. Rob Johnson (State University of New York at Stony Brook)
- 4. Rob Patro (State University of New York at Stony Brook)
BibTeX Citation
@inproceedings{pandey_sigmod17,
title = {{A General-Purpose Counting Filter: Making Every Bit Count}},
author = {Pandey, Prashant and Bender, Michael A. and Johnson, Rob and Patro, Rob},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3035963},
url = {https://dl.acm.org/doi/10.1145/3035918.3035963},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 29 of 29 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 451 | Mergeable Summaries | 2012 | PODS | 0.00018151445 |
| 789 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.0001401724 |
| 862 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00013532857 |
| 1,874 | Storage Management in AsterixDB | 2014 | VLDB | 9.5750002e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,612 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD |
| 2 | 4,960 | InfiniFilter: Expanding Filters to Infinity and Beyond | 2023 | SIGMOD |
| 3 | 4,532 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB |
| 4 | 11,423 | A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams | 2023 | 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 | 8,892 | Adaptive Quotient Filters | 2024 | SIGMOD |
| 9 | 3,798 | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design | 2021 | SIGMOD |
| 10 | 1,975 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB |