Alternatives and similar repositories for Proteus

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

• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• zzy590 / article-code
  知乎文章附带代码
  ☆15Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 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
• cloud-olap / FlexPushdownDB
  ☆74Updated 7 months 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…
  ☆45Updated 4 months ago
• tidb-incubator / vldbss-2021
  ☆21Updated 4 years ago
• BigDataAnalyticsGroup / analysis-rmi
  Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes
  ☆20Updated last year
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆77Updated 3 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 7 months ago
• wheatman / BP-Tree
  ☆15Updated 9 months ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 years ago
• zxjcarrot / DPTree-code
  Source code for DPTree: Differential Indexing for Persistent Memory
  ☆61Updated 4 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
• Henning1 / dogqc
  A query compiler for GPUs that translates relational algebra to Cuda.
  ☆20Updated last year
• wangziqi2016 / index-microbench
  ☆150Updated 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
• ustcadsl / diffkv
  ☆60Updated 2 years ago
• PDS-Lab / MatrixKV
  MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with a Matrix Container in NVM
  ☆76Updated 5 years ago
• UWHustle / HATtrick
  ☆34Updated 3 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆34Updated 3 years ago
• embryo-labs / Robust-Predicate-Transfer
  [SIGMOD'25] Source code for the paper: Debunking the Myth of Join Ordering: Toward Robust SQL Analytics
  ☆20Updated 2 months ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 6 months ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 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
• basicthinker / YCSB-C
  Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)
  ☆167Updated 4 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago