XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns

Authors:
Jean-Yves Vion-Dury
Affiliations:
INRIA Rhône-Alpes, Montbonnot, France
Venue:
Proceedings of the 2003 ACM symposium on Document engineering
Year:
2003

Citing 3
Cited 0

Containment and equivalence for an XPath fragment

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A formal semantics of patterns in XSLT and XPath

Markup Languages
XPath Containment in the Presence of Disjunction, DTDs, and Variables

ICDT '03 Proceedings of the 9th International Conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

XPath [3, 5] 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 [8, 9, 10, 14], fostering various works on mathematical properties and theoretical tools [10, 13, 12, 14].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 (noted p,p') are used both on the left and on the right side (i.e. rules have the form p → p'). We believe that this proposal opens new perspectives toward building highly concise XML transformation languages on widely accepted basis.