Alternatives and similar repositories for DBstack

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

• zz-jason / leanstore
  LeanStore is a B-tree based key-value storage library with high throughput and full ACID transactions.
  ☆42Updated last week
• CloudOLTP / Cornus
  ☆22Updated 2 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆202Updated 2 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆76Updated 3 years ago
• cloud-olap / FlexPushdownDB
  ☆74Updated 5 months ago
• asu-idi / CaaS-LSM
  [SIGMOD '24] CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure
  ☆70Updated 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
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 years ago
• CDDSCLab / Weekly-Group-Meeting-Paper-List
  DSCL weekly group meeting paper list
  ☆63Updated 2 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆37Updated 6 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
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆65Updated last week
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• coyorkdow / wisckey
  WiscKey is a highly SSD optimized key-value storage based on LevelDB.
  ☆32Updated 3 years ago
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 4 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated last month
• zzy590 / article-code
  知乎文章附带代码
  ☆15Updated 2 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…
  ☆41Updated 3 months ago
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆25Updated 2 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• 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
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• ls4154 / YCSB-cpp
  YCSB written in C++ for embedded databases. (supporting LevelDB, RocksDB, LMDB, WiredTiger, and SQLite)
  ☆114Updated last week
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆114Updated 3 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 3 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆103Updated 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
• iotlpf / ROLEX
  ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems
  ☆78Updated 2 years ago