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

A naive and simple distributed KV storage system

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

ArangoDB store for Keyv: simple key-value storage with support for multiple backends.

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.

Extremely simple Key/Value store for Go (golang) with MySQL backend.

Super simple key value with type safety and implement your own load and save function.

a promise style keyValue store based on indexedDB

A JavaScript client library for interfacing with the Kevacoin key-value blockchain

A utility class to manipulate a simple List of Map to do basic CRUD.

LevelDB Storage adapter for Keyv

Easy, simple key-value store. Wraps standard .Net filesystem storage with an API similar to NoSQL document databases. Single C# file, no extra dependencies.

Easy to use API for JSON key/value storage

Implemented a distributed key value cache from scratch using Raft consensus algorithm. Communication is done using TCP protocol.

Etcd Storage adapter for Keyv