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 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• logcabin / liblogcabin
  An attempt to split the Raft library out of LogCabin
  ☆38Updated 7 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
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 2 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 7 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆115Updated 9 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆246Updated 4 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• rescrv / HyperLevelDB
  A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.
  ☆459Updated 9 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆438Updated last year
• wangziqi2016 / index-microbench
  ☆143Updated last year
• stephentu / silo
  Multicore in-memory storage engine
  ☆384Updated 7 years ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆70Updated 10 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 years ago
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆126Updated 6 years ago
• CatKang / Solitaire
  Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model
  ☆16Updated 6 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.
  ☆157Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 5 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆35Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆142Updated 6 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆212Updated last year
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 10 years ago