DBScholar

Back to papers

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)

Paper ID
he8188391f8bad604
Venue
PODS
Year
2019
Pagerank
8.6727773e-05
Overall Rank
2,299 | 84.55%
DOI
10.1145/3294052.3319694

Incoming Non-self Citations Over Time

Authors

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.

Rank Citing Paper Year Venue Pagerank
1,596 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 0.00010127607
2,591 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 8.2468757e-05
4,161 The Relational Data Borg is Learning 2020 VLDB 6.7700593e-05
4,509 Conjunctive Queries with Comparisons 2022 SIGMOD 6.570408e-05
4,752 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 6.434561e-05
5,482 Beyond Equi-joins: Ranking, Enumeration and Factorization 2021 VLDB 6.111411e-05
6,018 A Query Language Perspective on Graph Learning 2023 PODS 5.9129763e-05
6,550 JoinBoost: Grow Trees Over Normalized Data Using Only SQL 2023 VLDB 5.7503043e-05
6,573 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.7455776e-05
6,955 The Complexity of Boolean Conjunctive Queries with Intersection Joins 2022 PODS 5.6342744e-05
8,081 Saibot: A Differentially Private Data Search Platform 2023 VLDB 5.3942942e-05
8,852 Rapidash: Efficient Detection of Constraint Violations 2024 VLDB 5.2641151e-05
9,410 Output-Sensitive Evaluation of Regular Path Queries 2025 PODS 5.1826718e-05
10,209 Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization 2024 PODS 5.0596605e-05
10,363 Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries 2026 PODS 4.9793485e-05
10,370 Faster Relational Algorithms Using Geometric Data Structures 2026 PODS 4.9793485e-05
10,371 Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum 2026 PODS 4.9793485e-05
10,376 Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time 2026 PODS 4.9793485e-05
10,382 PANDAExpress: A Simpler and Faster PANDA Algorithm 2026 PODS 4.9793485e-05
10,398 The Space-Time Complexity of Sum-Product Queries 2026 PODS 4.9793485e-05
10,653 InferF: Declarative Factorization of AI/ML Inferences over Joins 2026 SIGMOD 4.9793485e-05
11,086 Fast Matrix Multiplication meets the Submodular Width 2025 PODS 4.9793485e-05
11,185 Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized 2025 SIGMOD 4.9793485e-05
11,492 Improved Approximation Algorithms for Relational Clustering 2024 PODS 4.9793485e-05
11,526 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.9793485e-05
11,735 Lightweight Materialization for Fast Dashboards Over Joins 2023 SIGMOD 4.9793485e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers