A remark on the complexity of consistent conjunctive query answering under primary key violations

DOI10.1016/J.IPL.2010.07.021zbMATH Open1379.68115OpenAlexW2030164201MaRDI QIDQ1675764FDOQ1675764

Jef Wijsen

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.07.021

zbMATH Keywords

databasesconsistent query answeringdatabase repairing

Mathematics Subject Classification ID

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

Cites Work

• Elements of finite model theory.
• Minimal-change integrity maintenance using tuple deletions
• First-order query rewriting for inconsistent databases

Cited In (3)

• On the data complexity of consistent query answering
• A dichotomy in the complexity of consistent query answering for queries with two atoms
• A dichotomy in the complexity of counting database repairs

This page was built for publication: A remark on the complexity of consistent conjunctive query answering under primary key violations

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