ltungv / bitcask
A tiny key-value store backed by Bitcask and Redis Serialization Protocol
☆26Updated 9 months ago
Related projects ⓘ
Alternatives and complementary repositories for bitcask
- Viewstamped Replication for Rust☆64Updated last year
- log for concurrent workloads, with support for atomic batches and in-order recovery☆30Updated 2 years ago
- scan-resistant concurrent lazy LRU☆57Updated last year
- An implementation of Raft in Rust.☆39Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆66Updated last year
- An Adaptive Radix Tree implementation.☆36Updated last year
- A lock-free thread-safe arena based Skiplist impelementation for building memtable.☆51Updated this week
- A distributed transactional key-value storage engine in Rust, with horizontal scalability, strong consistency, and high availability.☆26Updated last year
- A basic log-structured flash datastore☆20Updated 2 years ago
- A Write Ahead Log (WAL) implementation in Rust☆216Updated 11 months ago
- rust database engineering toolkit☆34Updated 3 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated 9 months ago
- Optimistic multi-version concurrency control (MVCC) for main memory databases, written in Rust.☆113Updated last year
- Bitcask Implementation in Rust. A fast key-value store.☆23Updated 4 years ago
- Modular, Asynchronous Implementation of a Log-Structured Merge Tree☆32Updated 2 weeks ago
- Framework for simulating distributed applications☆96Updated 4 years ago
- Chain replication server framework for Rust☆33Updated 8 months ago
- An implementation of TinyLFU cache☆15Updated 2 years ago
- high-efficiency concurrent reclamation☆34Updated 2 months ago
- Log search engine on object storages☆16Updated 3 months ago
- A timed adaptive radix trie data-structure, used in SurrealKV☆88Updated this week
- Raft implementation in Rust☆47Updated 3 years ago
- Pure Rust Distributed Hash Table☆37Updated 8 years ago
- LSM-Tree Key-Value Store based on RocksDB☆79Updated last year
- A generic-purpose, atomic, ordered, zero-copy read, zero-cost (in-place) write, Write-Ahead Log implementation for Rust.☆15Updated this week
- A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.☆41Updated 5 years ago
- Rust Kafka protocol☆59Updated 3 weeks ago
- K.I.S.S. LSM-tree implementation in safe Rust☆99Updated this week
- OmniPaxos is a distributed log implemented as a Rust library.☆190Updated this week
- This is a small demo of how to transform a simple single-server RocksDB service written in Rust into a distributed version using OmniPaxo…☆15Updated last year