Containment of Conjunctive Queries with Safe Negation

  • Fang Wei
  • Georg Lausen
Conference paper

DOI: 10.1007/3-540-36285-1_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2572)
Cite this paper as:
Wei F., Lausen G. (2003) Containment of Conjunctive Queries with Safe Negation. In: Calvanese D., Lenzerini M., Motwani R. (eds) Database Theory — ICDT 2003. ICDT 2003. Lecture Notes in Computer Science, vol 2572. Springer, Berlin, Heidelberg

Abstract

We consider the problem of query containment for conjunctive queries with safe negated subgoals (CQ⌝s). We propose a new method for the containment test of CQ⌝s. Comparing to the previous known approach, which always requires an exponential number of canonical databases to be verified to prove that Q1Q2, the algorithm proposed in this paper exploits the containment mappings of their positive counterparts, and terminates once the specified test succeeds. We show that in the worst case, the algorithm has the same performance as the one proposed in previous work. We also extend our algorithm to unions of CQ⌝s in a natural way. Due to the close relation between query containment and answering queries using views, we give some notes on considering answering queries using views when both queries and views have safe negated subgoals.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Fang Wei
    • 1
  • Georg Lausen
    • 1
  1. 1.University of Freiburg, Institute for Computer ScienceGermany

Personalised recommendations