Determinant / growth-ringLinks
Simple and modular write-ahead-logging implementation.
☆25Updated last year
Alternatives and similar repositories for growth-ring
Users that are interested in growth-ring are comparing it to the libraries listed below
Sorting:
- Yet another key-value storage for Rust☆72Updated 3 years ago
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆59Updated 5 months ago
- FST (Fast Succinct Trie) implementation in Rust☆26Updated 6 years ago
- scan-resistant concurrent lazy LRU☆61Updated last year
- small distributed database protocol☆31Updated 4 years ago
- A Rust implementation of the Strobe protocol framework☆27Updated 4 months ago
- fast hex☆92Updated last week
- Rust implementation of the Modified Patricia Tree (aka Trie).☆73Updated last year
- An optimized Sparse Merkle Tree in Rust☆56Updated last week
- A low-level MVCC file format for storing blobs.☆64Updated last year
- Raft distributed consensus for WebAssembly in Rust☆68Updated 3 years ago
- _merkle_ is a lightweight Rust implementation of a Merkle tree, external dependencies agnostic, std::hash compatible with efficient memor…☆49Updated 2 months ago
- Rust bindings for MDBX☆91Updated 2 weeks ago
- An async ORM for Postgres☆19Updated 2 years ago
- Reed-Solomon GF(2^16) erasure coding with O(n log n) complexity☆46Updated last month
- A simple, low-level, and customizable implementation of a TCP P2P node.☆54Updated 2 weeks ago
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆40Updated 11 months ago
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆81Updated 10 months ago
- Sparse Merkle tree for a key-value map.☆22Updated 2 years ago
- A fast and flexible LRU map.☆190Updated 6 months ago
- ☆30Updated 5 months ago
- 256-bit unsigned integer implementation.☆59Updated last week
- An optimized sparse merkle tree.☆49Updated 4 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 5 months ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆36Updated 3 years ago
- A websocket protocol implementation.☆93Updated last month
- WRite Ahead Logging for distributed applications.☆30Updated 3 years ago
- Examples of asynchronous programming in Rust☆49Updated 4 years ago
- Byzantine-fault-tolerant time synchronization☆41Updated 4 years ago
- Scalable and lock-free memory reclamation system☆32Updated 2 weeks ago