bloom
A collection of Bloom filter implementations in Go, including standard, partitioned, and scalable variants.
What is bloom?
bloom is a Go library implementing several types of Bloom filters—probabilistic data structures that efficiently test whether an element is a member of a set. It solves the problem of memory-efficient membership queries while allowing for a configurable false positive rate. The library includes standard, partitioned, and scalable variants to accommodate different use cases and performance requirements.
Go developers who need efficient set membership testing in applications where memory constraints are important and a small false positive rate is acceptable. This includes database systems, network routers, caching layers, and distributed systems.
Developers choose bloom because it provides multiple well-implemented Bloom filter variants in pure Go with clear APIs and documented performance characteristics. The availability of partitioned and scalable implementations offers flexibility beyond basic Bloom filters found in other libraries.
Overview
Bloom filters implemented in Go.
Use Cases
Best For
- Reducing memory usage in large-scale membership testing applications
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
