Alternatives and similar repositories for RedoDB

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

• tuhhosg / exmap
  ☆47Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• 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
• caetanosauer / fineline-zero
  ☆12Updated 6 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)
  ☆79Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• oscarlab / versioning
  Framework for creating simple, efficient, and composable lock-free data structures
  ☆12Updated 9 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 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
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• yoavz1997 / Efficient-Lock-Free-Durable-Sets
  Code for "Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, and Erez Petrank. Efficient Lock-Free Durable Sets, OOPSLA 2019" (ht…
  ☆19Updated 5 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆60Updated 4 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• LLNL / umap
  User-space Page Management
  ☆107Updated 9 months ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 7 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆55Updated 4 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 4 years ago
• viktorleis / vmcache
  ☆70Updated 2 months ago
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago