mtyiu / memec
MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
☆11Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for memec
- ☆31Updated 2 years ago
- ☆18Updated last year
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 2 years ago
- Cocytus is an efficient and available in-memory K/V-store through hybrid erasure coding and replication☆30Updated 8 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆73Updated 2 years ago
- Passive Disaggregated Persistent Memory at USENIX ATC 2020.☆51Updated 4 years ago
- SC 2021, "LogECMem: Coupling Erasure-Coded In-Memory Key-Value Stores with Parity Logging"☆12Updated 3 years ago
- ☆43Updated 3 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆35Updated 2 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
- ☆27Updated 2 years ago
- [FAST 2022] FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory☆60Updated 4 months ago
- Low level algorithms for persistent memory.☆16Updated 3 years ago
- LB+-Tree implementation☆47Updated 3 years ago
- ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems☆66Updated last year
- Key-value store with new indexing☆36Updated 5 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Updated 3 years ago
- This is the implementation repository of our FAST'23 paper: FUSEE: A Fully Memory-Disaggregated Key-Value Store.☆53Updated last year
- Benchmarking framework for index structures on persistent memory☆87Updated last year
- ☆28Updated 3 years ago
- ☆24Updated 2 years ago
- ☆46Updated 4 years ago
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Updated 3 months ago
- Tiered Indexing is a general way to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap, and…☆26Updated 6 months ago
- ☆22Updated last year
- ☆25Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆46Updated last year
- Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory☆101Updated last month
- Key/Value Datastore for Persistent Memory☆27Updated 3 years ago
- ☆58Updated last year