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 (University of Wisconsin)
- 2. Shaleen Deep (Microsoft)
- 3. Paraschos Koutris (University of Wisconsin)
BibTeX Citation
@inproceedings{zhao_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Space-Time Tradeoffs for Conjunctive Queries with Access Patterns}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588675},
doi = {10.1145/3584372.3588675},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Zhao, Hangdong and Deep, Shaleen and Koutris, Paraschos},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,410 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 5.1826718e-05 |
| 10,398 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.9793485e-05 |
| 10,437 | Differentially Oblivious Multi-way Join | 2026 | SIGMOD | 4.9793485e-05 |
| 11,081 | A Theoretical Framework for Distribution-Aware Dataset Search | 2025 | PODS | 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 |
|---|---|---|---|---|
| 357 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020020639 |
| 540 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.00016726545 |
| 637 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00015341557 |
| 812 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00013729015 |
| 1,091 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00012074152 |
| 2,582 | Secure Yannakakis: Join-Aggregate Queries over Private Data | 2021 | SIGMOD | 8.2594787e-05 |
| 2,916 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD | 7.8583302e-05 |
| 3,187 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 7.5546613e-05 |
| 3,526 | Bag Query Containment and Information Theory | 2020 | PODS | 7.2321894e-05 |
| 5,489 | Compressed Representations of Conjunctive Query Results | 2018 | PODS | 6.1095111e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,104 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS |
| 2 | 11,561 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 3 | 7,768 | Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data | 2012 | VLDB |
| 4 | 2,790 | Processing First-Order Queries under Limited Access Patterns | 2004 | PODS |
| 5 | 4,452 | Bounded Conjunctive Queries | 2014 | VLDB |
| 6 | 12,195 | The Tractability Frontier of Well-designed SPARQL Queries | 2018 | PODS |
| 7 | 869 | Query Optimization in the Presence of Limited Access Patterns | 1999 | SIGMOD |
| 8 | 4,698 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS |
| 9 | 5,489 | Compressed Representations of Conjunctive Query Results | 2018 | PODS |
| 10 | 10,398 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |