The world's first wait-free KV store with generic durable linearizable transactions
☆41Feb 26, 2022Updated 4 years ago
Alternatives and similar repositories for RedoDB
Users that are interested in RedoDB are comparing it to the libraries listed below
Sorting:
- A Wait-Free Universal Construct for Large Objects☆97Nov 29, 2019Updated 6 years ago
- Concurrency Control Benchmark☆49Sep 3, 2023Updated 2 years ago
- ☆15Mar 31, 2022Updated 3 years ago
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆46Aug 12, 2025Updated 6 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- The Cicada engine☆59Jun 16, 2017Updated 8 years ago
- An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…☆70Apr 12, 2025Updated 10 months ago
- Nonblocking data structures☆12Jan 25, 2015Updated 11 years ago
- ☆11Jul 9, 2023Updated 2 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Jan 19, 2018Updated 8 years ago
- ☆50Apr 11, 2024Updated last year
- ☆81Sep 9, 2025Updated 5 months ago
- An implementation of various in-memory concurrency control protocols☆28Mar 30, 2024Updated last year
- ☆15Sep 9, 2020Updated 5 years ago
- A compact hash algorithm for CPUs and GPUs using OpenCL☆15Sep 26, 2020Updated 5 years ago
- Scalable Hashing on Persistent Memory☆194Apr 16, 2024Updated last year
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Aug 31, 2015Updated 10 years ago
- Python bindings for the PMDK. Non-volatile memory for Python.☆13Mar 22, 2023Updated 2 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Mar 18, 2021Updated 4 years ago
- ☆126Apr 8, 2022Updated 3 years ago
- A new memory mapping interface for efficient direct user-space access to byte-addressable storage, published in MICRO2022.☆15Sep 29, 2022Updated 3 years ago
- A simple, fast command-line tool for searching and comparing text documents.☆19Sep 6, 2024Updated last year
- A user level library for applications to transparently use Intel DSA.☆41Jan 23, 2026Updated last month
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Dec 11, 2022Updated 3 years ago
- Disk backed concurrent ART implementation, with optional generations.☆14Nov 8, 2023Updated 2 years ago
- A simple implementation of the packed memory array☆20Sep 1, 2013Updated 12 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- ☆36Mar 28, 2023Updated 2 years ago
- ☆16Nov 29, 2025Updated 3 months ago
- MV-RLU: Scaling Read-Log-Update with Multi-Versioning☆15Nov 8, 2021Updated 4 years ago
- NVLeak: Off-Chip Side-Channel Attacks via Non-Volatile Memory Systems [USENIX Security '23]☆19Nov 17, 2022Updated 3 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- A lock-free malloc(3) implementation☆20Jun 15, 2025Updated 8 months ago
- Artifact for PPoPP'18☆19Apr 11, 2022Updated 3 years ago
- Systematic CXL Memory Characterization and Performance Analysis at Scale (ASPLOS'25)☆24Oct 28, 2025Updated 4 months ago
- Test suite for device mapper targets☆23Mar 11, 2025Updated 11 months ago