laysakura / fst-rs
FST (Fast Succinct Trie) implementation in Rust
☆24Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for fst-rs
- high-efficiency concurrent reclamation☆35Updated 2 months ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆31Updated 2 years ago
- Concurrent skip list☆22Updated 6 years ago
- A concurrent lock-free hash map for Rust.☆21Updated 3 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆68Updated last year
- ☆36Updated last year
- WRite Ahead Logging for distributed applications.☆30Updated 2 years ago
- small distributed database protocol☆30Updated 3 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated 9 months ago
- Distributed consensus protocol for replicated state machines☆61Updated 5 years ago
- scan-resistant concurrent lazy LRU☆58Updated last year
- Set theory applied on sorted and deduplicated slices.☆46Updated 2 years ago
- Async readiness traits☆11Updated 5 years ago
- An experimental columnar arena☆41Updated 3 weeks ago
- raw bindings for git://git.kernel.dk/liburing☆17Updated 4 years ago
- Parallel HashMap and HashSet for Rust☆57Updated 5 years ago
- Adaptive Radix Tree in Rust☆62Updated 6 years ago
- ☆10Updated last month
- Implementation of Adaptive Radix Tree in Rust☆42Updated 4 years ago
- trigger io::Error's in test, and annotate their source☆30Updated last year
- A growable bit-vector for Rust, optimized for size☆39Updated 8 months ago
- Simple and modular write-ahead-logging implementation.☆25Updated 9 months ago
- Lockfree resizeable concurrent hash table.☆53Updated 2 years ago
- Rust CASPaxos implementation☆64Updated 4 years ago
- parallel iterator consumers for rust☆12Updated 5 years ago
- A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.☆41Updated 5 years ago
- rust database engineering toolkit☆35Updated 3 years ago
- An experimental asynchronous runtime based on `io-uring`.☆76Updated 3 years ago