Consistent query answering for self-join-free conjunctive queries under primary key constraints

DOI10.1145/3068334MaRDI QIDQ5012578zbMATH OpenOpenAlexFDO

Authors Paraschos Koutris, Jef Wijsen

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3068334

zbMATH Keywords

attack graphcomplexity dichotomyconjunctive queriesconsistent query answeringprimary keys

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A remark on the complexity of consistent conjunctive query answering under primary key violations
• A survey of the data complexity of consistent query answering under key constraints
• Consistent query answering for primary keys in Datalog
• The Complexity of Counting Problems Over Incomplete Databases
• A dichotomy in the complexity of counting database repairs

Cited in

(9)

• A remark on the complexity of consistent conjunctive query answering under primary key violations
• Consistent query answering for primary keys in Datalog
• A dichotomy in the complexity of counting database repairs
• Uniform Reliability of Self-Join-Free Conjunctive Queries
• A formal framework for probabilistic unclean databases
• Consistent query answering for primary keys in logspace
• A survey of the data complexity of consistent query answering under key constraints
• A simple algorithm for consistent query answering under primary keys
• Approximately counting answers to conjunctive queries with disequalities and negations

This page was built for publication: Consistent query answering for self-join-free conjunctive queries under primary key constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012578)