efficient / rocksdbLinks
A library that provides an embeddable, persistent key-value store for fast storage.
☆38Updated 6 years ago
Alternatives and similar repositories for rocksdb
Users that are interested in rocksdb are comparing it to the libraries listed below
Sorting:
- A version of RocksDB that uses persistent memory☆92Updated 7 months ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆92Updated 2 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 8 months ago
- ☆146Updated 2 years ago
- ☆120Updated 3 years ago
- ☆43Updated 3 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- ☆72Updated 2 months 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
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆76Updated 4 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆72Updated last year
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- ☆29Updated 2 years ago
- ☆29Updated 5 years ago
- ☆60Updated 2 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 4 years ago
- Key Value Store based on LevelDB☆113Updated 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
- An efficient database query optimizer for large complex join queries☆131Updated 2 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆200Updated last year
- Scalable Hashing on Persistent Memory☆194Updated last year
- ☆30Updated 2 years ago
- HOT - Height Optimized Trie☆153Updated 7 years ago