Fast Join Project Query Evaluation using Matrix Multiplication
Summary: Uses matrix multiplication as a subroutine to accelerate projection-enabled joins under worst-case optimality. Parameterized by final output size to pick the best strategy; experiments show up to 50x speedups leveraging optimized, parallel libraries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shaleen Deep
- 2. Xiao Hu
- 3. Paraschos Koutris
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,886 | Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations | 2022 | VLDB | 6.6610704e-05 |
| 4,926 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8184457e-05 |
| 5,089 | TCUDB: Accelerating Database with Tensor Processors | 2022 | SIGMOD | 5.7017353e-05 |
| 7,060 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8401037e-05 |
| 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8086254e-05 |
| 7,931 | Optimal Approximate Matrix Multiplication over Sliding Windows | 2026 | VLDB | 4.6089395e-05 |
| 8,587 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 4.4853975e-05 |
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
| 9,743 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2856385e-05 |
| 10,359 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 218 | Aggregate-Query Processing in Data Warehousing Environments | 1995 | VLDB | 0.00033489004 |
| 341 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00026850764 |
| 503 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021517145 |
| 3,147 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 7.4825501e-05 |
| 4,350 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 6.2576191e-05 |
| 5,813 | GraphGen: Exploring Interesting Graphs in Relational Data | 2015 | VLDB | 5.3161293e-05 |
| 8,249 | SPARTex: A Vertex-Centric Framework for RDF Data Analytics | 2015 | VLDB | 4.5449877e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 503 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021517145 |
| 4,466 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB | 6.1545841e-05 |
| 1,621 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011105663 |
| 3,899 | Efficient Join Algorithms For Large Database Tables in a Multi-GPU Environment | 2021 | VLDB | 6.6513982e-05 |
| 7,117 | Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries | 2020 | PODS | 4.8205884e-05 |
| 1,938 | From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System | 2015 | SIGMOD | 0.00010025547 |
| 2,051 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB | 9.6871984e-05 |
| 3,886 | Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations | 2022 | VLDB | 6.6610704e-05 |
| 2,281 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.122455e-05 |
| 7,060 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8401037e-05 |