9 search results - page 1 / 2 » XPath satisfiability in the presence of DTDs |
PODS
2005
ACM
14 years 4 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
The interaction between recursion in XPATH and recursion in DTDs makes it challenging to answer XPATH queries on XML data that is stored in an RDBMS via schema-based shredding. We...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
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...
ICDT
2010
ACM
14 years 2 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...