Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
Summary: Jaguar is a primal, join-adaptive algorithm for conjunctive queries that maintains feasible polymatroids while guiding joins. It achieves O(N^(subw(Q)+ε)) time with a simpler analysis than PANDA and extends to degree-constrained submodular width. (summarized by gpt-5.6-luna on Jul 26 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. Hubie Chen (King's College London)
BibTeX Citation
@inproceedings{khamis_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time}},
url = {https://dl.acm.org/doi/10.1145/3801904},
doi = {10.1145/3801904},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Chen, Hubie},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 357 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020020639 |
| 818 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.0001366708 |
| 1,091 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00012074152 |
| 1,690 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 9.8609347e-05 |
| 2,299 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS | 8.6727773e-05 |
| 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS | 8.3589894e-05 |
| 8,073 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS | 5.3942942e-05 |
| 11,086 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,096 | Soft and Constrained Hypertree Width | 2025 | PODS |
| 2 | 10,398 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 3 | 10,391 | A Unifying Algorithm for Hierarchical Queries | 2026 | PODS |
| 4 | 7,338 | Space-Time Tradeoffs for Conjunctive Queries with Access Patterns | 2023 | PODS |
| 5 | 7,466 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 6 | 6,467 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 7 | 11,086 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS |
| 8 | 10,182 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 9 | 1,091 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS |
| 10 | 10,382 | PANDAExpress: A Simpler and Faster PANDA Algorithm | 2026 | PODS |