Alternatives and similar repositories for palmtree

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

• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆456Updated 2 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆106Updated 7 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆195Updated last year
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆252Updated 5 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
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 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 4 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 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
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• stephentu / silo
  Multicore in-memory storage engine
  ☆398Updated 8 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆237Updated 3 weeks 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
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago