RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
☆102Mar 30, 2023Updated 2 years ago
Alternatives and similar repositories for remixdb
Users that are interested in remixdb are comparing it to the libraries listed below
Sorting:
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆212Aug 2, 2023Updated 2 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Mar 17, 2025Updated 11 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- ☆60Apr 13, 2023Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆85Apr 29, 2022Updated 3 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- Concurrent (with OLC) Adaptive Radix Trie in Golang.☆11Jul 31, 2020Updated 5 years ago
- ☆21Sep 20, 2023Updated 2 years ago
- An embedded key-value store library specialized for building state machine and log store☆238Jan 8, 2026Updated last month
- Adaptive Radix Tree in C++☆51Feb 25, 2026Updated last week
- The PebblesDB write-optimized key-value store (SOSP 17)☆521Apr 16, 2024Updated last year
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆95Apr 12, 2023Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 years ago
- ☆27May 27, 2022Updated 3 years ago
- ☆18Nov 19, 2021Updated 4 years ago
- wisckey implementation using RocksDB☆12Jan 14, 2023Updated 3 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Feb 7, 2026Updated 3 weeks ago
- ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems☆80Jun 8, 2023Updated 2 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Dec 15, 2021Updated 4 years ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆76Aug 7, 2020Updated 5 years ago
- SC 2021, "LogECMem: Coupling Erasure-Coded In-Memory Key-Value Stores with Parity Logging"☆12Jul 12, 2021Updated 4 years ago
- ☆10Dec 20, 2013Updated 12 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- ☆611Feb 26, 2026Updated last week
- A RocksDB plugin for key-value separation, inspired by WiscKey.☆515Aug 6, 2025Updated 6 months ago
- Fundamental Building Block for Elastic Storage With Strong Consistency and Reliability☆211Jul 15, 2022Updated 3 years ago
- Repository for FAST'23 paper GL-Cache: Group-level Learning for Efficient and High-Performance Caching☆51May 12, 2023Updated 2 years ago
- Explore JIT in TiDB☆27Jan 8, 2022Updated 4 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- ☆13Aug 1, 2025Updated 7 months ago
- Fast and efficient file system metadata through LSM-tree☆30Sep 22, 2022Updated 3 years ago
- A port for rocksdb☆103Mar 27, 2022Updated 3 years ago
- ☆44Aug 19, 2021Updated 4 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆48May 22, 2023Updated 2 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- TSXor: A Simple Time Series Compression Algorithm☆53Feb 19, 2025Updated last year
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Dec 11, 2022Updated 3 years ago