Alternatives and similar repositories for depart

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

• ustcadsl / unikv
  ☆27Updated 3 years ago
• iotlpf / ROLEX
  ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
  ☆79Updated 2 years ago
• ustcadsl / diffkv
  ☆61Updated 2 years ago
• adslabcuhk / elect
  ☆13Updated 2 months ago
• Thesys-lab / fast23-GLCache
  Repository for FAST'23 paper GL-Cache: Group-level Learning for Efficient and High-Performance Caching
  ☆51Updated 2 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆110Updated last year
• ukulililixl / ParaRC
  ☆23Updated 2 months ago
• dmemsys / FUSEE
  This is the implementation repository of our FAST'23 paper: FUSEE: A Fully Memory-Disaggregated Key-Value Store.
  ☆59Updated 2 years ago
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆37Updated 2 years ago
• fallfish / sepbit
  ☆27Updated 3 years ago
• dmemsys / SMART
  This is the implementation repository of our OSDI'23 paper: SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory.
  ☆63Updated 11 months ago
• SJTU-IPADS / xstore
  Fast RDMA-based Ordered Key-Value Store using Remote Learned Cache
  ☆116Updated 4 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆77Updated 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
  ☆77Updated 5 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆48Updated 2 years ago
• YuchongHu / logecmem
  SC 2021, "LogECMem: Coupling Erasure-Coded In-Memory Key-Value Stores with Parity Logging"
  ☆12Updated 4 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…
  ☆44Updated 3 months ago
• minghust / ford
  [FAST 2022] FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory
  ☆62Updated last year
• 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
• emperorlu / Learned-RocksDB
  ☆15Updated 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
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆37Updated 6 years ago
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 8 years ago
• WukLab / pDPM
  Passive Disaggregated Persistent Memory at USENIX ATC 2020.
  ☆51Updated 4 years ago
• ruihong123 / dLSM
  dLSM: An LSM-Based Index for RDMA-Enabled Memory Disaggregation
  ☆34Updated 2 years ago
• thustorage / nvm-datastructure
  ☆51Updated 5 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆34Updated 3 years ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 years ago
• minghust / motor
  [OSDI 2024] Motor: Enabling Multi-Versioning for Distributed Transactions on Disaggregated Memory
  ☆50Updated last year