bloom
Membership tester
A probabilistic data structure for testing membership in a set with high false positive rates.
Probabilistic set data structure
86 stars
4 watching
10 forks
Language: Go
last commit: over 7 years ago
Linked from 2 awesome lists
bloom-filterdata-structuresgo
Related projects:
Repository | Description | Stars |
---|---|---|
| A collection of high-performance set membership tests using hash tables and bit manipulation techniques. | 146 |
| An implementation of a probabilistic data structure used to test membership in a set | 17 |
| A high-performance probabilistic data structure for efficient membership testing | 88 |
| An implementation of Bloom filters in Ruby, allowing for efficient probabilistic membership testing with options for native counting and Redis-backed implementations. | 473 |
| Probabilistic data structures for quickly checking membership in a set. | 260 |
| Probabilistic data structures for processing continuous, unbounded streams | 1,596 |
| A Redis module implementing a probabilistic data structure for efficient membership testing and deletion of items without holding the entire set in memory. | 231 |
| An implementation of a flexible and space-efficient data structure for approximated set-membership queries with dynamic item addition and removal | 296 |
| Implementation of a data structure for efficient set membership queries with optional deletion and dynamic updates | 175 |
| A tool for writing functional tests against real databases in Go applications. | 1,125 |
| Automated testing tool to identify logic and performance issues in databases | 1,512 |
| Reports on test coverage issues to ensure higher code quality and prevent regressions over time | 99 |
| A high-performance bloom filter implementation | 138 |
| A flexible Bayesian text classifier with backend storage support | 158 |
| Collects near real-time metrics from Linux hosts using InfluxDB as the backend. | 28 |