19 search results - page 2 / 4 » Alternating Automata on Data Trees and XPath Satisfiability |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
PODS
2009
ACM
14 years 7 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...
LICS
2005
IEEE
14 years 28 days ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
DOCENG
2006
ACM
14 years 1 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
ADBIS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...