Breadcrumb Filters: Fast Fully Featured Filters

Summary: Breadcrumb Filter (BCF): new enumerable/full-featured filter with insert/delete/merge/count support, built to beat VQF on speed and space. Up to 34% faster inserts, query-competitive, and more space-efficient than VQF/prefix/cuckoo/BBF. (summarized by gpt-5-mini on Apr 11 2026)

Paper ID: 7646
Venue: SIGMOD
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,434 | 28.42%
DOI: 10.1145/3786629

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Andrew Krapivin (Carnegie Mellon University)
2. Aaditya Rangarajan (University of Utah)
3. Alex Conway (Cornell Tech)
4. Martín Farach-Colton (New York University)
5. Rob Johnson (VMware)
6. Prashant Pandey (Northeastern University)

BibTeX Citation

@inproceedings{krapivin_sigmod26,
        title = {{Breadcrumb Filters: Fast Fully Featured Filters}},
        author = {Krapivin, Andrew and Rangarajan, Aaditya and Conway, Alex and Farach-Colton, Martín and Johnson, Rob and Pandey, Prashant},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3786629},
        url = {https://dl.acm.org/doi/10.1145/3786629},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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,954	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.4208165e-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
3,773	SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy	2023	SIGMOD	7.1384476e-05
3,798	Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design	2021	SIGMOD	7.1165678e-05
4,960	InfiniFilter: Expanding Filters to Infinity and Beyond	2023	SIGMOD	6.4280133e-05
6,539	Prefix Filter: Practically and Theoretically Better Than Bloom	2022	VLDB	5.8473945e-05
7,638	IcebergHT: High Performance Hash Tables Through Stability and Low Associativity	2023	SIGMOD	5.5768492e-05
7,776	Aleph Filter: To Infinity in Constant Time	2024	VLDB	5.5464036e-05
10,799	Zombie Hashing: Reanimating Tombstones in a Graveyard	2025	SIGMOD	5.093636e-05
11,759	Timely Reporting of Heavy Hitters using External Memory	2020	SIGMOD	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,892	Adaptive Quotient Filters	2024	SIGMOD
2	4,073	Stable Learned Bloom Filters for Data Streams	2020	VLDB
3	862	Spectral Bloom Filters	2003	SIGMOD
4	1,975	Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity	2018	VLDB
5	2,043	A General-Purpose Counting Filter: Making Every Bit Count	2017	SIGMOD
6	4,532	Stacked Filters: Learning to Filter by Structure	2021	VLDB
7	3,798	Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design	2021	SIGMOD
8	10,004	A four-dimensional Analysis of Partitioned Approximate Filters	2021	VLDB
9	3,510	Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput	2019	VLDB
10	6,539	Prefix Filter: Practically and Theoretically Better Than Bloom	2022	VLDB