Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Logical Framework for Querying and Repairing Inconsistent Databases
IEEE Transactions on Knowledge and Data Engineering
Computing consistent query answers using conflict hypergraphs
Proceedings of the thirteenth ACM international conference on Information and knowledge management
ConQuer: efficient management of inconsistent databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Consistent query answering under key and exclusion dependencies: algorithms and experiments
Proceedings of the 14th ACM international conference on Information and knowledge management
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Logic programs for consistently querying data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Query rewriting and answering under constraints in data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
First-order query rewriting for inconsistent databases
ICDT'05 Proceedings of the 10th international conference on Database Theory
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Consistent query answering under primary keys: a characterization of tractable queries
Proceedings of the 12th International Conference on Database Theory
On the consistent rewriting of conjunctive queries under primary key constraints
Information Systems
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
On the consistent rewriting of conjunctive queries under primary key constraints
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting for inconsistent DL-lite ontologies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Certain conjunctive query answering in first-order logic
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Recent approaches in the research on inconsistent databases have started analyzing the first-order reducibility of consistent query answering, i.e., the possibility of identifying classes of queries whose consistent answers can be obtained by a first-order (FOL) rewriting of the query, which in turn can be easily formulated in SQL and directly evaluated through any relational DBMS. So far, the investigations in this direction have only concerned subsets of conjunctive queries over databases with key dependencies. In this paper we extend the study of first-order reducibility of consistent query answering under key dependencies to more expressive queries, in particular to unions of conjunctive queries. More specifically: (i) we analyze the applicability of known FOL-rewriting techniques for conjunctive queries in the case of unions of conjunctive queries. It turns out that such techniques are applicable only to a very restricted class of unions of conjunctive queries; (ii) to overcome the above limitations, we define a new rewriting method which is specifically tailored for unions of conjunctive queries. The method can be applied only to unions of conjunctive queries that satisfy an acyclicity condition on unions of conjunctive queries.