ABSTRACT
A natural way for capturing uncertainty in the relational data model is by having relations that violate their primary key constraint, that is, relations in which distinct tuples agree on the primary key. 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, CERTAINTY(q) is the problem that 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 AC0).
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, 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.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In L. Liu, A. Reuter, K.-Y. Whang, and J. Zhang, editors, ICDE, page 30. IEEE Computer Society, 2006. Google Scholar
Digital Library
- M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68--79. ACM Press, 1999. Google Scholar
Digital Library
- C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):479--513, 1983. Google Scholar
Digital Library
- J. Chomicki and J. Marcinkowski. Minimal change integrity maintenance using tuple deletions. Inf. Comput., 197(1-2):90--121, 2005. Google Scholar
Digital Library
- N. N. Dalvi, C. Re, and D. Suciu. Probabilistic databases: diamonds in the dirt. Commun. ACM, 52(7):86--94, 2009. Google Scholar
Digital Library
- N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB J., 16(4):523--544, 2007. Google Scholar
Digital Library
- R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89--124, 2005. Google Scholar
Digital Library
- A. Fuxman, E. Fazli, and R. J. Miller. Conquer: Efficient management of inconsistent databases. In F. Ozcan, editor, SIGMOD Conference, pages 155--166. ACM, 2005. Google Scholar
Digital Library
- A. Fuxman and R. J. Miller. First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci., 73(4):610--635, 2007. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci., 64(3):579--627, 2002.Google Scholar
Digital Library
- L. Grieco, D. Lembo, R. Rosati, and M. Ruzzi. Consistent query answering under key and exclusion dependencies: algorithms and experiments. In O. Herzog, H.-J. Schek, N. Fuhr, A. Chowdhury, and W. Teiken, editors, CIKM, pages 792--799. ACM, 2005. Google Scholar
Digital Library
- J. Huang, L. Antova, C. Koch, and D. Olteanu. Maybms: a probabilistic database management system. In U. Cetintemel, S. B. Zdonik, D. Kossmann, and N. Tatbul, editors, SIGMOD Conference, pages 1071--1074. ACM, 2009. Google Scholar
Digital Library
- D. Lembo, R. Rosati, and M. Ruzzi. On the first-order reducibility of unions of conjunctive queries over inconsistent databases. In T. Grust, H. Hopfner, A. Illarramendi, S. Jablonski, M. Mesiti, S. Muller, P.-L. Patranjan, K.-U. Sattler, M. Spiliopoulou, and J. Wijsen, editors, EDBT Workshops, volume 4254 of Lecture Notes in Computer Science, pages 358--374. Springer, 2006. Google Scholar
Digital Library
- L. Libkin. Elements of Finite Model Theory. Springer, 2004. Google Scholar
Digital Library
- D. Maier. The Theory of Relational Databases. Computer Science Press, 1983. Google Scholar
Digital Library
- J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, 1988. Google Scholar
Digital Library
- J. Wijsen. On the consistent rewriting of conjunctive queries under primary key constraints. In M. Arenas and M. I. Schwartzbach, editors, DBPL, volume 4797 of Lecture Notes in Computer Science, pages 112--126. Springer, 2007. Google Scholar
Digital Library
- J. Wijsen. Consistent query answering under primary keys: a characterization of tractable queries. In R. Fagin, editor, ICDT, volume 361 of ACM International Conference Proceeding Series, pages 42--52. ACM, 2009. Google Scholar
Digital Library
- J. Wijsen. On the consistent rewriting of conjunctive queries under primary key constraints. Inf. Syst., 34(7):578--601, 2009. Google Scholar
Digital Library
Index Terms
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases
Recommendations
Optimization of Answer Set Programs for Consistent Query Answering by Means of First-Order Rewriting
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge ManagementConsistent Query Answering (CQA) with respect to primary keys is the following problem. Given a database instance that is possibly inconsistent with respect to its primary key constraints, define a repair as an inclusion-maximal consistent subinstance. ...
Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
Invited Paper from SIGMOD 2015, Invited Paper from PODS 2015 and Regular PapersA relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a maximal number of tuples without ever selecting two distinct tuples with ...
Certain conjunctive query answering in first-order logic
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 ...






Comments