Alternatives and similar repositories for HOPE

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

• 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…
  ☆125Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆135Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆83Updated 3 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• kohler / masstree-beta
  Beta release of Masstree.
  ☆450Updated 2 years ago
• yxymit / DBx1000
  ☆290Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated last month
• viktorleis / vmcache
  ☆79Updated 3 months ago
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆265Updated 7 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆160Updated 6 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• stephentu / silo
  Multicore in-memory storage engine
  ☆397Updated 8 years ago
• tuhhosg / exmap
  ☆50Updated last year
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 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 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago