hesela.devRibbon filter
A static approximate-membership filter built using banded Boolean linear systems, offering a space and construction-cost tradeoff relative to Bloom filters.
The constructed filter is not a mutable set or a data-integrity checksum. Standard, homogeneous and bumped Ribbon variants have different tradeoffs. RocksDB's bloom_equivalent_bits_per_key targets Bloom-equivalent filtering, not the actual Ribbon bit count; assess temporary construction memory separately from resident size. [1] [2]
Relations
- related
- bloom-filter, sstable, partitioned-filter