Alternatives and similar repositories for lsm-trie

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

• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆180Updated 7 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆209Updated 9 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆444Updated last year
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 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
• speedskater / hot
  HOT - Height Optimized Trie
  ☆155Updated 7 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.
  ☆166Updated 3 years ago
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆89Updated 11 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆390Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆124Updated 5 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
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆195Updated 10 months ago
• efficient / memc3
  MemC3
  ☆154Updated 8 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 5 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆124Updated 5 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 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)
  ☆81Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 8 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 9 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago