Zeno Filter: To Infinity in Tiny Steps

Summary: Zeno Filter is an expandable probabilistic filter that avoids conventional 2× growth via subdoubling “stretching” and expands in place through succinct indirection. It cuts space usage by up to 60% while preserving existing filters’ speed and accuracy. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID: hd304b920c0770c8d
Venue: SIGMOD
Year: 2026
Pagerank: 4.9793485e-05
Overall Rank: 10,518 | 29.29%
DOI: 10.1145/3802128

Incoming Non-self Citations Over Time

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

Authors

1. Hyuhng Min Kim (University of Toronto)
2. Navid Eslami (University of Toronto)
3. Niv Dayan (University of Toronto)

BibTeX Citation

@inproceedings{kim_sigmod26,
        title = {{Zeno Filter: To Infinity in Tiny Steps}},
        author = {Kim, Hyuhng Min and Eslami, Navid and Dayan, Niv},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802128},
        url = {https://dl.acm.org/doi/10.1145/3802128},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,507	Sublime: Sublinear Error & Space for Unbounded Skewed Streams	2026	SIGMOD	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 18 of 18 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
400	Monkey: Optimal Navigable Key-Value Store	2017	SIGMOD	0.00019129175
546	Faster: A Concurrent Key-Value Store with In-Place Updates	2018	SIGMOD	0.00016590738
754	Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging	2018	SIGMOD	0.00014236015
789	Don't Thrash: How to Cache Your Hash on Flash	2012	VLDB	0.0001397781
816	SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data	2017	VLDB	0.00013687311
848	Benchmarking Learned Indexes	2021	VLDB	0.00013506188
974	FlashStore: High Throughput Persistent Key-Value Store	2010	VLDB	0.00012757454
1,422	The Log-Structured Merge-Bush & the Wacky Continuum	2019	SIGMOD	0.00010725538
1,665	SkimpyStash: RAM Space Skimpy Key-Value Store on Flash-based Storage	2011	SIGMOD	9.9384098e-05
1,980	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.2595896e-05
2,071	A General-Purpose Counting Filter: Making Every Bit Count	2017	SIGMOD	9.0866982e-05
4,750	GRF: A Global Range Filter for LSM-Trees with Shape Encoding	2024	SIGMOD	6.4354422e-05
5,081	InfiniFilter: Expanding Filters to Infinity and Beyond	2023	SIGMOD	6.2854372e-05
6,547	Memento Filter: A Fast, Dynamic, and Robust Range Filter	2024	SIGMOD	5.7509499e-05
7,940	Aleph Filter: To Infinity in Constant Time	2024	VLDB	5.4219572e-05
8,132	Diva: Dynamic Range Filter for Var-Length Keys and Queries	2025	VLDB	5.3931086e-05
9,647	Sphinx: A Succinct Perfect Hash Index for x86	2025	VLDB	5.1453267e-05
10,615	Aeris Filter: A Strongly and Monotonically Adaptive Range Filter	2026	SIGMOD	4.9793485e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	870	Spectral Bloom Filters	2003	SIGMOD
2	10,441	Dynamic Flat Filter: A Unified Framework for Scalable and Stable Fingerprint-Based Filters	2026	SIGMOD
3	10,142	A four-dimensional Analysis of Partitioned Approximate Filters	2021	VLDB
4	6,547	Memento Filter: A Fast, Dynamic, and Robust Range Filter	2024	SIGMOD
5	10,615	Aeris Filter: A Strongly and Monotonically Adaptive Range Filter	2026	SIGMOD
6	6,192	Prefix Filter: Practically and Theoretically Better Than Bloom	2022	VLDB
7	4,625	Stacked Filters: Learning to Filter by Structure	2021	VLDB
8	1,844	Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity	2018	VLDB
9	7,940	Aleph Filter: To Infinity in Constant Time	2024	VLDB
10	5,081	InfiniFilter: Expanding Filters to Infinity and Beyond	2023	SIGMOD