Alternatives and similar repositories for Proteus

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

• zzy590 / article-code
  知乎文章附带代码
  ☆15Updated 2 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 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
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆76Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆60Updated 4 months ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 years ago
• ustcadsl / unikv
  ☆26Updated 3 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆150Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• WangEP / SLM-DB
  Key-value store with new indexing
  ☆37Updated 6 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
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆48Updated 2 years ago
• cloud-olap / FlexPushdownDB
  ☆74Updated 5 months 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
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆39Updated 2 months 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
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆21Updated 4 months ago
• schencoding / lbtree
  LB+-Tree implementation
  ☆49Updated 4 years ago
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆14Updated 2 years ago
• emperorlu / Learned-RocksDB
  ☆15Updated 2 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated 2 years ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆53Updated 2 years ago