Abstract
Testing containment of conjunctive queries is the question whether for any such queries Q1,Q2, for any database instance D, the set of answers of one query is contained in the set of answers of the other. In this paper, we first introduce into the general approach for testing for the case, when both queries do not contain negation. Based on these techniques we discuss the question for the case of queries with negation. We propose a new method and compare with the currently known approach. Instead of always testing the exponential number of possible canonical databases, our algorithm will terminate once a certain canonical database is constructed. However, in the worst case, still an exponential number of canonical databases has to be checked.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and O. M. Duschka. Complexity of answering queries using materialized views. In ACM Symp. on Principles of Database Systems (PODS), 1998.
A. K. Chandra and P. M. Merlin. Optimal implementations of conjunctive queries in relational data bases. In ACM Symp. on Theory of Computing (STOC), pages 77–90. 1977.
O. M. Duschka and A. Y. Levy. Recursive plans for information gathering. In International Joint Conference on Artificial Intelligence (IJCAI), pages 778–784, 1997.
S. Flesca and S. Greco. Rewriting queries using views. In TKDE, 13(6), 2001.
D. Florescu, A. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In ACM Symp. on Principles of Database Systems (PODS). 1998.
A. Gupta, Y. Sagiv, J. D. Ullman, and J. Widom. Constraint checking with partial information. In ACM Symp. on Principles of Database Systems (PODS). 1994.
A. Halevy. Answering queries using views: A survey. In VLDB Journal, 10:4, pp. 270–294, 2001.
A. Klug. On conjunctive queries containing inequalities. In Journal of the ACM35:1, pp. 146–160, 1988.
A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In ACM Symp. on Principles of Database Systems (PODS). 1995.
A. Levy and Y. Sagiv. Queries independent of updates. In International Conference on Very Large Data Bases (VLDB), 1993.
A. Levy and D. Suciu. Deciding containment for queries with complex objects. In ACM Symp. on Principles of Database Systems (PODS). ACM Press, 1997.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operations. Journal of the ACM, (4), 27(4):633–655, 1980.
J. Ullman. Principles of Database and KnowledgeBase Systems, Volume II. 1989.
J. Ullman. Principles of Database Systems — Lecture Notes. http://www.dbstanford.edu/ullman/cs345-notes.html..
J. D. Ullman. Information integration using logical views. In International Conference on Database Theory (ICDT), 1997.
X. Zhang and Z. Meral Özsoyoglu. On efficient reasoning with implication constraints. In DOOD, pages 236–252, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lausen, G., Wei, F. (2003). On the Containment of Conjunctive Queries. In: Klein, R., Six, HW., Wegner, L. (eds) Computer Science in Perspective. Lecture Notes in Computer Science, vol 2598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36477-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-36477-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00579-7
Online ISBN: 978-3-540-36477-1
eBook Packages: Springer Book Archive