Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
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
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
ConQuer: efficient management of inconsistent databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Minimal-change integrity maintenance using tuple deletions
Information and Computation
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
First-order query rewriting for inconsistent databases
Journal of Computer and System Sciences
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the consistent rewriting of conjunctive queries under primary key constraints
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
First-order query rewriting for inconsistent databases
ICDT'05 Proceedings of the 10th international conference on Database Theory
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
On the consistent rewriting of conjunctive queries under primary key constraints
Information Systems
Querying and repairing inconsistent numerical databases
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploiting conflict structures in inconsistent databases
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Consistent answers to boolean aggregate queries under aggregate constraints
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Range-consistent answers of aggregate queries under aggregate constraints
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
Conflict-aware historical data fusion
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Certain conjunctive query answering in first-order logic
ACM Transactions on Database Systems (TODS)
Probabilistic query answering over inconsistent databases
Annals of Mathematics and Artificial Intelligence
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a maximum number of tuples from db without ever selecting two tuples that agree on their primary key. For a Boolean conjunctive query q, we are interested in the following question: does there exist a Boolean first-order query &phis; such that for every database db, &phis; evaluates to true on db if and only if q evaluates to true on every repair of db? We address this problem for acyclic conjunctive queries in which no relation name occurs more than once. Our results improve previous solutions that are based on Fuxman-Miller join graphs.