DBScholar

Back to papers

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)

Paper ID
h183dc60800692df1
Venue
PODS
Year
2024
Pagerank
4.9605343e-05
Overall Rank
11,527 | 22.74%
DOI
10.1145/3651139
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
11,152 Circuit Bounds for Conjunctive Queries with Self-joins 2025 PODS 4.9605343e-05
11,163 Rewriting Consistent Answers on Annotated Data 2025 PODS 4.9605343e-05
11,552 Computing Range Consistent Answers to Aggregation Queries via Rewriting 2024 PODS 4.9605343e-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.

Rank Cited Paper Year Venue Pagerank
33 Consistent Query Answers in Inconsistent Databases 1999 PODS 0.00049435337
639 Answering Conjunctive Queries under Updates 2017 PODS 0.00015289346
1,747 The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints 2015 PODS 9.7180424e-05
2,607 Efficient Querying of Inconsistent Databases with Binary Integer Programming 2013 VLDB 8.2111488e-05
2,610 Database Repairs and Consistent Query Answering: Origins and Further Developments 2019 PODS 8.2035758e-05
4,085 The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries 2016 VLDB 6.7989526e-05
4,769 New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins 2020 PODS 6.4131333e-05
5,401 Counting Database Repairs under Primary Keys Revisited 2019 PODS 6.1336321e-05
5,755 An Operational Approach to Consistent Query Answering 2018 PODS 5.9883541e-05
5,907 Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms 2018 PODS 5.9344171e-05
5,980 A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join 2024 PODS 5.9101677e-05
6,830 Benchmarking Approximate Consistent Query Answering 2021 PODS 5.6548934e-05
7,251 On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases 2010 PODS 5.5584673e-05
7,724 Consistent Query Answering for Primary Keys on Path Queries 2021 PODS 5.4530482e-05
7,890 Uniform Operational Consistent Query Answering 2022 PODS 5.4158859e-05
8,432 Counting Database Repairs Entailing a Query: The Case of Functional Dependencies 2022 PODS 5.3166752e-05
9,339 First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys 2020 PODS 5.1780302e-05
9,697 CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT Solving 2021 SIGMOD 5.1258854e-05
11,751 LinCQA: Faster Consistent Query Answering with Linear Time Guarantees 2023 SIGMOD 4.9605343e-05
11,883 A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys 2022 PODS 4.9605343e-05
Previous Page 1 / 1 Next

Semantically Similar Papers