Sciweavers

93 search results - page 7 / 19
» XPath: (P)DL on Trees
Sort
View
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 6 months ago
Forward-XPath and extended register automata on data-trees
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...
Diego Figueira
PODS
2006
ACM
88views Database» more  PODS 2006»
14 years 9 months ago
Structural characterizations of the semantics of XPath as navigation tool on a document
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...
Marc Gyssens, Jan Paredaens, Dirk Van Gucht, Georg...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 9 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 8 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 9 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner