Showing 9 of 9 projects
A Go package implementing Bloom filters, a space-efficient probabilistic data structure for set membership queries.
A space-efficient probabilistic data structure for set membership queries that supports dynamic additions and deletions.
A Go implementation of Cuckoo Filter, a space-optimized probabilistic data structure supporting dynamic additions and deletions.
A high-performance Java implementation of a Cuckoo filter, supporting deletions, counting, and concurrent operations.
A high-performance, thread-safe Bloom filter implementation in Go.
A pure Elixir implementation of Scalable Bloom Filters for probabilistic set membership testing.
A fast and space-efficient probabilistic set data structure for Go that tests membership with 'likely member' or 'definitely not member' results.
A pure Elixir implementation of Cuckoo Filters, a probabilistic data structure for set membership testing.
A high-performance Go implementation of the Ribbon filter, a space-efficient probabilistic data structure that is practically smaller than Bloom and Xor filters.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.