Database Paper Browser

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
1688
Venue
PODS
Year
2016
Pagerank
9.3845975e-05
Overall Rank
2,169 | 84.92%
DOI
10.1145/2902251.2902293

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 23 of 23 citing papers.

Rank Citing Paper Year Venue Pagerank
1,056 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.0001441128
2,275 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.1262202e-05
3,024 Secure Yannakakis: Join-Aggregate Queries over Private Data 2021 SIGMOD 7.692511e-05
4,708 Instance and Output Optimal Parallel Algorithms for Acyclic Joins 2019 PODS 5.980172e-05
5,104 Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins 2023 PODS 5.6946113e-05
5,487 SPORES: Sum-Product Optimization via Relational Equality Saturation for Large Scale Linear Algebra 2020 VLDB 5.4791501e-05
5,639 Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins 2021 PODS 5.393897e-05
5,718 Conjunctive Queries with Comparisons 2022 SIGMOD 5.3552123e-05
5,765 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 5.336442e-05
7,017 Query Evaluation by Circuits 2022 PODS 4.8603097e-05
7,064 Residual Sensitivity for Differentially Private Multi-Way Joins 2021 SIGMOD 4.8450749e-05
7,065 Fast Matrix Multiplication for Query Processing 2024 PODS 4.8447515e-05
7,122 Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries 2020 PODS 4.8252188e-05
7,162 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 4.8132423e-05
7,467 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 4.7218691e-05
7,579 A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries 2022 PODS 4.706055e-05
7,920 JoinBoost: Grow Trees Over Normalized Data Using Only SQL 2023 VLDB 4.6163888e-05
8,589 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 4.4897014e-05
9,798 Threshold Queries in Theory and in the Wild 2022 VLDB 4.2818172e-05
10,049 Approximate Query Processing under Updates 2026 SIGMOD 4.1945683e-05
10,551 Avoiding Materialisation for Guarded Aggregate Queries 2025 VLDB 4.1945683e-05
10,970 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.1945683e-05
11,220 Lightweight Materialization for Fast Dashboards Over Joins 2023 SIGMOD 4.1945683e-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
31 Provenance Semirings 2007 PODS 0.0007857786
342 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026795977
502 Worst-case Optimal Join Algorithms 2012 PODS 0.00021526612
583 FAQ: Questions Asked Frequently 2016 PODS 0.00019717214
1,259 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00012995821
2,796 Hypertree Decompositions and Tractable Queries 1999 PODS 8.1112658e-05
5,053 DunceCap: Query Plans Using Generalized Hypertree Decompositions 2015 SIGMOD 5.7323846e-05
8,195 DunceCap: Compiling Worst-Case Optimal Query Plans 2015 SIGMOD 4.561696e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
4,523 Simplicity Done Right for Join Ordering 2021 CIDR 6.1135504e-05
4,465 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 6.1604282e-05
8,966 Output-sensitive Conjunctive Query Evaluation 2024 PODS 4.4193184e-05
8,061 Efficient Computation of Quantiles over Joins 2023 PODS 4.5943269e-05
2,275 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.1262202e-05
8,589 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 4.4897014e-05
1,619 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.00011111678
8,159 Computing Complex Temporal Join Queries Efficiently 2022 SIGMOD 4.5729025e-05
12,191 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.1945683e-05
5,104 Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins 2023 PODS 5.6946113e-05