Ribbon filter: practically smaller than Bloom and Xor
Peter C. Dillinger, Stefan Walzer

TL;DR
The paper introduces the Ribbon filter, a new static set filter that offers configurable space overheads and false positive rates, outperforming existing filters in speed and space efficiency, especially for larger false positive rates.
Contribution
The paper presents the Ribbon filter, a novel filter structure that improves on existing filters by providing better speed and space efficiency, with a flexible construction method and practical enhancements.
Findings
Ribbon filter achieves space overhead below 10% in many cases.
Ribbon filter can operate with false positive rates as high as 2^{-7}.
Experimental results show Ribbon is faster or more space-efficient than existing filters.
Abstract
Filter data structures over-approximate a set of hashable keys, i.e. set membership queries may incorrectly come out positive. A filter with false positive rate is known to require bits per key. At least for larger , existing practical filters require a space overhead of at least 20% with respect to this information-theoretic bound. We introduce the Ribbon filter: a new filter for static sets with a broad range of configurable space overheads and false positive rates with competitive speed over that range, especially for larger . In many cases, Ribbon is faster than existing filters for the same space overhead, or can achieve space overhead below 10% with some additional CPU time. An experimental Ribbon design with load balancing can even achieve space overheads below 1%. A Ribbon filter resembles an Xor filter modified to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Advanced Data Storage Technologies · Internet Traffic Analysis and Secure E-voting
