scaling, counting, bloom filter library
☆968Oct 26, 2019Updated 6 years ago
Alternatives and similar repositories for dablooms
Users that are interested in dablooms are comparing it to the libraries listed below
Sorting:
- C network daemon for bloom filters☆1,251Feb 14, 2023Updated 3 years ago
- Fast Python Bloom Filter using Mmap☆745Nov 4, 2019Updated 6 years ago
- Scalable Bloom Filter implemented in Python☆1,623Jul 1, 2021Updated 4 years ago
- a family of libraries and daemons for building scalable web infrastructure☆534Aug 23, 2013Updated 12 years ago
- Probabilistic data structures for processing continuous, unbounded streams.☆1,647Nov 17, 2025Updated 4 months ago
- C network daemon for HyperLogLogs☆453Feb 11, 2021Updated 5 years ago
- ☆1,007Nov 12, 2021Updated 4 years ago
- Log-structured merge-tree implementation in Rust☆19Nov 6, 2018Updated 7 years ago
- A probabilistic data structure service and storage☆772May 10, 2016Updated 9 years ago
- ☆15Feb 19, 2017Updated 9 years ago
- The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.☆18Feb 26, 2022Updated 4 years ago
- C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html☆146Nov 21, 2020Updated 5 years ago
- Implementations of a data structure with false negatives but no false positives.☆364Dec 19, 2023Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80May 20, 2014Updated 11 years ago
- A generic lock-free implementation of the "Token-Bucket" algorithm☆147Oct 25, 2018Updated 7 years ago
- An implementation of the HyperLogLog algorithm backed by Redis☆170Sep 10, 2015Updated 10 years ago
- Library of different Bloom filters in Java with optional Redis-backing, counting and many hashing options.☆862Dec 9, 2025Updated 3 months ago
- simple consistent hashing implementation☆56May 17, 2018Updated 7 years ago
- A high-performance, concurrent hash table☆1,734Mar 31, 2025Updated 11 months ago
- Ruby/JRuby bloom filters for bounded and unbounded (streaming) data, FNV hashing and bit fields☆105Dec 14, 2022Updated 3 years ago
- ☆28Dec 3, 2016Updated 9 years ago
- Modern transactional key-value/row storage library.☆1,883Mar 3, 2026Updated 2 weeks ago
- This is an implementation of a log structure merge tree.☆59Jul 26, 2017Updated 8 years ago
- Boolean, counting and layered bloom filters for Go☆23May 28, 2012Updated 13 years ago
- Library for simulating time progression in Python☆16Aug 16, 2025Updated 7 months ago
- Cuckoo Filter: Practically Better Than Bloom☆1,221Jul 15, 2024Updated last year
- Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel☆121Feb 22, 2023Updated 3 years ago
- A redis protocol compatible nosql, it support multiple storage engines as backend like Google's LevelDB, Facebook's RocksDB, OpenLDAP's …☆1,847Nov 12, 2021Updated 4 years ago
- A compressed bitmap class in C++.☆460Oct 30, 2024Updated last year
- ☆21Nov 24, 2016Updated 9 years ago
- Cross language bloom filter implementation☆301Jul 21, 2022Updated 3 years ago
- HyperLogLog and HyperLogLog++ implementation in Go/Golang.☆461Oct 16, 2019Updated 6 years ago
- NoSQL data store using the SEASTAR framework, compatible with Redis☆1,331Oct 2, 2019Updated 6 years ago
- Go package implementing Bloom filters, used by Milvus and Beego.☆2,762Oct 26, 2025Updated 4 months ago
- An event-driven framework☆105Aug 6, 2014Updated 11 years ago
- A generic latency benchmarking library.☆311Sep 11, 2017Updated 8 years ago
- Go implementation of Count-Min-Log☆69Mar 4, 2025Updated last year
- An expiring key/value cache with a Redis interface☆13Sep 10, 2015Updated 10 years ago
- An ultimately minimal persistent key-value store + LRU cache☆13Oct 19, 2015Updated 10 years ago