A Unifying Algorithm for Hierarchical Queries
Summary: Hierarchical self-join-free BCQs mark the exact tractability boundary for the bag-set maximization problem—NP-complete for non-hierarchical queries. A single polynomial algorithm over an abstract 2-monoid unifies probabilistic evaluation, Shapley-value computation, and bag-set maximization via different 2-monoid instantiations. (summarized by gpt-5-mini on Feb 11 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. Jesse Comer (University of Pennsylvania)
- 3. Phokion G. Kolaitis (IBM; University of California Santa Cruz)
- 4. Sudeepa Roy (Duke University)
- 5. Val Tannen (University of Pennsylvania)
BibTeX Citation
@inproceedings{khamis_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{A Unifying Algorithm for Hierarchical Queries}},
url = {https://dl.acm.org/doi/10.1145/3767710},
doi = {10.1145/3767710},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Comer, Jesse and Kolaitis, Phokion G. and Roy, Sudeepa and Tannen, Val},
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 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 636 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001551856 |
| 3,991 | The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries | 2016 | VLDB | 6.9695922e-05 |
| 4,670 | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins | 2020 | PODS | 6.5734205e-05 |
| 7,269 | A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations | 2023 | SIGMOD | 5.6595955e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,266 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS |
| 2 | 382 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS |
| 3 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 4 | 4,187 | Maximally Joining Probabilistic Data | 2007 | PODS |
| 5 | 10,175 | Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories | 2026 | PODS |
| 6 | 9,946 | Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability. | 2024 | PODS |
| 7 | 4,393 | Bounded Conjunctive Queries | 2014 | VLDB |
| 8 | 3,457 | Bag Query Containment and Information Theory | 2020 | PODS |
| 9 | 1,269 | The Containment Problem for Real Conjunctive Queries with Inequalities | 2006 | PODS |
| 10 | 10,183 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS |