laysakura / fst-rs
FST (Fast Succinct Trie) implementation in Rust
☆25Updated 5 years ago
Alternatives and similar repositories for fst-rs:
Users that are interested in fst-rs are comparing it to the libraries listed below
- log for concurrent workloads, with support for atomic batches and in-order recovery☆33Updated 2 years ago
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- high-efficiency concurrent reclamation☆35Updated 6 months ago
- scan-resistant concurrent lazy LRU☆58Updated last year
- Distributed consensus protocol for replicated state machines☆61Updated 6 years ago
- An experimental columnar arena☆42Updated 4 months ago
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆55Updated last week
- super simple in-memory blocking LSM for constant-size keys and values☆68Updated last week
- Implementation of Adaptive Radix Tree in Rust☆42Updated 5 years ago
- A fast thread safe memory pool for reusing allocations.☆29Updated 8 years ago
- An implementation of TinyLFU cache☆15Updated 2 years ago
- Set theory applied on sorted and deduplicated slices.☆45Updated 2 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated last year
- Rust CASPaxos implementation☆66Updated 4 years ago
- A HyperLogLog implementation in Rust.☆50Updated last month
- Toy benchmark comparing RocksDB and Sled☆12Updated last year
- ☆18Updated 2 years ago
- Adaptive Radix Tree in Rust☆66Updated 6 years ago
- partial_sort is Rust version of [std::partial_sort](https://en.cppreference.com/w/cpp/algorithm/partial_sort)☆19Updated 2 months ago
- ☆36Updated 2 years ago
- rust database engineering toolkit☆33Updated 3 years ago
- A FoundationDB style deterministic testing framework for async/await Rust☆32Updated 4 years ago
- Simple and modular write-ahead-logging implementation.☆25Updated last year
- raw bindings for git://git.kernel.dk/liburing☆16Updated 5 years ago
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆36Updated 6 months ago
- Concurrent skip list☆24Updated 6 years ago
- A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.☆42Updated 5 years ago
- This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…☆24Updated 4 years ago
- hybrid logical clock for Rust☆21Updated 9 years ago
- LevelDB: Rust implementation☆80Updated 5 years ago