laysakura / fst-rs
FST (Fast Succinct Trie) implementation in Rust
☆26Updated 6 years ago
Alternatives and similar repositories for fst-rs
Users that are interested in fst-rs are comparing it to the libraries listed below
Sorting:
- high-efficiency concurrent reclamation☆35Updated 8 months ago
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- scan-resistant concurrent lazy LRU☆58Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆69Updated 2 months ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆33Updated 3 years ago
- hybrid logical clock for Rust☆21Updated 9 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated last year
- Simple and modular write-ahead-logging implementation.☆25Updated last year
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆78Updated 8 months ago
- ☆36Updated 2 years ago
- Implementation of Adaptive Radix Tree in Rust☆43Updated 5 years ago
- ☆10Updated 7 months ago
- Distributed consensus protocol for replicated state machines☆61Updated 6 years ago
- An experimental columnar arena☆43Updated 6 months ago
- small distributed database protocol☆31Updated 4 years ago
- Yet another key-value storage for Rust☆71Updated 3 years ago
- A fast thread safe memory pool for reusing allocations.☆29Updated 9 years ago
- ☆33Updated 2 years ago
- WRite Ahead Logging for distributed applications.☆30Updated 2 years ago
- ☆19Updated 2 years ago
- A FoundationDB style deterministic testing framework for async/await Rust☆32Updated 4 years ago
- An I/O-oriented tokio runtime thread pool☆49Updated 5 years ago
- rust database engineering toolkit☆33Updated 3 years ago
- Set theory applied on sorted and deduplicated slices.☆45Updated 2 years ago
- Log-structured merge-tree implementation in Rust☆18Updated 6 years ago
- Async readiness traits☆11Updated 6 years ago
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆58Updated 2 months ago
- Asynchronous adapter for byteorder☆19Updated 4 years ago
- Library implementing the prefix tree in Rust☆35Updated 6 years ago
- liburing bindings☆34Updated 2 years ago