Alternatives and similar repositories for wormhole:

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

• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆148Updated 7 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆55Updated 5 months ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• tuhhosg / exmap
  ☆43Updated 11 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 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.
  ☆158Updated 3 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 4 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 5 months ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 4 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆114Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• sfu-dis / optiql
  Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)
  ☆24Updated 10 months ago
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆121Updated 5 months ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 4 months ago
• viktorleis / vmcache
  ☆63Updated last week
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆43Updated last year