Alternatives and similar repositories for lsm-tree

Users that are interested in lsm-tree are comparing it to the libraries listed below

• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆237Updated last month
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆90Updated 8 years ago
• ajdavis / python-paxos-jepsen
  Paxos in Python, tested with Jepsen
  ☆31Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 8 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 3 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆76Updated 4 years ago
• cocagne / multi-paxos-example
  Example multi-paxos application for those learning Paxos & multi-paxos
  ☆94Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆96Updated 6 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆252Updated 5 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆67Updated 3 years ago
• s-hironobu / AlgorithmCollection
  An Educational parallel Algorithm collection
  ☆139Updated last year
• viktorleis / mmapbench
  ☆148Updated 3 years ago
• bohutang / omt
  A cache-efficiency weight balanced binary tree
  ☆71Updated 11 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
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 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
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 10 years ago
• couchbase / kv_engine
  Couchbase Key-Value Engine
  ☆145Updated last week
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆38Updated 6 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago