DBScholar

Back to papers

Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis

Summary: Initiates a fine-grained enumeration complexity study of conjunctive queries with self-joins, extending dichotomies for linear delay and constant delay after linear preprocessing and identifying new tractable cases that arise only with self-joins. Develops tagging-based hardness proofs, provides sufficient and necessary tractability conditions, and settles low-arity and cyclic-core cases while leaving many instances open. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1918
Venue
PODS
Year
2023
Pagerank
6.064817e-05
Overall Rank
5,854 | 59.84%
DOI
10.1145/3584372.3588667

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{carmeli_pods23,
        address = {New York, NY, USA},
        series = {{PODS} '23},
        title = {{Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis}},
        url = {https://dl.acm.org/doi/10.1145/3584372.3588667},
        doi = {10.1145/3584372.3588667},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Carmeli, Nofar and Segoufin, Luc},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,468 On the Enumeration Complexity of Unions of Conjunctive Queries 2019 PODS 8.5358494e-05
Previous Page 1 / 1 Next

Semantically Similar Papers