BoomFilters
Data stream processors
Probabilistic data structures for processing continuous, unbounded streams
Probabilistic data structures for processing continuous, unbounded streams.
2k stars
42 watching
112 forks
Language: Go
last commit: over 5 years agoLinked from 2 awesome lists
bloom-filtercount-min-sketchcounting-bloom-filterscuckoo-filterdata-streamfiltergoprobabilistic-programmingscalable-bloom-filtersstable-bloom-filters
avelino/awesome-go
xwjdsh/awesome-go-extraRelated projects:
| Repository | Description | Stars |
|---|---|---|
 keilerkonzept/topk | An implementation of probabilistic data structures for approximate data stream processing | 4 |
 kristoff-it/redis-cuckoofilter | A Redis module implementing a probabilistic data structure for efficient membership testing and deletion of items without holding the entire set in memory. | 231 |
 hexops/fastfilter | Probabilistic data structures for quickly checking membership in a set. | 260 |
 yankun1992/fastbloom | A high-performance probabilistic data structure for efficient membership testing | 88 |
 yourbasic/bloom | A probabilistic data structure for testing membership in a set with high false positive rates. | 86 |
 mpope9/exor_filter | An Erlang Nif implementation of a probabilistic data structure used for fast set lookups and filtering | 31 |
 wallaroolabs/wally | A distributed stream processing framework for real-time data reactions | 1,477 |
 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 |
 verse-lab/ceramist | A verified hash-based approximate membership structure library in Coq | 121 |
 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 |
 quixio/quix-streams | A Python framework for real-time data processing on Apache Kafka streams | 1,246 |
 sindresorhus/p-filter | Tool for filtering and concurrent execution of promises with an adjustable concurrency level | 75 |
 random-robbie/slurp | Automates enumeration of S3 buckets based on domain and keyword inputs | 13 |
 reugn/go-streams | Provides a lightweight and flexible way to process data streams in Go | 1,935 |
 tannerryan/ring | A high-performance bloom filter implementation | 138 |