TechPrufer
Get started
Meta
Meta logoMeta · Feature trail

Ribbon Filter Data Structure

1 post · Jul 2021

What this trail covers

The Ribbon filter is a new space-efficient data structure that serves as a practical alternative to Bloom filters. It offers near-continuous configurability in accuracy versus space trade-offs, with space overhead as low as 1% and O(1) query times, saving approximately 1/3 of memory compared to Bloom filters. Its construction algorithm is faster and more flexible, utilizing Gaussian elimination on a sorted coefficient matrix resembling a ribbon.

All Meta trails
  1. Ribbon filter: Practically smaller than Bloom and XorIntroduced the Ribbon filter, a novel data structure that improves upon Bloom filters in terms of space efficiency. The Ribbon filter achieves this through a simplified, faster, and more flexible construction algorithm based on Gaussian elimination applied to a ribbon-like coefficient matrix. It offers near-continuous configurability in the space-time trade-off and achieves space overhead as low as 1% while maintaining O(1) query times, saving approximately 1/3 of memory compared to Bloom filters.