Sciweavers

93 search results - page 2 / 19
» XPath: (P)DL on Trees
Sort
View
AMW
2011
12 years 9 months ago
A Direct Translation from XPath to Nondeterministic Automata
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
Nadime Francis, Claire David, Leonid Libkin
PLANX
2007
13 years 6 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
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...
Pierre Genevès, Nabil Layaïda, Alan Sc...
WIA
2005
Springer
13 years 10 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 5 months ago
XPath, transitive closure logic, and nested tree walking automata
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...
Balder ten Cate, Luc Segoufin
ICDE
2007
IEEE
132views Database» more  ICDE 2007»
14 years 6 months ago
XPlainer: Visual Explanations of XPath Queries
The popularity of XML has motivated the development of novel XML processing tools many of which embed the XPath language for XML querying, transformation, constraint specification...
Mariano P. Consens, John W. S. Liu, Flavio Rizzolo