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
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
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
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A remark on the complexity of consistent conjunctive query answering under primary key violations
Information Processing Letters
Proceedings of the 4th International Workshop on Logic in Databases
On the tractability and intractability of consistent conjunctive query answering
Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Certain conjunctive query answering in first-order logic
ACM Transactions on Database Systems (TODS)
Certain conjunctive query answering in SQL
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Charting the tractability frontier of certain conjunctive query answering
Proceedings of the 32nd symposium on Principles of database systems
A dichotomy in the complexity of counting database repairs
Journal of Computer and System Sciences
Efficient querying of inconsistent databases with binary integer programming
Proceedings of the VLDB Endowment
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
This article deals with the computation of consistent answers to queries on relational databases that violate primary key constraints. A repair of such inconsistent database is obtained by selecting a maximal number of tuples from each relation without ever selecting two distinct tuples that agree on the primary key. We are interested in the following problem: Given a Boolean conjunctive query q, compute a Boolean first-order (FO) query @j such that for every database db, @j evaluates to true on db if and only if q evaluates to true on every repair of db. Such @j is called a consistent FO rewriting of q. We use novel techniques to characterize classes of queries that have a consistent FO rewriting. In this way, we are able to extend previously known classes and discover new ones. Finally, we use an Ehrenfeucht-Fraisse game to show the non-existence of a consistent FO rewriting for @?x@?y(R(x@?,y)@?R(y@?,c)), where c is a constant and the first coordinate of R is the primary key.