DBScholar

Back to papers

Circuit Bounds for Conjunctive Queries with Self-joins

Summary: Circuit size bounds for CQs under semiring semantics; extends Boolean self-join-free k-clique lower bounds. Relates self-join CQ complexity to self-join-free cases via semiring-specific correspondences and introduces endomorphism-based analysis. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1995
Venue
PODS
Year
2025
Pagerank
5.093636e-05
Overall Rank
10,639 | 27.01%
DOI
10.1145/3725229

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{fan_pods25,
        address = {New York, NY, USA},
        series = {{PODS} '25},
        title = {{Circuit Bounds for Conjunctive Queries with Self-joins}},
        url = {https://dl.acm.org/doi/10.1145/3725229},
        doi = {10.1145/3725229},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fan, Austen Z. and Koutris, Paraschos and Zhao, Hangdong},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 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