Hubie Chen
ABSTRACT
Query containment is the fundamental problem of deciding, given two database queries, if the result of the first query is always contained in the result of the second query. For a number of established query classes, an instance of this problem can be decided by computing a set of models of the first query, and then evaluating the second query on each of the models. We formalize this phenomenon by introducing the selfish models property; this property gives an avenue for establishing both the decidability of and complexity upper bounds for containment problems. Using this property, we show how existing results can be uniformly derived, and we present two significant novel positive results for first-order query containment problems, exhibiting complexity upper bounds for containment problems that were not previously known to be decidable.
- S. Abiteboul, R. Hull, and V. Vianu. 1995. Foundations of Databases .Addison-Wesley. Google Scholar
Digital Library
- Manuel Bodirsky and Jan Kára. 2010. The complexity of temporal constraint satisfaction problems. J. ACM, Vol. 57, 2 (2010). Google ScholarDigital Library
- Manuel Bodirsky, H. Dugald Macpherson, and Johan Thapper. 2013. Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log., Vol. 14, 4 (2013), 30:1--30:19. Google ScholarDigital Library
- Simone Bova and Hubie Chen. 2014. The Complexity of Width Minimization for Existential Positive Queries. In ICDT . 235--244.Google Scholar
- Simone Bova and Hubie Chen. 2015. The complexity of equivalence, entailment, and minimization in existential positive logic. J. Comput. Syst. Sci., Vol. 81, 2 (2015), 443--457.Google ScholarDigital Library
- Simone Bova and Fabio Mogavero. 2017. Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20--23, 2017 . 1--12. Google ScholarDigital Library
- Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. 2003. View-based query containment. In Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9--12, 2003, San Diego, CA, USA. 56--67. Google ScholarDigital Library
- Ashok K. Chandra and Philip M. Merlin. 1977. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In Proceddings of STOC'77. 77--90. Google ScholarDigital Library
- Hubie Chen. 2014. On the complexity of existential positive queries. ACM Trans. Comput. Log., Vol. 15, 1 (2014).Google ScholarDigital Library
- Hubie Chen. 2017. The Tractability Frontier of Graph-Like First-Order Query Sets. J. ACM, Vol. 64, 4 (2017), 26:1--26:29. Google ScholarDigital Library
- Hubie Chen and V'ictor Dalmau. 2016. Decomposing Quantified Conjunctive (or Disjunctive) Formulas. SIAM J. Comput., Vol. 45, 6 (2016), 2066--2086.Google ScholarDigital Library
- Hubie Chen and Martin Grohe. 2010. Constraint Satisfaction with Succinctly Specified Relations. J. Comput. System Sci., Vol. 76, 8 (2010), 847--860. Google ScholarDigital Library
- Hubie Chen, Florent R. Madelaine, and Barnaby Martin. 2015. Quantified Constraints and Containment Problems. Logical Methods in Computer Science, Vol. 11, 3 (2015).Google Scholar
- Hubie Chen and Dániel Marx. 2013. Block-Sorted Quantified Conjunctive Queries. In ICALP . Google ScholarDigital Library
- Hubie Chen and Stefan Mengel. 2015. A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. In 18th International Conference on Database Theory, ICDT 2015, March 23--27, 2015, Brussels, Belgium. 110--126.Google Scholar
- Hubie Chen and Stefan Mengel. 2016. Counting Answers to Existential Positive Queries: A Complexity Classification. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems . 315--326.Google ScholarDigital Library
- Hubie Chen and Stefan Mengel. 2017. The logic of counting query answers. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20--23, 2017 . 1--12. Google ScholarDigital Library
- Hubie Chen and Moritz Mü ller. 2015. The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space. TOCT, Vol. 7, 2 (2015), 7. Google ScholarDigital Library
- Hubie Chen and Moritz Mü ller. 2017a. One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. ACM Trans. Comput. Log., Vol. 18, 4 (2017), 29:1--29:37. Google ScholarDigital Library
- Hubie Chen and Moritz Mü ller. 2017b. The Parameterized Space Complexity of Embedding Along a Path. Theory Comput. Syst., Vol. 61, 3 (2017), 851--870. Google ScholarDigital Library
- J. Flum and M. Grohe. 2006. Parameterized Complexity Theory .Springer.Google Scholar
- Martin Grohe. 2007. The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM, Vol. 54, 1 (2007).Google ScholarDigital Library
- Shawn Hedman. 2004. A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity (Oxford Texts in Logic) .Oxford University Press, Inc., New York, NY, USA.Google Scholar
- Maurizio Lenzerini. 2002. Data Integration: A Theoretical Perspective. In Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3--5, Madison, Wisconsin, USA. 233--246. Google ScholarDigital Library
- Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, and Divesh Srivastava. 1995. Answering Queries Using Views. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22--25, 1995, San Jose, California, USA. 95--104. Google ScholarDigital Library
- Dá niel Marx. 2013. Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. J. ACM, Vol. 60, 6 (2013), 42. Google ScholarDigital Library
- C.H. Papadimitriou. 1995. Computational Complexity. Addison-Wesley.Google Scholar
- Yehoshua Sagiv and Mihalis Yannakakis. 1980. Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM, Vol. 27, 4 (1980), 633--655. Google ScholarDigital Library
Index Terms
- The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
Recommendations
Decidable containment of recursive queries
Database theoryOne of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query ...
Query containment under bag and bag-set semantics
Conjunctive queries (CQs) are at the core of query languages encountered in many logic-based research fields such as AI, or database systems. The majority of existing work assumes set semantics but often in real applications the manipulation of ...
Containment for Rule-Based Ontology-Mediated Queries
PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsMany efforts have been dedicated to identifying restrictions on ontologies expressed as tuple-generating dependencies (tgds), a.k.a. existential rules, that lead to the decidability of answering ontology-mediated queries (OMQs). This has given rise to ...
Comments