XPath on Left and Right Sides of Rules: Toward Compact XML Tree Rewriting through Node Patterns - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

XPath on Left and Right Sides of Rules: Toward Compact XML Tree Rewriting through Node Patterns

Résumé

XPath is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many areas ranging from schema specifications, designation and transformation languages to XML query languages. Moreover, researchers have proposed elegant and tractable formal semantics, fostering various works on mathematical properties and theoretical tools. We propose here a novel way to consider XPath, not only for selecting nodes, but also for tree rewriting using rules. In the rule semantics we explore, XPath expressions are used both on the left and on the right side. We believe that this proposal opens new perspectives toward building highly concise XML transformation languages on widely accepted basis.
Fichier principal
Vignette du fichier
JYVD-DocEng2003.pdf (217.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00423398 , version 1 (09-10-2009)

Identifiants

Citer

Jean-Yves Vion-Dury. XPath on Left and Right Sides of Rules: Toward Compact XML Tree Rewriting through Node Patterns. Proceedings of the 2003 ACM Symposium on Document Engineering, DocEng2003, Nov 2003, Grenoble, France. pp.19-25, ⟨10.1145/958220.958225⟩. ⟨inria-00423398⟩

Collections

INRIA INRIA2
119 Consultations
275 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More