Alternatives and similar repositories for lsmtree

Users that are interested in lsmtree are comparing it to the libraries listed below

• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 6 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆114Updated 3 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 7 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆201Updated 2 years ago
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆126Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• JimChengLin / levi-db
  levi-db is a fast database engine
  ☆36Updated 7 years ago
• weicao / cascadb
  Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB
  ☆426Updated 12 years ago
• memKeyDB / memKeyDB
  MemKeyDB is a fork of Redis, adjusted to store objects on both Intel Optane Persistent Memory and DRAM.
  ☆77Updated last year
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 9 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• pmem / pmem-redis
  A version of Redis that uses persistent memory
  ☆114Updated 10 months ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆103Updated 2 years ago
• lichuang / libraft
  C++ raft lib
  ☆136Updated 3 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• joker-qi / ndslDB
  基于LevelDB的改进
  ☆29Updated 6 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆70Updated 11 years ago
• CatKang / Solitaire
  Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model
  ☆17Updated 7 years ago
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 6 years ago
• pmem / kvdk
  Key Value Development Kit
  ☆203Updated 10 months ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• BLepers / KVell
  KVell: the Design and Implementation of a Fast Persistent Key-Value Store
  ☆286Updated 4 years ago
• pmem / pmemkv
  Key/Value Datastore for Persistent Memory
  ☆403Updated 2 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated last month
• zhengqmark / indexfs-0.4
  New IndexFS core
  ☆26Updated 9 years ago
• PikaLabs / floyd
  A raft consensus implementation that is simply and understandable
  ☆321Updated 6 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆92Updated 2 years ago