Alternatives and similar repositories for foster-btree

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

• L-v-M / async
  ☆20Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• tuhhosg / exmap
  ☆47Updated last year
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 8 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated 2 weeks ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• sfu-dis / skeena
  Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)
  ☆21Updated 2 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 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
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆59Updated 2 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 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)
  ☆80Updated 3 years ago
• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆24Updated last month
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆30Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆24Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 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)
  ☆57Updated last month
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• umbra-db / colibri-vldb2024
  Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"
  ☆22Updated 11 months ago