u2 / stable-bloom-filter
A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.
☆42Updated 5 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
- super simple in-memory blocking LSM for constant-size keys and values☆68Updated last month
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- An eventually consistent LRU designed for lock-free concurrent reads☆22Updated last year
- TCP load testing tool, written in async Rust☆37Updated 3 years ago
- Asynchronously speed-limiting multiple byte streams☆57Updated 4 months ago
- rust database engineering toolkit☆33Updated 3 years ago
- A bit vector with the Rust standard library's portable SIMD API.☆38Updated last year
- Distributed key-value store.☆28Updated 3 years ago
- scan-resistant concurrent lazy LRU☆58Updated last year
- An implementation of TinyLFU cache☆15Updated 2 years ago
- FST (Fast Succinct Trie) implementation in Rust☆25Updated 5 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 3 years ago
- An efficient runtime for asynchronous applications in Rust.☆43Updated 2 years ago
- SQLite-based on-disk cache for Rust.☆23Updated 6 months ago
- Concurrent hash trie☆51Updated 4 years ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆33Updated 2 years ago
- A HyperLogLog implementation in Rust.☆50Updated 2 weeks ago
- ☆13Updated last year
- A queue designed for buffer swapping instead of task popping☆23Updated 2 years ago
- high-efficiency concurrent reclamation☆35Updated 5 months ago
- A lock-free async waitgroup implementation☆37Updated 3 years ago
- A leaky-bucket-as-a-meter rate-limiting implementation in Rust☆32Updated 4 years ago
- Safe, Growable Bloom Filters in Rust (with serde)☆27Updated 4 months ago
- ☆37Updated 4 years ago
- liburing bindings☆34Updated 2 years ago
- Object Pool LockFree in Rust☆45Updated 3 weeks ago
- A futures abstraction that runs a set of futures which may complete in any order.☆89Updated 6 months ago
- Adaptive Radix Tree in Rust☆64Updated 6 years ago
- An LRU cache implementation with constant time operations and weighted semantic.☆41Updated last month
- Prioritised, parallel job scheduler with concurrent exclusion, job merging, recurring jobs and load limiting for lower priorities.☆47Updated 3 years ago