Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

ERSHOV
2009
Springer

favoriteEmaildiscussreport

174views Theoretical Computer Science» more ERSHOV 2009»

On the Containment Problem for Queries in Conjunctive Form with Negation

13 years 11 months ago

On the Containment Problem for Queries in Conjunctive Form with Negation

Download thor.info.uaic.ro

Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and suﬃcient 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 speciﬁed. The time complexity of containment problem for this class of queries is studied.

Victor Felea

Real-time Traffic

Conjunctive Queries | Containment | Containment Problem | ERSHOV 2009 | Programming Languages |

claim paper

Related Content

» Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Nega...

» On Containment of Conjunctive Queries with Negation

» Containment of Conjunctive Queries with Negation Algorithms and Experiments

» Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns

» Query languages for data exchange beyond unions of conjunctive queries

» Query Containment for Data Integration Systems

» The containment problem for REAL conjunctive queries with inequalities

» Containment of Conjunctive Object MetaQueries

» Containment of Conjunctive Queries over Databases with Null Values

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ERSHOV
Authors	Victor Felea

Comments (0)