LPD-EPFL / flodbLinks
A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
☆26Updated 8 years ago
Alternatives and similar repositories for flodb
Users that are interested in flodb are comparing it to the libraries listed below
Sorting:
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- reimplementing scalog from scratch☆30Updated 4 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- Persistent Memory Storage Engine☆24Updated 8 months ago
- An RDMA-powered, fast, and scalable Paxos protocol☆25Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- NOPaxos consensus protocol☆135Updated 4 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
- HOT - Height Optimized Trie☆154Updated 7 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- Go Version of Redis on PMEM☆12Updated 3 years ago
- ☆29Updated 2 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- ☆54Updated last year
- ☆35Updated last year
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆169Updated last year
- 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
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆27Updated 3 years ago
- ☆47Updated last year
- LSM-trie☆114Updated 4 years ago
- A fast in-memory key-value store☆49Updated 7 years 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
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- ☆20Updated 2 years ago