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)
Incoming Non-self Citations Over Time
Authors
- 1. Manas Joglekar (Stanford University)
- 2. Rohan Puttagunta (Stanford University)
- 3. Christopher Ré (Stanford University)
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.
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,959 | Simplicity Done Right for Join Ordering | 2021 | CIDR |
| 2 | 3,622 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB |
| 3 | 6,678 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 4 | 7,286 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 5 | 1,740 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 6 | 6,444 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS |
| 7 | 1,286 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 8 | 8,235 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD |
| 9 | 12,386 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB |
| 10 | 3,941 | Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins | 2023 | PODS |