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☆69Updated last month
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- TCP load testing tool, written in async Rust☆37Updated 3 years ago
- Asynchronously speed-limiting multiple byte streams☆59Updated 6 months ago
- scan-resistant concurrent lazy LRU☆58Updated last year
- An efficient runtime for asynchronous applications in Rust.☆43Updated 2 years ago
- A bit vector with the Rust standard library's portable SIMD API.☆39Updated last year
- rust database engineering toolkit☆33Updated 3 years ago
- Distributed key-value store.☆28Updated 3 years ago
- An eventually consistent LRU designed for lock-free concurrent reads☆22Updated 2 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated last year
- ☆13Updated last year
- A futures abstraction that runs a set of futures which may complete in any order.☆89Updated 2 weeks ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- ☆19Updated 2 years ago
- ☆36Updated 2 years ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆33Updated 2 years ago
- A Rust library for iterating over random permutations.☆14Updated 3 years ago
- Rust cloud object storage tools☆12Updated 3 years ago
- Another Async IO Framework based on io_uring☆63Updated 2 years ago
- high-efficiency concurrent reclamation☆35Updated 7 months ago
- Adaptive Radix Tree in Rust☆67Updated 6 years ago
- An implementation of TinyLFU cache☆15Updated 2 years ago
- hybrid logical clock for Rust☆21Updated 9 years ago
- An in-memory SQL database in Rust.☆14Updated 3 years ago
- A high-performance SPSC bounded circular buffer of bytes☆47Updated last week
- FST (Fast Succinct Trie) implementation in Rust☆26Updated 5 years ago
- A cache that holds a limited number of key-value pairs☆82Updated 2 years ago
- SQLite-based on-disk cache for Rust.☆23Updated 8 months ago
- bluss/IndexMap with amortized resizes☆14Updated 4 years ago