La re´ecriture et l’´evaluation de requˆetes arbres avec XPath Rewriting and Evaluating Tree Queries with XPath

Given any dag t representing a fully or partially compressed XML document, we present a method for evaluating any positive unary query expressed in terms of Core XPath axes, on

We relate the hybrid composition language HCL(L) to positive quantifier free FO-queries over L, and its fragment without variable sharing in compositions HCL − (L) to unions of

si association noeud courant //fonction tous les noeuds fonction descendant du noeud courant... XPath

//year Selects all year nodes in all the children of the current node cardset//year Selects all year nodes that are descendant of cardset Let us try with another element such as

showed that the satisfiability of PDL formulas extended with arbitrary path negation (such a logic is denoted PDL ¬ ) is undecidable [20], which already implies the undecidability

This study proposes an algorithm for transforming XPath expressions according to schema evolution, assuming that a schema monotonically increases (no element can be deleted from

The Paisley embedded domain-specific language (EDSL) and library adds the more declarative style of pattern matching to the object-oriented context of Java programming [9,10]1.

The fragmentation of the XML tree is done so that in each compute-node we include one subtree of the data tree. Each subtree is rooted in some data node u and all its leaves are