Alternatives and similar repositories for Radix-Hash-Join

Users that are interested in Radix-Hash-Join 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.
  ☆48Updated last week
• cloud-olap / FlexPushdownDB
  ☆75Updated 10 months ago
• TsinghuaDatabaseGroup / CloudDB
  continuously update cloud database papers
  ☆83Updated 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 4 years ago
• tidb-incubator / vldbss-2021
  ☆21Updated 4 years ago
• yongwen / columbia
  An efficient database query optimizer for large complex join queries
  ☆137Updated 2 years ago
• zanmato1984 / cura
  CURA - CUDA Relational Algebra
  ☆31Updated 3 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)
  ☆70Updated last month
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆55Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• splvm / database-meetup
  The home page of database meetup
  ☆78Updated 3 years ago
• hpides / viper
  Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)
  ☆78Updated 3 years ago
• CloudOLTP / Cornus
  ☆22Updated 3 years ago
• SJTU-IPADS / vegito
  ☆53Updated 2 years ago
• Aaaaaaron / database-papers
  ☆73Updated 3 years ago
• asu-idi / CaaS-LSM
  [SIGMOD '24] CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure
  ☆71Updated last year
• rsy56640 / paper-reading
  record paper reading notes
  ☆42Updated 2 years ago
• shanzi / NvmEngine
  Experimental KV store engine on non-volatile memory
  ☆72Updated 5 years ago
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆267Updated 7 years ago
• UWHustle / HATtrick
  ☆36Updated 3 years ago
• luyi0619 / aria
  GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database
  ☆74Updated last year
• yxymit / s3filter
  ☆22Updated 2 years ago
• alexandervanrenen / pmembench
  Low level algorithms for persistent memory.
  ☆16Updated 4 years ago
• zuochunwei / hpc
  ☆21Updated 2 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• purduedb / OpenAurora
  OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …
  ☆104Updated 3 weeks ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆213Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 9 months ago
• UCHI-DB / sboost
  SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data
  ☆11Updated 4 years ago
• CDDSCLab / Database-Optimization
  A collection of work related to Database Optimization.
  ☆53Updated 3 years ago