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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00423398
Contributor : Vincent Quint <>
Submitted on : Friday, October 9, 2009 - 5:12:25 PM
Last modification on : Tuesday, February 12, 2019 - 10:30:05 AM
Long-term archiving on : Tuesday, June 15, 2010 - 9:51:48 PM

File

JYVD-DocEng2003.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

275

Files downloads

253