IBM / uDepotLinks
Key-Value Store for Non-Volatile Memories uDepot
☆46Updated 3 years ago
Alternatives and similar repositories for uDepot
Users that are interested in uDepot are comparing it to the libraries listed below
Sorting:
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆20Updated 2 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆163Updated 3 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆154Updated 6 years ago
- 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
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- Adaptive Radix Tree in C++☆45Updated last month
- A fast in-memory key-value store☆49Updated 7 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- ☆47Updated last year
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- pmwcas☆139Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Remote Persistent Memory Access Library☆103Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆58Updated 2 months ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- The Cicada engine☆57Updated 8 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆61Updated 2 months ago
- 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
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆169Updated last year
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- ☆14Updated 2 years ago
- ☆29Updated 2 years ago