First-order query rewriting for inconsistent databases
From MaRDI portal
Publication:882438
DOI10.1016/j.jcss.2006.10.013zbMath1112.68042OpenAlexW2154093507MaRDI QIDQ882438
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
Related Items (14)
On the data complexity of consistent query answering ⋮ On the data complexity of consistent query answering over graph databases ⋮ Consistent query answering via ASP from different perspectives: Theory and practice ⋮ A remark on the complexity of consistent conjunctive query answering under primary key violations ⋮ A dichotomy in the complexity of counting database repairs ⋮ Taming primary key violations to query large inconsistent data via ASP ⋮ On the complexity of sampling query feedback restricted database repair of functional dependency violations ⋮ A three-valued semantics for querying and repairing inconsistent databases ⋮ Probabilistic query answering over inconsistent databases ⋮ Tractable query answering and rewriting under description logic constraints ⋮ Unnamed Item ⋮ Consistent query answering for primary keys in Datalog ⋮ On the complexity and approximability of repair position selection problem ⋮ A dichotomy in the complexity of consistent query answering for queries with two atoms
Cites Work
- Unnamed Item
- Data exchange: semantics and query answering
- Elements of finite model theory.
- Complexity tailored design: a new design methodology for databases with incomplete information.
- Minimal-change integrity maintenance using tuple deletions
- On the Structure of Polynomial Time Reducibility
- Answer sets for consistent query answering in inconsistent databases
This page was built for publication: First-order query rewriting for inconsistent databases
