A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join
Summary: Dichotomy conjecture for consistent query answering under primary-key constraints: for fixed Boolean CQ q, deciding whether q is certain over all repairs is either in PTime or coNP-complete. This paper proves the dichotomy for all two-atom queries, including self-joins, extending prior self-join-free and path-query results. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anantha Padmanabha (Indian Institute of Technology Dharwad)
- 2. Luc Segoufin (INRIA; Paris Sciences et Lettres University; École Normale Supérieure)
- 3. Cristina Sirangelo (CNRS; INRIA; Institute for Fundamental Computer Science (Institut de Recherche en Informatique Fondamentale); University of Paris (Université Paris Cité))
BibTeX Citation
@inproceedings{padmanabha_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join}},
url = {https://dl.acm.org/doi/10.1145/3651137},
doi = {10.1145/3651137},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Padmanabha, Anantha and Segoufin, Luc and Sirangelo, Cristina},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
| 10,650 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS | 5.093636e-05 |
| 11,121 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS | 5.093636e-05 |
| 11,146 | Computing Range Consistent Answers to Aggregation Queries via Rewriting | 2024 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00049907763 |
| 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.9625097e-05 |
| 2,565 | Database Repairs and Consistent Query Answering: Origins and Further Developments | 2019 | PODS | 8.4116912e-05 |
| 7,558 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS | 5.5993651e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 2 | 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 3 | 5,854 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS |
| 4 | 10,650 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS |
| 5 | 1,041 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS |
| 6 | 11,121 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS |
| 7 | 11,524 | A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys | 2022 | PODS |
| 8 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 9 | 7,558 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS |
| 10 | 5,773 | Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms | 2018 | PODS |