Alternatives and similar repositories for autovec-db:

Users that are interested in autovec-db are comparing it to the libraries listed below

• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆27Updated 2 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 2 years ago
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆14Updated 5 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆43Updated 9 months ago
• viktorleis / vmcache
  ☆62Updated 10 months ago
• peterboncz / bloomfilter-repro
  ☆23Updated 5 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆52Updated 4 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆74Updated 2 years ago
• utsaslab / dinomo
  DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)
  ☆36Updated last year
• psiul / ICDE2019-GPU-Join
  Implementation of the algorithm described in "Hardware-conscious Hash-Joins on GPUs" paper presented in ICDE 2019
  ☆33Updated 4 years ago
• hpides / perma-bench
  A benchmarking suite to evaluate the performance of persistent memory access (PerMA-Bench @ VLDB '22)
  ☆18Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆24Updated last year
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 3 months ago
• CloudOLTP / Cornus
  ☆21Updated 2 years ago
• wheatman / BP-Tree
  ☆14Updated 3 weeks 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 3 weeks ago
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆24Updated last year
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆38Updated 2 years ago
• baotonglu / dex
  DEX: Scalable Range Indexing on Disaggregated Memory
  ☆23Updated 6 months ago
• CARV-ICS-FORTH / parallax
  A persistent key-value store that is embeddable and optimized for fast storage.
  ☆30Updated 3 months ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• snu-dbxlab / vWeaver
  ☆8Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• tuhhosg / exmap
  ☆40Updated 10 months 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
• sfu-dis / optiql
  Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)
  ☆24Updated 9 months ago