Alternatives and similar repositories for key-value-store:

Users that are interested in key-value-store are comparing it to the libraries listed below

• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆74Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• ppLorins / aurora
  A Raft based K-V database implemented with cpp.
  ☆37Updated 5 years ago
• s-hironobu / AlgorithmCollection
  An Educational parallel Algorithm collection
  ☆111Updated last month
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• purecpp-org / raftcpp
  A RAFT implementation to help build your RAFT service in 1 minute.
  ☆66Updated last year
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 years ago
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆133Updated last year
• L-v-M / async
  ☆20Updated 2 years ago
• JasonYuchen / notes
  reading...
  ☆32Updated 6 months ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 7 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 7 years ago
• Nov11 / 15-445
  CMU 15-445 2017 (force pushed to erase my works)
  ☆59Updated 4 years ago
• Gan-Tu / cppGFS2.0
  A distributed Google File System (GFS), partially implemented in C++.
  ☆80Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆36Updated 6 years ago
• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 7 years ago
• CMU-440-F16 / p2
  ☆9Updated 8 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 3 years ago
• sunbains / embedded-innodb
  Embedded InnoDB based on v5.1
  ☆30Updated 3 months ago
• msdeep14 / DeepDataBase
  A relational database engine using B+ tree indexing
  ☆43Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago