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
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,243 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.2166927e-05 |
| 8,166 | CAvSAT: A System for Query Answering over Inconsistent Databases | 2019 | SIGMOD | 4.5712945e-05 |
| 12,012 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 49 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00067660624 |
| 7,063 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS | 4.8461152e-05 |
Previous
Page 1 / 1
Next