Sciweavers

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

13

DBPL
2007
Springer

favoriteEmaildiscussreport

119views Database» more DBPL 2007»

Conjunctive Query Containment over Trees

13 years 10 months ago

Conjunctive Query Containment over Trees

Download lrb.cs.uni-dortmund.de

Abstract. The complexity of containment and satisﬁability of conjunctive queries over ﬁnite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, their transitive and reﬂexive closures, and Following. For the containment problem a trichotomy is presented, classifying the problems as in PTIME, coNP-complete, or ΠP 2 -complete. For the satisﬁability problem most problems are classiﬁed as either in PTIME or NP-complete.

Henrik Björklund, Wim Martens, Thomas Schwent

Real-time Traffic

Axes Child | Conjunctive Queries | Containment | DBPL 2007 |

claim paper

Related Content

» Containment of Conjunctive Queries over Databases with Null Values

» Containment of Conjunctive Queries over Conceptual Schemata

» Containment of Conjunctive Object MetaQueries

» Conjunctive Query Containment under Access Limitations

» Conjunctive Queries over Trees

» On the Decidability of Containment of Recursive Datalog Queries Preliminary report

» Query Containment for Data Integration Systems

» Rewriting Unions of General Conjunctive Queries Using Views

» The Complexity of Acyclic Conjunctive Queries

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	DBPL
Authors	Henrik Björklund, Wim Martens, Thomas Schwentick

Comments (0)