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:
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆91Updated 2 years ago
- ☆144Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- A version of RocksDB that uses persistent memory☆92Updated 6 months ago
- ☆119Updated 3 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆72Updated last year
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- ☆43Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 7 months ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆76Updated 4 years ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆29Updated 5 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago
- ☆72Updated 2 months ago
- ☆60Updated 2 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 4 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- HOT - Height Optimized Trie☆150Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- ☆28Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆55Updated 3 weeks ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- Key Value Store based on LevelDB☆113Updated 3 years ago