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)

Paper ID: 1929
Venue: PODS
Year: 2024
Pagerank: 4.8447515e-05
Overall Rank: 7,065 | 50.86%
DOI: 10.1145/3651599

Incoming Non-self Citations Over Time

Authors

1. Xiao Hu

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
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,342	An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication	2025	PODS	4.1945683e-05
10,347	Fast Matrix Multiplication meets the Submodular Width	2025	PODS	4.1945683e-05

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
31	Provenance Semirings	2007	PODS	0.0007857786
1,056	The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates	2017	SIGMOD	0.0001441128
1,259	Aggregation and Ordering in Factorised Databases	2013	VLDB	0.00012995821
1,442	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00011956109
2,169	AJAR: Aggregations and Joins over Annotated Relations	2016	PODS	9.3845975e-05
6,647	Fast Join Project Query Evaluation using Matrix Multiplication	2020	SIGMOD	4.9772122e-05
7,122	Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries	2020	PODS	4.8252188e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,432	Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins	2016	PODS	6.1938383e-05
10,347	Fast Matrix Multiplication meets the Submodular Width	2025	PODS	4.1945683e-05
13,032	Using Semiouterjoins to Process Queries in Multidatabase Systems	1984	PODS	4.1945683e-05
8,589	Output-Optimal Algorithms for Join-Aggregate Queries	2025	PODS	4.4897014e-05
3,885	Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations	2022	VLDB	6.6674822e-05
5,132	Temporal Query Processing and Optimization in Multiprocessor Database Machines	1992	VLDB	5.6740462e-05
2,044	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB	9.6953608e-05
7,122	Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries	2020	PODS	4.8252188e-05
8,966	Output-sensitive Conjunctive Query Evaluation	2024	PODS	4.4193184e-05
6,647	Fast Join Project Query Evaluation using Matrix Multiplication	2020	SIGMOD	4.9772122e-05