knizhnik / yakvLinks
Yet another key-value storage for Rust
☆72Updated 3 years ago
Alternatives and similar repositories for yakv
Users that are interested in yakv are comparing it to the libraries listed below
Sorting:
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆80Updated 10 months ago
- scan-resistant concurrent lazy LRU☆61Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 4 months ago
- Simple and modular write-ahead-logging implementation.☆25Updated last year
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆59Updated 4 months ago
- A low-level MVCC file format for storing blobs.☆63Updated last year
- Rust interface for Linux futexes, the fast user-space locking primitive.☆87Updated last year
- log for concurrent workloads, with support for atomic batches and in-order recovery☆36Updated 3 years ago
- small distributed database protocol☆31Updated 4 years ago
- fast hex☆92Updated 4 months ago
- A reader-writer lock that provides extremely fast read access without starving writers☆81Updated last year
- A benchmarking harness for concurrent key-value collections☆119Updated 2 years ago
- A lock-free, append-only atomic pool.☆67Updated 3 years ago
- Library and proc macro to analyze memory usage of data structures in rust.☆156Updated last week
- A fast and flexible LRU map.☆189Updated 6 months ago
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆39Updated 10 months ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- Framework for simulating distributed applications☆102Updated 5 years ago
- ☆49Updated 6 months ago
- Sparse Merkle tree for a key-value map.☆22Updated 2 years ago
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆57Updated last year
- A simple concurrent caching library that might fit to many use cases☆131Updated 5 months ago
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆64Updated this week
- A Rust implementation of two segment trees and a fenwick tree.☆66Updated 6 years ago
- Scalable and lock-free memory reclamation system☆30Updated last month
- This is a project to learn how to implement instruction dispatch in Rust.☆23Updated last year
- Non-interleaving multithreaded output queue☆71Updated last month
- A `VecDeque` (and `Vec`) variant that spreads resize load across pushes.☆107Updated 6 months ago
- Rust bindings for MDBX☆91Updated this week
- A websocket protocol implementation.☆93Updated last week