Fast Matrix Multiplication for Query Processing
Summary: Leverages fast matrix multiplication to speed query processing; two-table join+project maps to Boolean matrix mult. Then generalizes to join-project queries, yielding polynomial gains over Yannakakis and first improvement for acyclic cases since 1981. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiao Hu (University of Waterloo)
BibTeX Citation
@inproceedings{hu_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Fast Matrix Multiplication for Query Processing}},
url = {https://dl.acm.org/doi/10.1145/3651599},
doi = {10.1145/3651599},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Hu, Xiao},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,482 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 5.7529053e-05 |
| 6,585 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 5.7238683e-05 |
| 9,258 | An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication | 2025 | PODS | 5.1860131e-05 |
| 9,445 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 5.1630894e-05 |
| 10,839 | One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans | 2026 | VLDB | 4.9605343e-05 |
| 11,156 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 17 | Provenance Semirings | 2007 | PODS | 0.00059660827 |
| 318 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS | 0.00021178303 |
| 815 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00013682594 |
| 848 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00013463236 |
| 1,096 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00012035761 |
| 1,568 | AJAR: Aggregations and Joins over Annotated Relations | 2016 | PODS | 0.00010178045 |
| 5,514 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD | 6.0866191e-05 |
| 7,313 | Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries | 2020 | PODS | 5.5428538e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,156 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS |
| 2 | 13,568 | Using Semiouterjoins to Process Queries in Multidatabase Systems | 1984 | PODS |
| 3 | 6,585 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS |
| 4 | 5,522 | Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations | 2022 | VLDB |
| 5 | 5,523 | Temporal Query Processing and Optimization in Multiprocessor Database Machines | 1992 | VLDB |
| 6 | 2,151 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 7 | 10,464 | Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries | 2026 | PODS |
| 8 | 7,313 | Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries | 2020 | PODS |
| 9 | 6,482 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 10 | 5,514 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD |