Alternatives and similar repositories for memec

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

• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆77Updated 4 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 3 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆76Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆29Updated 2 years ago
• epfl-labos / TRIAD
  ☆44Updated 3 years ago
• ukulililixl / openec
  ☆33Updated 2 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆118Updated 4 years ago
• ustcadsl / unikv
  ☆24Updated 3 years ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆93Updated 8 months ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 9 months ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• thustorage / nvm-datastructure
  ☆50Updated 4 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆200Updated 2 years ago
• alexandervanrenen / pmembench
  Low level algorithms for persistent memory.
  ☆16Updated 4 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆92Updated 2 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• pmem / pmem-redis
  A version of Redis that uses persistent memory
  ☆114Updated 8 months ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated 2 years ago
• Pfzuo / Level-Hashing
  Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)
  ☆204Updated 5 years ago
• ustcadsl / depart
  ☆20Updated last year
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆37Updated 2 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆37Updated 5 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• adslabcuhk / elect
  ☆13Updated 5 months 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…
  ☆36Updated last month
• schencoding / lbtree
  LB+-Tree implementation
  ☆49Updated 4 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆110Updated 9 months ago