On the containment problem for queries in conjunctive form with negation. (English)
Pnueli, Amir (ed.) et al., Perspectives of systems informatics. 7th international Andrei Ershov memorial conference, PSI 2009, Novosibirsk, Russia, June 15‒19, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11485-4/pbk). Lecture Notes in Computer Science 5947, 110-123 (2010).
Summary: 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.
Start
Contact
Print
General Help
