DBScholar

Back to papers

AJAR: Aggregations and Joins over Annotated Relations

Summary: Shows multiway join algorithms plus generalized hypertree decompositions (GHDs) suffice for aggregate-join queries over annotated relations, achieving best-known runtimes. Characterizes equivalent aggregation orders and valid GHDs and decomposes them into unconstrained sub-GHDs to leverage GHD results for tighter bounds, distributed variants, and efficient approximate GHD search. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1687
Venue
PODS
Year
2016
Pagerank
0.00010390168
Overall Rank
1,549 | 89.38%
DOI
10.1145/2902251.2902293

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{joglekar_pods16,
        address = {New York, NY, USA},
        series = {{PODS} '16},
        title = {{AJAR: Aggregations and Joins over Annotated Relations}},
        url = {https://dl.acm.org/doi/10.1145/2902251.2902293},
        doi = {10.1145/2902251.2902293},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Joglekar, Manas and Puttagunta, Rohan and Ré, Christopher},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 25 of 25 citing papers.

Rank Citing Paper Year Venue Pagerank
816 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013827772
1,740 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.875587e-05
2,573 Secure Yannakakis: Join-Aggregate Queries over Private Data 2021 SIGMOD 8.4015654e-05
3,941 Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins 2023 PODS 7.0074268e-05
4,371 Instance and Output Optimal Parallel Algorithms for Acyclic Joins 2019 PODS 6.738679e-05
4,553 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 6.6346951e-05
4,575 Conjunctive Queries with Comparisons 2022 SIGMOD 6.6223692e-05
4,976 SPORES: Sum-Product Optimization via Relational Equality Saturation for Large Scale Linear Algebra 2020 VLDB 6.4168322e-05
5,463 Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins 2021 PODS 6.2086169e-05
6,398 Query Evaluation by Circuits 2022 PODS 5.8867918e-05
6,434 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 5.8799421e-05
6,444 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.8774519e-05
6,585 JoinBoost: Grow Trees Over Normalized Data Using Only SQL 2023 VLDB 5.8350362e-05
6,666 Residual Sensitivity for Differentially Private Multi-Way Joins 2021 SIGMOD 5.8086805e-05
6,885 Fast Matrix Multiplication for Query Processing 2024 PODS 5.7464502e-05
7,143 Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries 2020 PODS 5.6915726e-05
7,161 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 5.6852987e-05
7,292 A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries 2022 PODS 5.653597e-05
9,720 Avoiding Materialisation for Guarded Aggregate Queries 2025 VLDB 5.2319816e-05
9,961 Threshold Queries in Theory and in the Wild 2022 VLDB 5.1879626e-05
10,154 Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum 2026 PODS 5.093636e-05
10,296 Succinct Structure Representations for Efficient Query Optimization 2026 SIGMOD 5.093636e-05
10,342 Approximate Query Processing under Updates 2026 SIGMOD 5.093636e-05
11,183 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 5.093636e-05
11,421 Lightweight Materialization for Fast Dashboards Over Joins 2023 SIGMOD 5.093636e-05
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
17 Provenance Semirings 2007 PODS 0.00059843817
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
358 FAQ: Questions Asked Frequently 2016 PODS 0.00020243592
411 Worst-case Optimal Join Algorithms 2012 PODS 0.00018902089
860 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00013560445
2,330 Hypertree Decompositions and Tractable Queries 1999 PODS 8.7447066e-05
3,841 DunceCap: Query Plans Using Generalized Hypertree Decompositions 2015 SIGMOD 7.0808098e-05
8,168 DunceCap: Compiling Worst-Case Optimal Query Plans 2015 SIGMOD 5.4743814e-05
Previous Page 1 / 1 Next

Semantically Similar Papers