On Functional Aggregate Queries with Additive Inequalities
Summary: Introduces FAQ-AI (functional aggregate queries with additive inequalities) and relaxed tree decompositions/widths, enabling faster Boolean evaluation by extending InsideOut with Chazelle's semigroup range-search. Defines counting submodular width (#subw) between submodular and fractional hypertree widths to bound runtimes and gives faster in-database algorithms for k-means, linear SVM, and non-polynomial-loss training than materializing joins. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis (RelationalAI)
- 2. Ryan R. Curtin (RelationalAI)
- 3. Benjamin Moseley (Carnegie Mellon University)
- 4. Hung Q. Ngo (RelationalAI)
- 5. XuanLong Nguyen (University of Michigan)
- 6. Dan Olteanu (University of Oxford)
- 7. Maximilian Schleich (University of Oxford)
BibTeX Citation
@inproceedings{khamis_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{On Functional Aggregate Queries with Additive Inequalities}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319694},
doi = {10.1145/3294052.3319694},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Curtin, Ryan R. and Moseley, Benjamin and Ngo, Hung Q. and Nguyen, XuanLong and Olteanu, Dan and Schleich, Maximilian},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 26 of 26 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 105 | The MADlib Analytics Library or MAD Skills, the SQL | 2012 | VLDB | 0.00033638251 |
| 315 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS | 0.00021246 |
| 357 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020020639 |
| 402 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00019104625 |
| 730 | Learning Generalized Linear Models Over Normalized Data | 2015 | SIGMOD | 0.00014406936 |
| 818 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.0001366708 |
| 918 | Accelerating XPath Location Steps | 2002 | SIGMOD | 0.00013084437 |
| 1,091 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00012074152 |
| 2,860 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD | 7.9338024e-05 |
| 2,975 | In-Database Learning with Sparse Tensors | 2018 | PODS | 7.7907759e-05 |
| 3,295 | Lightning Fast and Space Efficient Inequality Joins | 2015 | VLDB | 7.448168e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,855 | Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms | 2025 | VLDB |
| 2 | 1,275 | The Containment Problem for Real Conjunctive Queries with Inequalities | 2006 | PODS |
| 3 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 4 | 390 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS |
| 5 | 6,573 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS |
| 6 | 10,391 | A Unifying Algorithm for Hierarchical Queries | 2026 | PODS |
| 7 | 10,209 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS |
| 8 | 2,728 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 9 | 8,697 | Aggregate Queries on Sparse Databases | 2020 | PODS |
| 10 | 357 | FAQ: Questions Asked Frequently | 2016 | PODS |