Sciweavers

ERSHOV
2009
Springer

On the Containment Problem for Queries in Conjunctive Form with Negation

13 years 10 months ago
On the Containment Problem for Queries in Conjunctive Form with Negation
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containment relation is given. Using this condition a class of queries is emphasized and a characterization of containment problem for this class using certain maximal sets is specified. The time complexity of containment problem for this class of queries is studied.
Victor Felea
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ERSHOV
Authors Victor Felea
Comments (0)