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
- 2. Hangdong Zhao
- 3. Austen Z. Fan
- 4. Paraschos Koutris
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,587 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 4.4853975e-05 |
| 9,743 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2856385e-05 |
| 9,987 | I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server | 2026 | CIDR | 4.1905499e-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 |
|---|---|---|---|---|
| 31 | Provenance Semirings | 2007 | PODS | 0.00078516827 |
| 564 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020002796 |
| 1,452 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011922523 |
| 3,785 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 6.7658346e-05 |
| 4,350 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 6.2576191e-05 |
| 4,926 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8184457e-05 |
| 5,996 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2365238e-05 |
| 6,647 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD | 4.9729424e-05 |
| 7,060 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8401037e-05 |
| 8,673 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS | 4.4660157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8086254e-05 |
| 1,575 | Reverse Engineering Complex Join Queries | 2013 | SIGMOD | 0.00011288804 |
| 4,926 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8184457e-05 |
| 2,246 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2039096e-05 |
| 144 | Optimization of Nonrecursive Queries | 1986 | VLDB | 0.00041430126 |
| 5,582 | Conjunctive Queries with Inequalities Under Updates | 2018 | VLDB | 5.4211286e-05 |
| 7,060 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8401037e-05 |
| 6,094 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD | 5.2099705e-05 |
| 3,083 | Computing Local Sensitivities of Counting Queries with Joins | 2020 | SIGMOD | 7.5985351e-05 |
| 8,587 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 4.4853975e-05 |