Abstract
In this paper, we consider conjunctive queries with built-in predicates of the form X < Y, X ≤ Y, X = Y, or X ⊋ Y, where X and Y are variables or constants from a totally ordered domain. We present a sufficient and necessary condition to test containment among these kinds of queries. Klug [8] left the problem open for the case when the domain is nondense, like the integers. Ullman [11] gave only a sufficient condition for the containment of conjunctive queries with built-in predicates and integer variables. Our test is based in a method that uses a new idea: the representation of an infinite number of databases by a finite set of, what we call, canonical databases, that use variables that denote uninterpreted constants.
This work was partially supported by CICYT grant TEL96-1390-C02 and by NSF grant HRD-9628450.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, Y. Sagiv, and J.D. Ullman. “Equivalence of Relational Expressions”. SIAM J. of Computing 8:2, pp. 218–246.
A.V. Aho, Y. Sagiv, and J.D. Ullman. “Efficient Optimization of a Class of Relational Queries”. ACM TODS 4:4, pp. 435–454.
Brisaboa, N.R., “Inclusión de Consultas Conjuntivas en la semántica de bolsas”, Ph.D. Dissertation, Departamento de Computación, Facultade de Informática, Universidade da Coruña, A Coruña, Spain, May 1997.
Brisaboa, N.R., Hernández, H.J. Testing bag-containment of conjunctive queries, Acta Informatica, 34, 1997. Springer-Verlag, Munich, Germany,pp. 557–578.
A.K. Chandra and P.M. Merlin. “Optimal implementation of conjunctive queries in relational databases”. Proc. of 9th ACM Symposium on Theory of Computing, New York, NY, 1977, pp. 77–90.
S. Chaudhuri, M Vardi. “Optimization of Real Conjunctive Queries,” Proc. Twelfth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Washington, DC, May 1993, pp. 59–70.
O. Ibarra, J. Su. “On the containment and equivalence of database queries with linear constraints”. PODS’97, Tucson, Arizona, 1997, pp. 32–43.
Klug, A., “On conjunctive queries containing inequalities,” J. ACM 35:1, 1988, pp. 146–160.
J. W. Lloyd. Foundations of Logic Programming, Second, Extended edition, Springer-Verlag 1987.
Ullman, J. D.: Principles of Database Systems, Second Edition, Computer Science Press, 1982.
Ullman, J. D.: Principles of Database and Knowledge-base Systems, Vols. 1–2, Computer Science Press, 1988–1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brisaboa, N.R., Hernández, H.J., Paramá, J.R., Penabad, M.R. (1998). Containment of conjunctive queries with built-in predicates with variables and constants over any ordered domain. In: Litwin, W., Morzy, T., Vossen, G. (eds) Advances in Databases and Information Systems. ADBIS 1998. Lecture Notes in Computer Science, vol 1475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057716
Download citation
DOI: https://doi.org/10.1007/BFb0057716
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64924-3
Online ISBN: 978-3-540-68309-4
eBook Packages: Springer Book Archive