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:
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- The Cicada engine☆59Updated 8 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
- ☆20Updated 2 years ago
- ☆44Updated 4 years ago
- Remote Persistent Memory Access Library☆104Updated 2 years ago
- NOPaxos consensus protocol☆138Updated 4 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Adaptive Radix Tree in C++☆47Updated this week
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆30Updated 3 years ago
- A fast in-memory key-value store☆51Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆172Updated last year
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- pmwcas☆138Updated 2 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆47Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- An RDMA-powered, fast, and scalable Paxos protocol☆26Updated 6 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- ☆54Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆203Updated 2 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- ☆149Updated 2 years ago