ltungv / bitcaskLinks
A tiny key-value store backed by Bitcask and Redis Serialization Protocol
☆30Updated last year
Alternatives and similar repositories for bitcask
Users that are interested in bitcask are comparing it to the libraries listed below
Sorting:
- Viewstamped Replication for Rust☆69Updated 2 years ago
- OmniPaxos is a distributed log implemented as a Rust library.☆205Updated 5 months ago
- A Write Ahead Log (WAL) implementation in Rust☆228Updated last year
- Optimistic multi-version concurrency control (MVCC) for main memory databases, written in Rust.☆134Updated 2 years ago
- mirror of https://caio.co/de/foca/☆178Updated 2 months ago
- scan-resistant concurrent lazy LRU☆61Updated last year
- A timed adaptive radix trie data-structure, used in SurrealKV☆108Updated 4 months ago
- K.I.S.S. LSM-tree implementation in safe Rust☆249Updated this week
- log for concurrent workloads, with support for atomic batches and in-order recovery☆36Updated 3 years ago
- An Adaptive Radix Tree implementation.☆42Updated this week
- A Multi-Raft implementation in Rust language.☆192Updated 8 months ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- rust database engineering toolkit☆33Updated 3 years ago
- Embedded Key-Value Storage Engine☆122Updated 2 months ago
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 5 months ago
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆157Updated last week
- Cluster membership protocol with failure detection inspired by Cassandra and DynamoDB☆315Updated 2 weeks ago
- Rust implementation of the FastLanes compression library☆112Updated 2 weeks ago
- FoundationDB Rust client api☆164Updated this week
- A distributed transactional key-value storage engine in Rust, with horizontal scalability, strong consistency, and high availability.☆27Updated 2 years ago
- Modular, Asynchronous Implementation of a Log-Structured Merge Tree☆41Updated last month
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆59Updated 5 months ago
- Bindings for writing a server that can act as MySQL/MariaDB☆170Updated last week
- Proactive IO & Runtime system☆275Updated last year
- Fast and correct async IO runtime in a small amount of readable code. Inspired by tokio☆72Updated last year
- Rust implementation of Paxos consensus algorithm☆115Updated 2 years ago
- lock-free B+ tree☆294Updated 10 months ago
- LSM-Tree Key-Value Store based on RocksDB☆80Updated 2 years ago
- A light weight, typed, in-memory, ordered, key-value database.☆52Updated last year
- garbage-collecting on-disk object store, supporting higher level KV stores and databases.☆401Updated 5 months ago