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
- 2. Xiao Hu
- 3. Dan Suciu
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 583 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00019717214 |
| 1,442 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011956109 |
| 3,006 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS | 7.7299363e-05 |
| 3,885 | Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations | 2022 | VLDB | 6.6674822e-05 |
| 6,647 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD | 4.9772122e-05 |
| 7,065 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8447515e-05 |
Previous
Page 1 / 1
Next