21 search results - page 3 / 5 » The complexity of query containment in expressive fragments ... |
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
XSYM
2007
Springer
14 years 1 months ago
2007
Springer
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
PLANX
2007
13 years 8 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...