Alternatives and similar repositories for RedoDB:

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

• tuhhosg / exmap
  ☆40Updated 10 months ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 9 months 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
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• LLNL / umap
  User-space Page Management
  ☆106Updated 6 months ago
• futurewei-cloud / QuantaDB
  ☆14Updated last year
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆98Updated 6 months 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
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 3 months ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• multicore-locks / litl
  LiTL: Library for Transparent Lock Interposition
  ☆79Updated last year
• oracle / nvm-direct
  A C library to support applications that map Non-Volatile Memory into their address space for load/store access.
  ☆56Updated 5 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)
  ☆74Updated 2 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• snalli / nstore
  NVM Database from Carnegie-Mellon U
  ☆24Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• nkallima / Synch-Framework
  An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…
  ☆67Updated 2 months ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 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.
  ☆156Updated 3 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 4 years ago
• cmpxchg16 / tsx.me
  Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox
  ☆23Updated 10 years ago