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]
  ☆100Updated 7 years ago
• JimChengLin / levi-db
  levi-db is a fast database engine
  ☆36Updated 7 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• weicao / cascadb
  Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB
  ☆426Updated 12 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
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆211Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• lichuang / libraft
  C++ raft lib
  ☆138Updated 3 years ago
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆126Updated 7 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
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 9 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago
• pmem / pmem-redis
  A version of Redis that uses persistent memory
  ☆113Updated last year
• joker-qi / ndslDB
  基于LevelDB的改进
  ☆29Updated 6 years ago
• Pfzuo / Level-Hashing
  Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)
  ☆203Updated 5 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated 4 months ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆71Updated 11 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 4 years ago
• UncP / aili
  the fastest in-memory index in the East 东半球最快并发索引
  ☆478Updated 4 years ago
• pmem / kvdk
  Key Value Development Kit
  ☆203Updated last year
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆94Updated 2 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• BLepers / KVell
  KVell: the Design and Implementation of a Fast Persistent Key-Value Store
  ☆292Updated 2 weeks ago
• KernelMaker / rocksutil
  A c++ develop toolkit
  ☆34Updated 8 years ago
• PikaLabs / floyd
  A raft consensus implementation that is simply and understandable
  ☆321Updated 7 years ago
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 5 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year