The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
Summary: Effective complexity classification of CERTAINTY(q) for self-join-free Boolean conjunctive queries under primary-key constraints: FO-membership decidable and an effective P vs coNP-complete dichotomy. Settles a decade-old open problem by combining and extending prior techniques. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Paraschos Koutris (University of Washington)
- 2. Jef Wijsen (University of Mons)
BibTeX Citation
@inproceedings{koutris_pods15,
address = {New York, NY, USA},
series = {{PODS} '15},
title = {{The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints}},
url = {https://dl.acm.org/doi/10.1145/2745754.2745769},
doi = {10.1145/2745754.2745769},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Koutris, Paraschos and Wijsen, Jef},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 23 of 23 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 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 |
| 7,088 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS | 5.7068548e-05 |
| 8,626 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS | 5.3970875e-05 |
Previous
Page 1 / 1
Next