Binary Fuse Filters: Fast and Smaller Than Xor Filters · HackerPapers discussions

Binary Fuse Filters: Fast and Smaller Than Xor Filters — HN submission

Sat, 17 Jan 2026 14:02:17 GMT

Binary fuse filters: Fast and smaller than xor filters (2022)

138 points; 26 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Binary Fuse Filters: Fast and Smaller Than Xor Filters — mentioned by f_devd

Fri, 02 May 2025 08:21:41 GMT

> check the literature for various alternatives that are better in specific situations For direct replacements, see Xor(+)-Filters: https://arxiv.org/abs/1912.08258 and the subsequent evolution into Binary Fuse Filters: https://arxiv.org/abs/2201.01174

Paper and discussion history. A mention is not an endorsement.

Binary Fuse Filters: Fast and Smaller Than Xor Filters — mentioned by thomasmg

Wed, 11 Sep 2024 08:37:30 GMT

No, it's not the L1. It's the L2/L3/LLC. With a regular Bloom filter (not blocked one), each of the k memory accesses results in a L2/L3/LLC cache miss, if the Bloom filter doesn't fit in the cache. And here, it doesn't. With a blocked Bloom filter, there is still a cache miss, but only one, and not k. So that's 8 times fewer cache misses. But yes, buffering the entries and then sorting them does make sense. That way, each cache line is only accessed once, and prefetch works well. We have used radix sorting for the binary fuse filter https://arxiv.org/abs/2201.01174 . For the blocked Bloom…

Paper and discussion history. A mention is not an endorsement.

Binary Fuse Filters: Fast and Smaller Than Xor Filters — HN submission

Sun, 16 Jun 2024 17:42:02 GMT

Binary Fuse Filters: fast and smaller than XOR filters

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Binary Fuse Filters: Fast and Smaller Than Xor Filters — mentioned by Genbox

Mon, 24 Oct 2022 20:23:16 GMT

Similarly, there is Binary Fuse Filters (https://arxiv.org/abs/2201.01174) [1] The paper includes comparisons with Ribbon filter [1] Graf, T. M., & Lemire, D. (2022). Binary Fuse Filters: Fast and Smaller Than Xor Filters. arXiv. https://doi.org/10.1145/3510449

Paper and discussion history. A mention is not an endorsement.

Binary Fuse Filters: Fast and Smaller Than Xor Filters — HN submission

Sat, 08 Jan 2022 21:54:09 GMT

Binary Fuse Filters: Fast and Smaller Than Xor Filters

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.