93 search results - page 13 / 19 » XPath: (P)DL on Trees |
ICDE
2004
IEEE
14 years 10 months ago
2004
IEEE
We describe and evaluate a query minimization technique that applies to XQueries, which are nested, perform arbitrary joins, and freely mix bag and set semantics. These features c...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
SIGMOD
2008
ACM
13 years 8 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...