u2 / stable-bloom-filterLinks
A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.
☆42Updated 6 years ago
Alternatives and similar repositories for stable-bloom-filter
Users that are interested in stable-bloom-filter are comparing it to the libraries listed below
Sorting:
- super simple in-memory blocking LSM for constant-size keys and values☆73Updated 10 months ago
- Lockfree resizeable concurrent hash table.☆56Updated 4 years ago
- Asynchronously speed-limiting multiple byte streams☆67Updated last year
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Simple probabilistic data structures☆147Updated this week
- TCP load testing tool, written in async Rust☆36Updated 4 years ago
- ☆39Updated 5 years ago
- A distributed file system written in Rust.☆29Updated 4 years ago
- An eventually consistent LRU designed for lock-free concurrent reads☆22Updated 2 years ago
- Concurrent hash trie☆58Updated 5 years ago
- An efficient runtime for asynchronous applications in Rust.☆43Updated 3 years ago
- Rust implementation of Paxos consensus algorithm☆115Updated 3 years ago
- Another Async IO Framework based on io_uring☆63Updated 3 years ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆117Updated 10 months ago
- simple CASPaxos implementation written in rust on top of a simulator for finding bugs quickly☆142Updated 5 years ago
- scan-resistant concurrent lazy LRU☆63Updated 2 years ago
- Distributed key-value store.☆28Updated 4 years ago
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- A futures abstraction that runs a set of futures which may complete in any order.☆92Updated 3 months ago
- Prioritised, parallel job scheduler with concurrent exclusion, job merging, recurring jobs and load limiting for lower priorities.☆46Updated 4 years ago
- Rust library implementing xor-filters☆142Updated 2 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆54Updated 2 years ago
- Memory database☆58Updated last year
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- A lock-free async waitgroup implementation☆37Updated 3 years ago
- Framework for simulating distributed applications☆105Updated 5 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 5 months ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆73Updated last month
- comvert bool expression to elasticsearch DSL in rust☆52Updated 2 years ago
- Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.☆89Updated last year