Alternatives and similar repositories for wormhole

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

• speedskater / hot
  HOT - Height Optimized Trie
  ☆155Updated 7 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• readablesystems / sto
  Software Transactional Objects
  ☆58Updated last year
• cosmoss-jigu / hydralist
  ☆30Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆195Updated 10 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆163Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• viktorleis / vmcache
  ☆72Updated 5 months ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆59Updated 4 months ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 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 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• tuhhosg / exmap
  ☆48Updated last year
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆124Updated 5 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆118Updated 4 years ago
• huanchenz / index-microbench
  ☆15Updated 8 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