Alternatives and similar repositories for memec

Users that are interested in memec are comparing it to the libraries listed below

• ukulililixl / openec
  ☆34Updated 5 months ago
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 5 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 4 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆78Updated 3 years ago
• ustcadsl / unikv
  ☆27Updated 3 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆94Updated 2 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• ustcadsl / depart
  ☆21Updated 2 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆94Updated last year
• thustorage / nvm-datastructure
  ☆50Updated 5 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆195Updated last year
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆50Updated 4 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 6 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆47Updated 7 months ago
• alexandervanrenen / pmembench
  Low level algorithms for persistent memory.
  ☆16Updated 4 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆117Updated 4 years ago
• Pfzuo / Level-Hashing
  Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)
  ☆204Updated 5 years ago
• SJTU-IPADS / cocytus
  Cocytus is an efficient and available in-memory K/V-store through hybrid erasure coding and replication
  ☆30Updated 9 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆213Updated 2 years ago
• DICL / CCEH
  ☆99Updated 5 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 7 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆167Updated 4 years ago
• WukLab / pDPM
  Passive Disaggregated Persistent Memory at USENIX ATC 2020.
  ☆51Updated 5 years ago
• PDS-Lab / GearDB
  GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction
  ☆40Updated 6 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆119Updated 4 years ago