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
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆39Updated 2 years ago
• tuhhosg / exmap
  ☆39Updated 9 months ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆40Updated this week
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆99Updated 5 months ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆51Updated 3 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 8 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆54Updated 4 years ago
• rotaki / tpcc-runner
  An implementation of various in-memory concurrency control protocols
  ☆24Updated 10 months ago
• 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
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆46Updated last year
• oscarlab / versioning
  Framework for creating simple, efficient, and composable lock-free data structures
  ☆12Updated 8 years ago
• flode / ARTSynchronized
  ☆116Updated 2 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.
  ☆155Updated 3 years ago
• umbra-db / colibri-vldb2024
  Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"
  ☆19Updated 6 months ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025)
  ☆42Updated last week
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆22Updated 9 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago