First-order query rewriting for inconsistent databases

DOI10.1016/J.JCSS.2006.10.013MaRDI QIDQ882438zbMATH OpenOpenAlexFDO

Authors Ariel Fuxman, Renée J. Miller

Publication date 23 May 2007

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2006.10.013

zbMATH Keywords

uncertain dataconsistent query answeringinconsistent data

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15)

Recommendations

• Database Theory - ICDT 2005
• scientific article; zbMATH DE number 1696773
• scientific article; zbMATH DE number 1696846
• Probabilistic query answering over inconsistent databases
• Answer sets for consistent query answering in inconsistent databases

Cites work

• scientific article; zbMATH DE number 1182735 (Why is no real title available?)
• Answer sets for consistent query answering in inconsistent databases
• Complexity tailored design: a new design methodology for databases with incomplete information.
• Data exchange: semantics and query answering
• Elements of finite model theory.
• Minimal-change integrity maintenance using tuple deletions
• On the Structure of Polynomial Time Reducibility

Cited in

(22)

• Consistent query answering via ASP from different perspectives: theory and practice
• scientific article; zbMATH DE number 1696845 (Why is no real title available?)
• On the data complexity of consistent query answering
• A simple algorithm for consistent query answering under primary keys
• A dichotomy in the complexity of consistent query answering for queries with two atoms
• Tractable query answering and rewriting under description logic constraints
• Probabilistic query answering over inconsistent databases
• Database Theory - ICDT 2005
• A remark on the complexity of consistent conjunctive query answering under primary key violations
• Consistent query answering for primary keys in Datalog
• First-order queries on databases embedded in an infinite structure
• A SAT-based system for consistent query answering
• On the complexity of sampling query feedback restricted database repair of functional dependency violations
• On the data complexity of consistent query answering over graph databases
• scientific article; zbMATH DE number 1696846 (Why is no real title available?)
• scientific article; zbMATH DE number 7561483 (Why is no real title available?)
• A three-valued semantics for querying and repairing inconsistent databases
• Corrections to: ``On the data complexity of consistent query answering over graph databases
• First-order under-approximations of consistent query answers
• A dichotomy in the complexity of counting database repairs
• Taming primary key violations to query large inconsistent data via ASP
• On the complexity and approximability of repair position selection problem

This page was built for publication: First-order query rewriting for inconsistent databases

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