Space-Time Tradeoffs for Conjunctive Queries with Access Patterns
Summary: Presents a general algorithmic framework, based on PANDA and tree decompositions, that yields space–time tradeoffs for answering arbitrary conjunctive queries with access patterns via preprocessing. Framework subsumes prior ad-hoc tradeoffs (paths, triangles) and gives surprising improvements for reachability queries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hangdong Zhao
- 2. Shaleen Deep
- 3. Paraschos Koutris
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,744 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2897489e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1945683e-05 |
| 10,341 | A Theoretical Framework for Distribution-Aware Dataset Search | 2025 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 583 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00019717214 |
| 690 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00018099792 |
| 772 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00016876498 |
| 1,056 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.0001441128 |
| 1,442 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011956109 |
| 3,024 | Secure Yannakakis: Join-Aggregate Queries over Private Data | 2021 | SIGMOD | 7.692511e-05 |
| 3,143 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 7.4804326e-05 |
| 3,775 | Bag Query Containment and Information Theory | 2020 | PODS | 6.775636e-05 |
| 3,781 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 6.7723513e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,058 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 6.4866036e-05 |
| 8,851 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4363908e-05 |
| 9,748 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS | 4.2897489e-05 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
| 7,584 | Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data | 2012 | VLDB | 4.7041255e-05 |
| 3,065 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS | 7.6230903e-05 |
| 4,546 | Bounded Conjunctive Queries | 2014 | VLDB | 6.0987778e-05 |
| 870 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD | 0.00015771912 |
| 5,858 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 5.2997454e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1945683e-05 |