Jun 14, 2006 · Title:On the complexity of XPath containment in the presence of disjunction, DTDs, and variables ... Abstract: XPath is a simple language for ...
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment ...
Jul 26, 2006 · Table 3: The complexity of containment in the presence of variables. ... XPath containment in the presence of disjunction, DTDs, and variables.
Dec 16, 2002 · The focus in this paper is on the complexity of the containment problem for various fragments of XPath. In addition to the basic operations ...
A finer analysis of the problem of determining, given a query p in an XPath fragment and a DTD D, whether or not there exists an XML document T such that T ...
Abstract. XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the com-.
On the complexity of XPath containment in the presence of ...
archive.org › details › arxiv-cs0606065
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment.
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment ...
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment ...
An almost complete classification of the complexity of the containment problem for various fragments of XPath w.r.t. these fragments is established.