Complexity of repair checking and consistent query answering

DOI10.4230/LIPICS.ICDT.2016.21MaRDI QIDQ5276202zbMATH OpenFDO

Authors Sebastian Arming, Reinhard Pichler, Emanuel Sallinger

Publication date 14 July 2017

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2016.21

zbMATH Keywords

complexityconsistent query answeringinconsistency

Mathematics Subject Classification ID

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

Recommendations

• On the data complexity of consistent query answering
• Database Programming Languages
• Advances in Databases and Information Systems
• On the data complexity of consistent query answering over graph databases
• On the data complexity of consistent query answering over graph databases

Cited in

(13)

• On the data complexity of consistent query answering over graph databases
• Consistency checking and querying in probabilistic databases under integrity constraints
• On the data complexity of consistent query answering
• Sampling query feedback restricted repairs of functional dependency violations: complexity and algorithm
• Why is it hard to obtain a dichotomy for consistent query answering?
• scientific article; zbMATH DE number 1953144 (Why is no real title available?)
• Prioritized repairing and consistent query answering in relational databases
• Why is it hard to obtain a dichotomy for consistent query answering?
• Database Programming Languages
• On the data complexity of consistent query answering over graph databases
• On the Complexity of Finding Set Repairs for Data-Graphs
• Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)
• On the complexity of sampling query feedback restricted database repair of functional dependency violations

This page was built for publication: Complexity of repair checking and consistent query answering

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