A simple algorithm for consistent query answering under primary keys

DOI10.46298/LMCS-21(1:18)2025MaRDI QIDQ7016769zbMATH OpenFDO

Authors Diego Figueira, Luc Segoufin, Cristina Sirangelo

Publication date 6 March 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(1:18)2025

zbMATH Keywords

conjunctive queriesconsistent query answeringprimary keys

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A dichotomy in the complexity of consistent query answering for queries with two atoms
• A remark on the complexity of consistent conjunctive query answering under primary key violations
• A simple algorithm for consistent query answering under primary keys
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Consistent query answering for primary keys in Datalog
• Consistent query answering for self-join-free conjunctive queries under primary key constraints
• First-order query rewriting for inconsistent databases
• Minimal-change integrity maintenance using tuple deletions

This page was built for publication: A simple algorithm for consistent query answering under primary keys

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