Preprint alert!
arxiv.org/abs/2602.03525
TLDR:
ZOR filters are STATIC filters with false positives.
-Almost memory optimal: <1% overhead over the theoretical lower bound (!!!)
-Fast queries: ~100 ns
-Construction cannot fail
A thread:
arxiv.org
Probabilistic membership filters support fast approximate membership queries with a controlled false-positive probability $\varepsilon$ and are widely used across storage, analytics, networking, and b...
