Alternatives and similar repositories for SILK-USENIXATC2019:

Users that are interested in SILK-USENIXATC2019 are comparing it to the libraries listed below

• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 2 months ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 3 months ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆74Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated last year
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 3 years ago
• 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
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆156Updated 3 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆112Updated last year
• ustcadsl / diffkv
  ☆58Updated last year
• efficient / cicada-exp-sigmod2017
  Cicada SIGMOD 2017 evaluation
  ☆16Updated 7 years ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• wangziqi2016 / index-microbench
  ☆142Updated last year
• DICL / CCEH
  ☆98Updated 4 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆195Updated last year
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆110Updated 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
• sudarsunkannan / lsm_nvm
  NoveLSM
  ☆38Updated 6 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆51Updated 3 years ago
• Pfzuo / Level-Hashing
  Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)
  ☆200Updated 4 years ago
• cosmoss-jigu / pactree
  ☆28Updated 3 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆104Updated 3 months ago
• ls4154 / YCSB-cpp
  YCSB written in C++ (for LevelDB, RocksDB, LMDB, WiredTiger, SQLite)
  ☆100Updated 4 months ago
• SJTU-IPADS / drtm
  Fast In-memory Transaction Processing using RDMA and HTM
  ☆57Updated 9 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 5 years ago
• thustorage / octopus
  An RDMA-enabled Distributed Persistent Memory File System
  ☆155Updated 7 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
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago