Team mostrare

Overall Objectives
Scientific Foundations
Application Domains
New Results
Contracts and Grants with Industry
Other Grants and Activities

Section: Scientific Foundations

Modeling XML document transformations

Participants : Guillaume Bagan, Iovka Boneva, Anne-Cécile Caron, Olivier Gauwin, Benoît Groz, Joachim Niehren, Yves Roos, Sławek Staworko, Sophie Tison.

XML document transformations can be defined in W3C standards languages XQuery or XSLT . Programming XML transformations in these languages is often difficult and error prone even if the schemata of input and output documents are known. Advanced programming experience and considerable programming time may be necessary, that are not available in Web services or similar scenarios.

Alternatives programming language for defining XML transformations have been proposed by the programming language community, for instance XDuce [38] , Xtatic [36] , [41] , and CDuce [25] , [26] , [28] . The type systems of these languages simplify the programming tasks considerably. But of course, they don't solve the general difficulty in programming XML transformations manually.

Languages for defining node selection queries arise as sub-language of all XML transformation languages. The W3C standards use XPath for defining monadic queries, while XDuce and CDuce rely on regular queries defined by regular pattern equivalent to tree automata. Indeed, it is natural to look at node selection as a simple form of tree transformation. Monadic node selection queries correspond to deterministic transformations that annotate all selected nodes positively and all others negatively. N-ary node selection queries become non-deterministic transformations, yielding trees annotated by Boolean vectors.

After extensive studies of node selection queries in trees (in XPath and many other languages) the XML community has started more recently to formally investigate XML tree transformations. The expressiveness and complexity of XQuery are studied in [40] , [49] . Type preservation is another problem, i.e., whether all trees of the input type get transformed into the output type, or vice versa, whether the inverse image of the output type is contained in the input type [44] , [42] .

The automata community usually approaches tree transformations by tree transducers [34] , i.e., tree automata producing output structure. Macro tree transducers, for instance, have been proposed recently for defining XML transformations [42] . From the view point of logic, tree transducers have been studied for MSO definability [35] .


Logo Inria