Alternatives and similar repositories for TRIAD:

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

• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆89Updated last year
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆74Updated 4 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 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
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆74Updated 2 years ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 3 months ago
• SJTU-IPADS / drtm
  Fast In-memory Transaction Processing using RDMA and HTM
  ☆57Updated 9 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 4 months ago
• alexandervanrenen / pmembench
  Low level algorithms for persistent memory.
  ☆16Updated 4 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 5 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆111Updated 3 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated 6 months ago
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆157Updated 3 years ago
• cosmoss-jigu / pactree
  ☆28Updated 3 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• wangziqi2016 / index-microbench
  ☆143Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• ustcadsl / diffkv
  ☆58Updated last year
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• thustorage / nvm-datastructure
  ☆47Updated 4 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆36Updated last year
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• sudarsunkannan / lsm_nvm
  NoveLSM
  ☆38Updated 6 years ago
• ustcadsl / unikv
  ☆24Updated 2 years ago
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 3 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆50Updated 3 years ago