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,589 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 4.4897014e-05 |
| 9,744 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2897489e-05 |
| 9,988 | I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server | 2026 | CIDR | 4.1945683e-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.0007857786 |
| 583 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00019717214 |
| 1,442 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011956109 |
| 3,781 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 6.7723513e-05 |
| 4,353 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 6.263585e-05 |
| 4,953 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8085795e-05 |
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-05 |
| 6,647 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD | 4.9772122e-05 |
| 7,065 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8447515e-05 |
| 8,677 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS | 4.4703012e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,162 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8132423e-05 |
| 1,572 | Reverse Engineering Complex Join Queries | 2013 | SIGMOD | 0.00011298251 |
| 4,953 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8085795e-05 |
| 2,243 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2166927e-05 |
| 143 | Optimization of Nonrecursive Queries | 1986 | VLDB | 0.00041510555 |
| 5,576 | Conjunctive Queries with Inequalities Under Updates | 2018 | VLDB | 5.426344e-05 |
| 7,065 | Fast Matrix Multiplication for Query Processing | 2024 | PODS | 4.8447515e-05 |
| 6,090 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD | 5.2148332e-05 |
| 3,104 | Computing Local Sensitivities of Counting Queries with Joins | 2020 | SIGMOD | 7.5578613e-05 |
| 8,589 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 4.4897014e-05 |