Consistent Query Answering for Primary Keys on Rooted Tree Queries
Summary: CQA with primary-key violations for rooted-tree Boolean CQs; CERTAINTY(q) falls into three regimes: FO, NL-hard with LFP, or coNP-complete, determinable in polynomial time from q. CFG-based fixpoint algorithm with homomorphism criteria; extends to broader PK schemas with simple keys. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Paraschos Koutris (University of Wisconsin)
- 2. Xiating Ouyang (University of Wisconsin)
- 3. Jef Wijsen (University of Mons)
BibTeX Citation
@inproceedings{koutris_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Consistent Query Answering for Primary Keys on Rooted Tree Queries}},
url = {https://dl.acm.org/doi/10.1145/3651139},
doi = {10.1145/3651139},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Koutris, Paraschos and Ouyang, Xiating and Wijsen, Jef},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,639 | Circuit Bounds for Conjunctive Queries with Self-joins | 2025 | PODS | 5.093636e-05 |
| 10,650 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS | 5.093636e-05 |
| 11,146 | Computing Range Consistent Answers to Aggregation Queries via Rewriting | 2024 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 20 of 20 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,626 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS |
| 2 | 5,844 | A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join | 2024 | PODS |
| 3 | 5,619 | An Operational Approach to Consistent Query Answering | 2018 | PODS |
| 4 | 12,210 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB |
| 5 | 9,921 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS |
| 6 | 5,258 | Counting Database Repairs under Primary Keys Revisited | 2019 | PODS |
| 7 | 5,773 | Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms | 2018 | PODS |
| 8 | 11,524 | A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys | 2022 | PODS |
| 9 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 10 | 7,558 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS |