bloom
Set data structure
A data structure used to efficiently store and query sets of unique items with minimal memory usage.
Go package implementing Bloom filters, used by Milvus and Beego.
2k stars
41 watching
234 forks
Language: Go
last commit: almost 2 years agoLinked from 2 awesome lists
bloombloom-filtersgo
avelino/awesome-go
xwjdsh/awesome-go-extraRelated projects:
| Repository | Description | Stars |
|---|---|---|
 tannerryan/ring | A high-performance bloom filter implementation | 138 |
 yourbasic/bloom | A probabilistic data structure for testing membership in a set with high false positive rates. | 86 |
 tylertreat/boomfilters | Probabilistic data structures for processing continuous, unbounded streams | 1,596 |
 zentures/bloom | A collection of high-performance set membership tests using hash tables and bit manipulation techniques. | 146 |
 melleb/sqlite-bloomfilter | An extension for SQLite that allows creating and testing bloom filters using the Murmur3 hashing function. | 17 |
 dvyukov/go-fuzz | A tool for generating and testing random inputs to ensure software reliability | 4,790 |
 igrigorik/bloomfilter-rb | An implementation of Bloom filters in Ruby, allowing for efficient probabilistic membership testing with options for native counting and Redis-backed implementations. | 473 |
 lemire/bloofi | An implementation of multidimensional Bloom filters to efficiently search and identify sets containing elements in large datasets | 78 |
 oldpanda/bloomfilter | An implementation of a probabilistic data structure used to test membership in a set | 17 |
 yankun1992/fastbloom | A high-performance probabilistic data structure for efficient membership testing | 88 |
 linvon/cuckoo-filter | An implementation of a flexible and space-efficient data structure for approximated set-membership queries with dynamic item addition and removal | 296 |
 boydgreenfield/nimrod-bloom | A Bloom filter implementation in Nimrod. | 15 |
 workiva/go-datastructures | A collection of reusable data structures for efficient and thread-safe storage and retrieval in Go. | 7,708 |
 roaringbitmap/roaring | A data structure library that efficiently stores and manipulates dense sets of unique integers using compact binary representations. | 2,562 |
 armon/bloomd | A high-performance C network daemon for exposing and managing bloom filters to networked clients. | 1,238 |