Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
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
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Theory of Relational Databases
Theory of Relational Databases
Consistent query answering under key and exclusion dependencies: algorithms and experiments
Proceedings of the 14th ACM international conference on Information and knowledge management
Clean Answers over Dirty Databases: A Probabilistic Approach
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Algorithms
First-order query rewriting for inconsistent databases
Journal of Computer and System Sciences
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Consistent query answering under primary keys: a characterization of tractable queries
Proceedings of the 12th International Conference on Database Theory
Probabilistic databases: diamonds in the dirt
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
MayBMS: a probabilistic database management system
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On the consistent rewriting of conjunctive queries under primary key constraints
Information Systems
Minimal-change integrity maintenance using tuple deletions
Information and Computation
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
Queries and materialized views on probabilistic databases
Journal of Computer and System Sciences
Proceedings of the 4th International Workshop on Logic in Databases
A dichotomy in the complexity of consistent query answering for queries with two atoms
Information Processing Letters
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
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
Hi-index | 0.00 |
Primary key violations provide a natural means for modeling uncertainty in the relational data model. A repair (or possible world) of a database is then obtained by selecting a maximal number of tuples without ever selecting two distinct tuples that have the same primary key value. For a Boolean query q, the problem CERTAINTY(q) takes as input a database db and asks whether q evaluates to true on every repair of db. We are interested in determining queries q for which CERTAINTY(q) is first-order expressible (and hence in the low complexity class AC°). For queries q in the class of conjunctive queries without self-join, we provide a necessary syntactic condition for first-order expressibility of CERTAINTY(q). For acyclic queries (in the sense of Beeri et al. [1983]), this necessary condition is also a sufficient condition. So we obtain a decision procedure for first-order expressibility of CERTAINTY(q) when q is acyclic and without self-join. We also show that if CERTAINTY(q) is first-order expressible, its first-order definition, commonly called certain first-order rewriting, can be constructed in a rather straightforward way.