Alternatives and similar repositories for foster-btree

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

• tuhhosg / exmap
  ☆50Updated last year
• L-v-M / async
  ☆20Updated 2 years ago
• unodb-dev / unodb
  Adaptive Radix Tree in C++
  ☆48Updated last week
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆26Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 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)
  ☆83Updated 3 years ago
• viktorleis / vmcache
  ☆79Updated 3 months ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆31Updated 7 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)
  ☆69Updated 3 months ago
• LineairDB / LineairDB
  C++ fast transactional key-value storage.
  ☆174Updated this week
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆111Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆134Updated 6 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆48Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 8 months ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆160Updated 6 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
• cosmoss-jigu / hydralist
  ☆30Updated 3 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
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• caetanosauer / fineline-zero
  ☆12Updated 7 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• viktorleis / mmapbench
  ☆146Updated 3 years ago