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,885 | Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations | 2022 | VLDB | 6.6674822e-05 |
| 4,953 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8085795e-05 |
| 5,088 | TCUDB: Accelerating Database with Tensor Processors | 2022 | SIGMOD | 5.7072189e-05 |
| 7,065 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8447515e-05 |
| 7,162 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8132423e-05 |
| 7,929 | Optimal Approximate Matrix Multiplication over Sliding Windows | 2026 | VLDB | 4.613363e-05 |
| 8,589 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 4.4897014e-05 |
| 8,966 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4193184e-05 |
| 9,744 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2897489e-05 |
| 10,347 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS | 4.1945683e-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.00033503922 |
| 342 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00026795977 |
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 3,143 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 7.4804326e-05 |
| 4,353 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 6.263585e-05 |
| 5,805 | GraphGen: Exploring Interesting Graphs in Relational Data | 2015 | VLDB | 5.3203552e-05 |
| 8,253 | SPARTex: A Vertex-Centric Framework for RDF Data Analytics | 2015 | VLDB | 4.5493149e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 4,465 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB | 6.1604282e-05 |
| 1,619 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011111678 |
| 3,898 | Efficient Join Algorithms For Large Database Tables in a Multi-GPU Environment | 2021 | VLDB | 6.6551268e-05 |
| 7,122 | Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries | 2020 | PODS | 4.8252188e-05 |
| 1,939 | From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System | 2015 | SIGMOD | 0.00010025655 |
| 2,044 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB | 9.6953608e-05 |
| 3,885 | Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations | 2022 | VLDB | 6.6674822e-05 |
| 2,275 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.1262202e-05 |
| 7,065 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8447515e-05 |