Sciweavers

CORR
2006
Springer
122views Education» more  CORR 2006»
14 years 14 days 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