Fast Matrix Multiplication meets the Submodular Width
Summary: Matrix-multiplication framework for Boolean conjunctive queries, unifying combinatorial and non-combinatorial techniques via information theory. Omega-submodular width extends submodular width to capture fast matrix multiplication; a matching algorithm runs in this width, recovering known bounds and revealing new faster cases. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Mahmoud Abo Khamis (RelationalAI)
- 2. Xiao Hu (University of Waterloo)
- 3. Dan Suciu (University of Washington)
BibTeX Citation
@inproceedings{khamis_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Fast Matrix Multiplication meets the Submodular Width}},
url = {https://dl.acm.org/doi/10.1145/3725235},
doi = {10.1145/3725235},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Hu, Xiao and Suciu, Dan},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,146 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
| 10,159 | Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time | 2026 | PODS | 5.093636e-05 |
| 10,165 | PANDAExpress: A Simpler and Faster PANDA Algorithm | 2026 | PODS | 5.093636e-05 |
| 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 5.093636e-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 |
|---|---|---|---|---|
| 321 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS | 0.00021283186 |
| 358 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020243592 |
| 1,109 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00012142685 |
| 2,266 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS | 8.8391372e-05 |
| 5,364 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD | 6.2472125e-05 |
| 5,368 | Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations | 2022 | VLDB | 6.2448114e-05 |
| 6,885 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 5.7464502e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 2 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 3 | 2,266 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS |
| 4 | 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 5 | 10,170 | Towards Parameterized Hardness on Maintaining Conjunctive Queries | 2026 | PODS |
| 6 | 9,994 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 7 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 8 | 10,169 | Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries | 2026 | PODS |
| 9 | 6,885 | Fast Matrix Multiplication for Query Processing | 2024 | PODS |
| 10 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |