Alternatives and similar repositories for zero

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

• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• HewlettPackard / foedus
  FOEDUS: Fast Optimistic Engine for Data Unification Services
  ☆65Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 8 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆105Updated 7 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆157Updated 7 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated last year
• stephentu / silo
  Multicore in-memory storage engine
  ☆397Updated 8 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 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
• yxymit / DBx1000
  ☆290Updated 2 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆449Updated 2 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 8 months ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆211Updated 9 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year