A simplistic key-value store with multi-version concurrency control
-
Updated
May 23, 2023 - Java
A simplistic key-value store with multi-version concurrency control
The in-memory KVS uses the Trie-tree as the main in-memory data structure for achieving high insert and lookup performance. For concurrency, this KVS uses Spin-lock mechanism to avoid race conditions and guarantee mutual exclusion.
Keynetic is a sharded, fault-tolerant key-value store that follows causal consistency
Distributed key value store with AP of CAP theorem.
Key value store for high write throughput and read after write latency
A simple, easy to use key-value database wrapper for Deno
A distributed key value store using multi paxos to achieve consensus
diskv (from go) clone in rust
Add a description, image, and links to the kvstore topic page so that developers can more easily learn about it.
To associate your repository with the kvstore topic, visit your repo's landing page and select "manage topics."