Alternatives and similar repositories for vWeaver

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

• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆28Updated 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
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆14Updated last year
• Henning1 / dogqc
  A query compiler for GPUs that translates relational algebra to Cuda.
  ☆20Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• wheatman / BP-Tree
  ☆13Updated 3 months ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 5 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆75Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆88Updated 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
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆13Updated 2 years ago
• WukLab / pDPM
  Passive Disaggregated Persistent Memory at USENIX ATC 2020.
  ☆51Updated 4 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated 9 months ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 years ago
• cloud-olap / FlexPushdownDB
  ☆72Updated last month
• viktorleis / vmcache
  ☆68Updated last month
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 8 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 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 3 months ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆53Updated last week
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• UWHustle / HATtrick
  ☆30Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆14Updated 3 weeks ago
• dmemsys / FUSEE
  This is the implementation repository of our FAST'23 paper: FUSEE: A Fully Memory-Disaggregated Key-Value Store.
  ☆57Updated 2 years ago
• CloudOLTP / Cornus
  ☆21Updated 2 years ago
• SJTU-IPADS / dst
  A decentralized scalar timestamp scheme
  ☆16Updated 4 years ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago