Alternatives and similar repositories for foster-btree

Users that are interested in foster-btree are comparing it to the libraries listed below

• tuhhosg / exmap
  ☆48Updated last year
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last week
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆155Updated 6 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• viktorleis / vmcache
  ☆72Updated 4 months ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆30Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 8 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
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆25Updated last year
• LineairDB / LineairDB
  C++ fast transactional key-value storage.
  ☆170Updated 3 weeks ago
• viktorleis / mmapbench
  ☆138Updated 3 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆63Updated 3 months ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆101Updated 2 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• efficient / cicada-exp-sigmod2017-DBx1000
  A fork of DBx1000 for Cicada SIGMOD 2017 evaluation
  ☆9Updated 8 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆162Updated last year
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆106Updated 11 months ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆77Updated last year
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 years ago