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
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 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)
  ☆80Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆154Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 14 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆86Updated 4 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
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆163Updated 3 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 6 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 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 8 years ago
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆154Updated 7 years ago
• LLNL / umap
  User-space Page Management
  ☆109Updated 11 months ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 3 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• HagarMeir / transactionLib
  Transactional Data Structure Libraries
  ☆12Updated 7 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last month
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆60Updated 4 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 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/…
  ☆68Updated 3 months ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago