Alternatives and similar repositories for key-value-store

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

• Gan-Tu / cppGFS2.0
  A distributed Google File System (GFS), partially implemented in C++.
  ☆81Updated 3 years ago
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆141Updated last year
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆124Updated last year
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 8 years ago
• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 7 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆64Updated 3 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• purecpp-org / raftcpp
  A RAFT implementation to help build your RAFT service in 1 minute.
  ☆67Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 8 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆173Updated 8 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 7 years ago
• ustcadsl / unikv
  ☆24Updated 3 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆233Updated last week
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆27Updated 10 years ago
• sunbains / embedded-innodb
  Embedded InnoDB based on v5.1
  ☆32Updated 2 months ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• zz-jason / leanstore
  LeanStore is a larger-than-memory database, optimized for NVMe SSD and multi-core CPU, achieves performance close to in-memory systems wi…
  ☆39Updated 3 weeks ago
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 7 months ago
• junjieliu2910 / cmu-15-445
  The project folder of the 15-445 Introduction to Database system
  ☆45Updated 6 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• ppLorins / aurora
  A Raft based K-V database implemented with cpp.
  ☆38Updated 5 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
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• luyi0619 / star
  GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication
  ☆22Updated 5 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆101Updated 2 years ago