u2 / stable-bloom-filterLinks
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
Sorting:
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 6 months ago
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Simple probabilistic data structures☆147Updated last week
- Asynchronously speed-limiting multiple byte streams☆65Updated 10 months ago
- An eventually consistent LRU designed for lock-free concurrent reads☆22Updated 2 years ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- scan-resistant concurrent lazy LRU☆61Updated 2 years ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆115Updated 5 months ago
- ☆39Updated 5 years ago
- Concurrent hash trie☆57Updated 4 years ago
- Framework for simulating distributed applications☆104Updated 5 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 3 weeks ago
- An efficient runtime for asynchronous applications in Rust.☆43Updated 2 years ago
- A distributed file system written in Rust.☆28Updated 4 years ago
- Rust implementation of Paxos consensus algorithm☆115Updated 2 years ago
- Rust FFI wrapper for CRoaring☆158Updated 3 weeks ago
- rust database engineering toolkit☆33Updated 4 years ago
- simple CASPaxos implementation written in rust on top of a simulator for finding bugs quickly☆141Updated 5 years ago
- Prioritised, parallel job scheduler with concurrent exclusion, job merging, recurring jobs and load limiting for lower priorities.☆46Updated 3 years ago
- Another Async IO Framework based on io_uring☆63Updated 3 years ago
- Rust library implementing xor-filters☆140Updated 2 years ago
- An LRU cache implementation with constant time operations and weighted semantic.☆47Updated 7 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 2 weeks ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆54Updated 2 years ago
- Storage library (Work In Progress)☆20Updated 2 years ago
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- Yaque is yet another disk-backed persistent queue for Rust.☆87Updated last year
- Task-based Parallelism in Rust☆17Updated 3 years ago