Alternatives and similar repositories for RedoDB:

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

• tuhhosg / exmap
  ☆40Updated 11 months ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 9 months ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆78Updated 2 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
• L-v-M / async
  ☆20Updated 2 years 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.
  ☆157Updated 3 years 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
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆99Updated 6 months ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆60Updated 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
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 5 years ago
• urcs-sync / ralloc
  Recoverable lock-free allocator based on LRMalloc
  ☆47Updated 4 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• LLNL / umap
  User-space Page Management
  ☆108Updated 7 months ago
• hse-project / mpool
  mpool UAPI and CLI for HSE 1.x
  ☆35Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆74Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• NetApp / zufs-zus
  zero-copy user-mode server. User-mode server which delegates zufs commands to specific file-system implementation.
  ☆50Updated 4 years ago
• multicore-locks / litl
  LiTL: Library for Transparent Lock Interposition
  ☆79Updated last year