baotonglu / dash
Scalable Hashing on Persistent Memory
☆187Updated 6 months ago
Related projects ⓘ
Alternatives and complementary repositories for dash
- Benchmarking framework for index structures on persistent memory☆87Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Updated 3 weeks ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆73Updated 2 years ago
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆151Updated 3 years ago
- MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM☆74Updated 4 years ago
- A version of RocksDB that uses persistent memory☆92Updated this week
- Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)☆200Updated 4 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆85Updated last year
- ☆58Updated last year
- ☆98Updated 3 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 3 years ago
- ☆142Updated last year
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆96Updated last year
- ☆43Updated 3 years ago
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Updated 3 months ago
- LB+-Tree implementation☆47Updated 3 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆190Updated last year
- Key Value Store based on LevelDB☆110Updated 3 years ago
- ☆115Updated 2 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆35Updated 2 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆71Updated 6 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆47Updated last month
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 2 years ago
- ☆46Updated 4 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 5 years ago
- Key-value store with new indexing☆36Updated 5 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆87Updated last year
- High Performance Learned Index on Persistent Memory☆46Updated last year
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- ☆28Updated 3 years ago