Charting the Tractability Frontier of Certain Conjunctive Query Answering
Summary: Classifies attack-graph cycles (weak vs strong) for acyclic self-join-free Boolean CQs over uncertain DBs (primary-key violations) to chart CERTAINTY(q) tractability. Proves strong cycles ⇒ coNP-complete; no strong and only terminal weak cycles ⇒ P; studies nonterminal weak cycles and connects complexity to probabilistic query evaluation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jef Wijsen (University of Mons)
BibTeX Citation
@inproceedings{wijsen_pods13,
address = {New York, NY, USA},
series = {{PODS} '13},
title = {{Charting the Tractability Frontier of Certain Conjunctive Query Answering}},
url = {https://dl.acm.org/doi/10.1145/2463664.2463666},
doi = {10.1145/2463664.2463666},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Wijsen, Jef},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.9625097e-05 |
| 8,228 | CAvSAT: A System for Query Answering over Inconsistent Databases | 2019 | SIGMOD | 5.4621278e-05 |
| 12,210 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 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 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,648 | Consistent Query Answers in Inconsistent Probabilistic Databases | 2010 | SIGMOD |
| 2 | 874 | On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases | 2003 | PODS |
| 3 | 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 4 | 7,558 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS |
| 5 | 10,650 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS |
| 6 | 11,121 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS |
| 7 | 5,773 | Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms | 2018 | PODS |
| 8 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 9 | 12,210 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB |
| 10 | 7,088 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS |