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 4 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 7 years ago
• JimChengLin / levi-db
  levi-db is a fast database engine
  ☆36Updated 7 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆126Updated 6 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆200Updated last year
• epfl-labos / TRIAD
  ☆44Updated 3 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 years ago
• joker-qi / ndslDB
  基于LevelDB的改进
  ☆29Updated 5 years ago
• weicao / cascadb
  Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB
  ☆426Updated 11 years ago
• lichuang / libraft
  C++ raft lib
  ☆136Updated 2 years ago
• BLepers / KVell
  KVell: the Design and Implementation of a Fast Persistent Key-Value Store
  ☆284Updated 4 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
• pmem / pmemkv
  Key/Value Datastore for Persistent Memory
  ☆400Updated 2 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
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 8 years ago
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 8 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆126Updated last year
• UncP / aili
  the fastest in-memory index in the East 东半球最快并发索引
  ☆475Updated 4 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
• PikaLabs / floyd
  A raft consensus implementation that is simply and understandable
  ☆321Updated 6 years ago
• Pfzuo / Level-Hashing
  Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)
  ☆202Updated 4 years ago
• pmem / pmem-redis
  A version of Redis that uses persistent memory
  ☆114Updated 8 months ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆70Updated 11 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 8 months ago
• Qihoo360 / blackwidow
  A library implements REDIS commands(Strings, Hashes, Lists, Sorted Sets, Sets, Keys, HyperLogLog) based on rocksdb, as the storage layer …
  ☆99Updated last year
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 6 years ago