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,743 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2856385e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1905499e-05 |
| 10,353 | A Theoretical Framework for Distribution-Aware Dataset Search | 2025 | PODS | 4.1905499e-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 |
|---|---|---|---|---|
| 564 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020002796 |
| 657 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00018581389 |
| 770 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001686092 |
| 1,054 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00014397587 |
| 1,452 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011922523 |
| 3,022 | Secure Yannakakis: Join-Aggregate Queries over Private Data | 2021 | SIGMOD | 7.6942462e-05 |
| 3,147 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 7.4825501e-05 |
| 3,782 | Bag Query Containment and Information Theory | 2020 | PODS | 6.7691169e-05 |
| 3,785 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 6.7658346e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,019 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 6.521716e-05 |
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 9,747 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS | 4.2856385e-05 |
| 11,017 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1905499e-05 |
| 7,588 | Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data | 2012 | VLDB | 4.6996269e-05 |
| 3,069 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS | 7.6161135e-05 |
| 4,545 | Bounded Conjunctive Queries | 2014 | VLDB | 6.0917464e-05 |
| 867 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD | 0.00015757737 |
| 5,859 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 5.2963939e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1905499e-05 |