Source
- URL: https://x.com/lemire/status/1869752213402157131
- Author: Daniel Lemire (@lemire)
- Posted: 2024-12-19 14:30:40
Thread
1/ @lemire
Binary fuse filters are a faster alternatives to Bloom filters: they allow you to check (probabilistically) that an element is part of a set.
Oliver Schönrock has been running benchmarks on his C++ implementation of binary fuse filters… and he is getting 100x performance gains on his application.
(Link as a comment.)
2/ @lemire