Alternatives and similar repositories for masstree

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

• kohler / masstree-beta
  Beta release of Masstree.
  ☆457Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆106Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆252Updated 5 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆90Updated 8 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆398Updated 8 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆213Updated 10 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 9 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• yxymit / DBx1000
  ☆290Updated 3 years ago
• pmem / pmemkv
  Key/Value Datastore for Persistent Memory
  ☆404Updated 2 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 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…
  ☆182Updated 8 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last year
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 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)
  ☆84Updated 3 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
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year