wuxb45 / remixdbLinks
RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
☆103Updated 2 years ago
Alternatives and similar repositories for remixdb
Users that are interested in remixdb are comparing it to the libraries listed below
Sorting:
- ☆44Updated 4 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆202Updated 2 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- Key Value Store based on LevelDB☆114Updated 3 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆92Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆65Updated 3 weeks ago
- An open-source BzTree implementation☆92Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆164Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆195Updated 11 months ago
- ☆149Updated 2 years ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆77Updated 5 years ago
- ☆30Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- A version of RocksDB that uses persistent memory☆93Updated 10 months ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 3 years ago
- Hermes: a fault-tolerant replication protocol, implemented over RDMA, guaranteeing linearizability and achieving low latency and high thr…☆172Updated last year
- ☆121Updated 2 years ago
- ☆26Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆74Updated last year
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- ☆121Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 6 months ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Key Value Development Kit☆203Updated 10 months ago
- KVell: the Design and Implementation of a Fast Persistent Key-Value Store☆287Updated 4 years ago
- ☆14Updated 3 years ago
- ☆72Updated 3 weeks ago