Sciweavers

2 search results - page 1 / 1
» On the complexity of XPath containment in the presence of di...
Sort
View
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 4 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
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 problem for various frag...
Frank Neven, Thomas Schwentick
ICDT
2003
ACM
125views Database» more  ICDT 2003»
13 years 10 months ago
XPath Containment in the Presence of Disjunction, DTDs, and Variables
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 problem for various fragm...
Frank Neven, Thomas Schwentick