A general procedure to check conjunctive query containment

Abstract. In this paper, we present a general procedure to test conjunctive query containment. We divide the containment problem into four categories, taking into account the underlying semantics (set or bag theoretic) and the presence or absence of built-in predicates in the queries.After a brief review of previous work on conjunctive query containment, we present a new procedure, called QCC (Query Containment Checker), which we show to be a general and uniform procedure to check the containment among conjunctive queries under the four categories mentioned above. We briefly describe the use of QCC to check bag containment of conjunctive queries, and explain in detail how to use QCC to check set containment of conjunctive queries with built-in predicates. In our conclusions, we point out some uses of QCC for other types of containment.

[1]  Wei Sun,et al.  Solving satisfiability and implication problems in database systems , 1996, TODS.

[2]  Oscar H. Ibarra,et al.  On the containment and equivalence of database queries with linear constraints (extended abstract) , 1997, PODS '97.

[3]  Randy H. Katz,et al.  An extended relational algebra with control over duplicate elimination , 1982, PODS.

[4]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[5]  Surajit Chaudhuri,et al.  Optimization of real conjunctive queries , 1993, PODS '93.

[6]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[7]  Martin K. Solomon Some properties of relational expressions , 1979, ACM-SE 17.

[8]  Nieves R. Brisaboa,et al.  Testing bag-containment of conjunctive queries , 1997, Acta Informatica.

[9]  Z. Meral Özsoyoglu,et al.  On Efficient Reasoning with Implication Constraints , 1993, DOOD.

[10]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[11]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[12]  Raghu Ramakrishnan,et al.  Containment of conjunctive queries: beyond relations as sets , 1995, TODS.

[13]  Anthony C. Klug On conjunctive queries containing inequalities , 1988, JACM.

[14]  Letizia Tanca,et al.  What you Always Wanted to Know About Datalog (And Never Dared to Ask) , 1989, IEEE Trans. Knowl. Data Eng..

[15]  José R. Paramá,et al.  Containment of Conjunctive Queries with Built-in Predicates with Variables and Constants over any Ordered Domain , 1998, Symposium on Advances in Databases and Information Systems.

[16]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[17]  Ron van der Meyden The Complexity of Querying Indefinite Data about Linearly Ordered Domains , 1997, J. Comput. Syst. Sci..

[18]  Generalized Containment of Conjunctive Queries , 2022 .

[19]  Ronald Fagin,et al.  Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[20]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .