Alternatives and similar repositories for palmtree:

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

• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆148Updated 6 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 5 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆154Updated last year
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 4 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• microsoft / pmwcas
  pmwcas
  ☆136Updated last year
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆249Updated 4 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 12 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆250Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆440Updated last year
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆114Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 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…
  ☆179Updated 7 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆90Updated last year
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆112Updated 3 years ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 4 months ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆98Updated last year
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆226Updated this week
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆158Updated 3 years ago