Alternatives and similar repositories for bLSM:

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

• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆176Updated 3 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆94Updated 5 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆208Updated 9 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 6 months ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆250Updated 4 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 6 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆69Updated 10 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆213Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆159Updated last year
• logcabin / liblogcabin
  An attempt to split the Raft library out of LogCabin
  ☆37Updated 7 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 6 months ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 10 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 9 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆441Updated last year
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆126Updated 6 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆158Updated 3 years ago
• weicao / cascadb
  Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB
  ☆426Updated 11 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago