Daniel Lemire releases constmap, a Go library implementing binary fuse filters for fast and memory-efficient string-to-uint64 mappings. The data structure requires only one hash computation and three array accesses per lookup, making it ideal for immutable key sets. It builds on prior research published in ACM Journal of Experimental Algorithmics.
Background
Binary fuse filters are a recent advancement in probabilistic data structures, offering faster and more compact alternatives to Bloom filters for certain use cases. They are particularly useful for immutable datasets requiring high-performance lookups.
- Source
- Lobsters
- Published
- Mar 30, 2026 at 10:32 PM
- Score
- 6.0 / 10