DBScholar

Back to papers

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)

Paper ID
1988
Venue
PODS
Year
2024
Pagerank
5.8053953e-05
Overall Rank
6,678 | 54.19%
DOI
10.1145/3695838

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{deep_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{Output-sensitive Conjunctive Query Evaluation}},
        url = {https://dl.acm.org/doi/10.1145/3695838},
        doi = {10.1145/3695838},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Deep, Shaleen and Zhao, Hangdong and Fan, Austen Z. and Koutris, Paraschos},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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