Complexity tailored design: a new design methodology for databases with incomplete information
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logical approaches to incomplete information: a survey
Logics for databases and information systems
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
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
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
Minimal-change integrity maintenance using tuple deletions
Information and Computation
ConQuer: efficient management of inconsistent databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Consistent query answering under key and exclusion dependencies: algorithms and experiments
Proceedings of the 14th ACM international conference on Information and knowledge management
Consistent query answering in databases
ACM SIGMOD Record
Magic Sets and their application to data integration
Journal of Computer and System Sciences
Interactive source registration in community-oriented information integration
Proceedings of the VLDB Endowment
Consistent query answering under primary keys: a characterization of tractable queries
Proceedings of the 12th International Conference on Database Theory
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the consistent rewriting of conjunctive queries under primary key constraints
Information Systems
SPARQL graph pattern rewriting for OWL-DL inference queries
Knowledge and Information Systems
Consistent query answers in the presence of universal constraints
Information Systems
The trichotomy of HAVING queries on a probabilistic database
The VLDB Journal — The International Journal on Very Large Data Bases
Consistent query answering over description logic ontologies
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Querying and repairing inconsistent databases under three-valued semantics
ICLP'07 Proceedings of the 23rd international conference on Logic programming
On the consistent rewriting of conjunctive queries under primary key constraints
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Efficient evaluation of HAVING queries on a probabilistic database
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Logic in databases: report on the LID 2008 workshop
ACM SIGMOD Record
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
ICDT'07 Proceedings of the 11th international conference on Database Theory
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
On the first-order reducibility of unions of conjunctive queries over inconsistent databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Project-Join-Repair: an approach to consistent query answering under functional dependencies
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Certain conjunctive query answering in first-order logic
ACM Transactions on Database Systems (TODS)
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
Probabilistic query answering over inconsistent databases
Annals of Mathematics and Artificial Intelligence
Charting the tractability frontier of certain conjunctive query answering
Proceedings of the 32nd symposium on Principles of database systems
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate on sets of constraints that consist of key dependencies. Most of the existing work has focused on identifying intractable cases of this problem. In contrast, in this paper we give an algorithm that computes the consistent answers for a large and practical class of conjunctive queries. Given a query q, the algorithm returns a first-order query Q (called a query rewriting) such that for every (potentially inconsistent) database I, the consistent answers for q can be obtained by evaluating Q directly on I.