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 |
|---|---|---|---|---|
| 1,876 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS | 9.6582947e-05 |
| 8,006 | CAvSAT: A System for Query Answering over Inconsistent Databases | 2019 | SIGMOD | 5.5657389e-05 |
| 12,020 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB | 5.1725247e-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 |
|---|---|---|---|---|
| 40 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00047753495 |
| 6,896 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS | 5.8138967e-05 |
Previous
Page 1 / 1
Next