A survey of the data complexity of consistent query answering under key constraints

DOI10.1007/978-3-319-04939-7_2MaRDI QIDQ5404949zbMATH OpenOpenAlexFDO

Authors Jef Wijsen

Publication date 31 March 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04939-7_2

Mathematics Subject Classification ID

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

Recommendations

• Consistent query answering for self-join-free conjunctive queries under primary key constraints
• A remark on the complexity of consistent conjunctive query answering under primary key violations
• A dichotomy in the complexity of counting database repairs
• Consistent query answering for primary keys in Datalog
• On the data complexity of consistent query answering over graph databases

Cited in

(8)

• A remark on the complexity of consistent conjunctive query answering under primary key violations
• Consistent query answering for self-join-free conjunctive queries under primary key constraints
• Consistent query answering for primary keys in Datalog
• On the complexity of inconsistency measurement
• scientific article; zbMATH DE number 7561483 (Why is no real title available?)
• First-order under-approximations of consistent query answers
• Consistency checking and querying in probabilistic databases under integrity constraints
• A dichotomy in the complexity of counting database repairs

This page was built for publication: A survey of the data complexity of consistent query answering under key constraints

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