Output-sensitive Conjunctive Query Evaluation
Summary: Output-sensitive algorithm for acyclic CQs with free variables; extends Yannakakis and improves runtime without matrix multiplication. Tight bounds for stars (matching lower bound) and a cyclic-CQ family under k-clique conjecture; extensions to paths. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shaleen Deep (Microsoft)
- 2. Hangdong Zhao (University of Wisconsin)
- 3. Austen Z. Fan (University of Wisconsin)
- 4. Paraschos Koutris (University of Wisconsin)
BibTeX Citation
@inproceedings{deep_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Output-sensitive Conjunctive Query Evaluation}},
url = {https://dl.acm.org/doi/10.1145/3695838},
doi = {10.1145/3695838},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Deep, Shaleen and Zhao, Hangdong and Fan, Austen Z. and Koutris, Paraschos},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,573 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 5.7455776e-05 |
| 9,410 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 5.1826718e-05 |
| 10,356 | I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server | 2026 | CIDR | 4.9793485e-05 |
| 10,363 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS | 4.9793485e-05 |
| 10,365 | Size Bound-Adorned Datalog | 2026 | PODS | 4.9793485e-05 |
| 10,508 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD | 4.9793485e-05 |
| 10,768 | One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans | 2026 | VLDB | 4.9793485e-05 |
| 10,905 | ZipFlow: a Compiler-based Framework to Unleash Compressed Data Movement for Modern GPUs | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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.00059752575 |
| 357 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020020639 |
| 1,091 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00012074152 |
| 3,187 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 7.5546613e-05 |
| 3,494 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 7.2582926e-05 |
| 3,596 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 7.1790375e-05 |
| 5,487 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD | 6.1096421e-05 |
| 6,429 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.7884926e-05 |
| 6,567 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 5.7469783e-05 |
| 8,832 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS | 5.2680847e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,292 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 2 | 1,345 | Reverse Engineering Complex Join Queries | 2013 | SIGMOD |
| 3 | 3,494 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS |
| 4 | 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 5 | 143 | Optimization of Nonrecursive Queries | 1986 | VLDB |
| 6 | 5,145 | Conjunctive Queries with Inequalities Under Updates | 2018 | VLDB |
| 7 | 6,567 | Fast Matrix Multiplication for Query Processing | 2024 | PODS |
| 8 | 6,195 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD |
| 9 | 2,488 | Computing Local Sensitivities of Counting Queries with Joins | 2020 | SIGMOD |
| 10 | 6,573 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS |