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
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,010 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.1945683e-05 |
| 10,343 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 4.1945683e-05 |
| 10,357 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS | 4.1945683e-05 |
| 10,899 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS | 4.1945683e-05 |
| 10,928 | Computing Range Consistent Answers to Aggregation Queries via Rewriting | 2024 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 49 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00067660624 |
| 2,243 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2166927e-05 |
| 2,566 | Database Repairs and Consistent Query Answering: Origins and Further Developments | 2019 | PODS | 8.5243847e-05 |
| 7,069 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS | 4.8438319e-05 |
Previous
Page 1 / 1
Next