Alternatives and similar repositories for DPTree-code:

Users that are interested in DPTree-code are comparing it to the libraries listed below

• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆74Updated 2 years ago
• SJTU-IPADS / vegito
  ☆52Updated last year
• 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
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated last year
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 2 years ago
• SJTU-IPADS / xstore
  Fast RDMA-based Ordered Key-Value Store using Remote Learned Cache
  ☆116Updated 3 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…
  ☆33Updated last month
• cloud-olap / FlexPushdownDB
  ☆70Updated 6 months ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated 3 months ago
• ustcadsl / unikv
  ☆24Updated 2 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 7 months ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• ustcadsl / diffkv
  ☆58Updated last year
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025)
  ☆28Updated last month
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆87Updated 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
• luyi0619 / aria
  GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database
  ☆71Updated 9 months ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆46Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆27Updated 2 years ago
• tidb-incubator / vldbss-2021
  ☆22Updated 3 years ago
• zanmato1984 / cura
  CURA - CUDA Relational Algebra
  ☆31Updated last year
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆74Updated last year
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆36Updated last year
• iotlpf / ROLEX
  ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
  ☆70Updated last year
• schencoding / lbtree
  LB+-Tree implementation
  ☆47Updated 3 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆36Updated 5 years ago