ABSTRACT
An uncertain database is defined as a relational database in which primary keys need not be satisfied. A repair (or possible world) of such database is obtained by selecting a maximal number of tuples without ever selecting two distinct tuples with the same primary key value. For a Boolean query q, the decision problem CERTAINTY(q) takes as input an uncertain database db and asks whether q is satisfied by every repair of db. Our main focus is on acyclic Boolean conjunctive queries without self-join. Previous work has introduced the notion of (directed) attack graph of such queries, and has proved that CERTAINTY(q) is first-order expressible if and only if the attack graph of q is acyclic. The current paper investigates the boundary between tractability and intractability of CERTAINTY(q). We first classify cycles in attack graphs as either weak or strong, and then prove among others the following. If the attack graph of a query q contains a strong cycle, then CERTAINTY(q) is coNP-complete. If the attack graph of q contains no strong cycle and every weak cycle is terminal (i.e., no edge leads from a vertex in the cycle to a vertex outside the cycle), then CERTAINTY(q) is in P. We then partially address the only remaining open case, i.e., when the attack graph contains some nonterminal cycle and no strong cycle. Finally, we establish a relationship between the complexities of CERTAINTY(q) and evaluating q on probabilistic databases.
- M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In V. Vianu and C. H. Papadimitriou, editors, 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
- L. E. Bertossi. Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011. Google Scholar
Digital Library
- M. Bienvenu. On the complexity of consistent query answering in the presence of simple ontologies. In J. Hoffmann and B. Selman, editors, AAAI. AAAI Press, 2012.Google Scholar
- D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. Artif. Intell., 195:335--360, 2013. 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. Ré, and D. Suciu. Probabilistic databases: diamonds in the dirt. Commun. ACM, 52(7):86--94, 2009. Google Scholar
Digital Library
- N. N. Dalvi, C. Re, and D. Suciu. Queries and materialized views on probabilistic databases. J. Comput. Syst. Sci., 77(3):473--490, 2011. Google Scholar
Digital Library
- A. Fuxman and R. J. Miller. First-order query rewriting for inconsistent databases. In T. Eiter and L. Libkin, editors, ICDT, volume 3363 of Lecture Notes in Computer Science, pages 337--351. Springer, 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
- P. G. Kolaitis and E. Pema. A dichotomy in the complexity of consistent query answering for queries with two atoms. Inf. Process. Lett., 112(3):77--85, 2012. Google Scholar
Digital Library
- P. Koutris and D. Suciu. A dichotomy on the complexity of consistent query answering for atoms with simple keys. CoRR, abs/1212.6636, 2012.Google Scholar
- R. E. Ladner. On the structure of polynomial time reducibility. J. ACM, 22(1):155--171, 1975. Google Scholar
Digital Library
- D. Maslowski and J. Wijsen. A dichotomy in the complexity of counting database repairs. Journal of Computer and System Sciences, 2013. Google Scholar
Digital Library
- G. J. Minty. On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory, Ser. B, 28(3):284--304, 1980.Google Scholar
- E. Pema. Personal communication, 2013.Google Scholar
- D. Suciu, D. Olteanu, C. Ré, and C. Koch. Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011. 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. Inf. Syst., 34(7):578--601, 2009. Google Scholar
Digital Library
- J. Wijsen. On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. In J. Paredaens and D. V. Gucht, editors, PODS, pages 179--190. ACM, 2010. Google Scholar
Digital Library
- J. Wijsen. A remark on the complexity of consistent conjunctive query answering under primary key violations. Inf. Process. Lett., 110(21):950--955, 2010. Google Scholar
Digital Library
- J. Wijsen. Certain conjunctive query answering in first-order logic. ACM Trans. Database Syst., 37(2):9, 2012. Google Scholar
Digital Library
Index Terms
Charting the tractability frontier of certain conjunctive query answering
Recommendations
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 ...
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsA 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 ...






Comments