Alternatives and similar repositories for wormhole:

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

• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆143Updated last year
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 4 months ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 4 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆52Updated 4 months ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆142Updated 6 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• readablesystems / sto
  Software Transactional Objects
  ☆58Updated 10 months ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆113Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 3 months ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆111Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆89Updated last year
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆157Updated 3 years ago
• tuhhosg / exmap
  ☆40Updated 10 months ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆43Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 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 7 years ago