DBScholar

Back to papers

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)

Paper ID
1926
Venue
PODS
Year
2023
Pagerank
5.6765621e-05
Overall Rank
7,195 | 50.64%
DOI
10.1145/3584372.3588675

Incoming Non-self Citations Over Time

Authors

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,235 Output-Sensitive Evaluation of Regular Path Queries 2025 PODS 5.3016261e-05
10,182 The Space-Time Complexity of Sum-Product Queries 2026 PODS 5.093636e-05
10,221 Differentially Oblivious Multi-way Join 2026 SIGMOD 5.093636e-05
10,638 A Theoretical Framework for Distribution-Aware Dataset Search 2025 PODS 5.093636e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers