A distributed, sharded key value store, backed by paxos, written in C++
-
Updated
Apr 30, 2017 - C++
A distributed, sharded key value store, backed by paxos, written in C++
Labs for MIT 6.824 Distributed Systems. Implemented distributed fault-tolerant key-value service, Raft Consensus algorithm and MapReduce
Implementation of a Dynamo-style key-value storage
A HashMap is a data structure that allows for efficient insertion, retrieval, and deletion of elements based on their key. This project implements a HashMap in Kotlin with explanations of its functions, making it a helpful resource for those looking to understand the inner workings of HashMaps.
Fashion Store using Edge Workers
A demonstration of the speed of YottaDB against RocksDB
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.
ArangoDB store for Keyv: simple key-value storage with support for multiple backends.
Extremely simple Key/Value store for Go (golang) with MySQL backend.
Dart implementation of key-value storage client for Hashicorp Consul
Data modelling with DynamoDB (Target stores)
🏗 A simple key/value store (get/set) and queue (send/receive/delete).
Simple Key Value Store
Pandora Key-Value Store is a Local IPC Server for Key-Value Element Containers with Disk persistance and Memory caching implemented in C++ for GNU/Linux.
a wrapper around BadgerDB providing a simple API.
In-memory key/value and event store, for educational purposes
Add a description, image, and links to the keyvaluestore topic page so that developers can more easily learn about it.
To associate your repository with the keyvaluestore topic, visit your repo's landing page and select "manage topics."