pramalhe / RedoDBLinks
The world's first wait-free KV store with generic durable linearizable transactions
☆41Updated 3 years ago
Alternatives and similar repositories for RedoDB
Users that are interested in RedoDB are comparing it to the libraries listed below
Sorting:
- ☆48Updated last year
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- User-space Page Management☆108Updated last year
- ☆54Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆81Updated 3 years ago
- ☆30Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- HOT - Height Optimized Trie☆155Updated 7 years ago
- ☆12Updated 6 years ago
- a high performance cache simulator and library☆109Updated last year
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆79Updated 7 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- The Cicada engine☆59Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Atlas: Programming for Persistent Memory☆76Updated 4 years ago
- LiTL: Library for Transparent Lock Interposition☆84Updated 2 years ago
- pmwcas☆139Updated 2 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- Remote Persistent Memory Access Library☆104Updated 2 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 6 years ago
- LSM-trie☆114Updated 4 years ago
- ☆72Updated 5 months ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Sundial: A distributed OLTP database testbed.☆38Updated 4 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- An open-source BzTree implementation☆92Updated 4 years ago