Alternatives and similar repositories for lsm-tree

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

• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆123Updated 5 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆234Updated 2 weeks ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆67Updated 3 years ago
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 8 years ago
• apc999 / libcuckoo
  A high-performance, concurrent hash table
  ☆24Updated 11 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 5 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆103Updated 2 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆162Updated last year
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 9 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆70Updated 11 years ago
• viktorleis / mmapbench
  ☆141Updated 3 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 2 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last month
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆81Updated last year
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 6 years ago
• ajdavis / python-paxos-jepsen
  Paxos in Python, tested with Jepsen
  ☆31Updated 3 years ago
• couchbase / kv_engine
  Couchbase Key-Value Engine
  ☆140Updated this week
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 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
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆80Updated 3 years ago