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.6404062e-05
Overall Rank
2,316 | 84.48%
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,603 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 0.00010090639
2,602 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 8.2157154e-05
4,174 The Relational Data Borg is Learning 2020 VLDB 6.750725e-05
4,527 Conjunctive Queries with Comparisons 2022 SIGMOD 6.5466033e-05
4,730 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 6.4313418e-05
5,506 Beyond Equi-joins: Ranking, Enumeration and Factorization 2021 VLDB 6.0883761e-05
6,032 A Query Language Perspective on Graph Learning 2023 PODS 5.8906344e-05
6,562 JoinBoost: Grow Trees Over Normalized Data Using Only SQL 2023 VLDB 5.7287508e-05
6,585 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.7238683e-05
6,979 The Complexity of Boolean Conjunctive Queries with Intersection Joins 2022 PODS 5.6129856e-05
8,106 Saibot: A Differentially Private Data Search Platform 2023 VLDB 5.3739121e-05
8,881 Rapidash: Efficient Detection of Constraint Violations 2024 VLDB 5.2442249e-05
9,445 Output-Sensitive Evaluation of Regular Path Queries 2025 PODS 5.1630894e-05
10,252 Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization 2024 PODS 5.0405429e-05
10,441 Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries 2026 PODS 4.9605343e-05
10,448 Faster Relational Algorithms Using Geometric Data Structures 2026 PODS 4.9605343e-05
10,449 Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum 2026 PODS 4.9605343e-05
10,454 Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time 2026 PODS 4.9605343e-05
10,460 PANDAExpress: A Simpler and Faster PANDA Algorithm 2026 PODS 4.9605343e-05
10,476 The Space-Time Complexity of Sum-Product Queries 2026 PODS 4.9605343e-05
10,725 InferF: Declarative Factorization of AI/ML Inferences over Joins 2026 SIGMOD 4.9605343e-05
11,156 Fast Matrix Multiplication meets the Submodular Width 2025 PODS 4.9605343e-05
11,253 Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized 2025 SIGMOD 4.9605343e-05
11,550 Improved Approximation Algorithms for Relational Clustering 2024 PODS 4.9605343e-05
11,581 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.9605343e-05
11,785 Lightweight Materialization for Fast Dashboards Over Joins 2023 SIGMOD 4.9605343e-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