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)
Incoming Non-self Citations Over Time
Authors
- 1. Nofar Carmeli (CNRS; INRIA; PSL University; École Normale Supérieure)
- 2. Luc Segoufin (INRIA; PSL University; École Normale Supérieure)
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.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,904 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS | 5.5181056e-05 |
| 9,845 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS | 5.2094004e-05 |
| 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS | 5.093636e-05 |
| 10,170 | Towards Parameterized Hardness on Maintaining Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
| 10,183 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
| 10,639 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 5.093636e-05 |
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,170 | Towards Parameterized Hardness on Maintaining Conjunctive Queries | 2026 | PODS |
| 2 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 3 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 4 | 4,670 | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins | 2020 | PODS |
| 5 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 6 | 9,845 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS |
| 7 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 8 | 8,047 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS |
| 9 | 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 10 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |