On the equivalence of XML patterns

DOI10.1007/3-540-44957-4_77MaRDI QIDQ2767136zbMATH OpenFDO

Authors Peter T. Wood

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44957-4_77

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• Equivalences and optimizations in an expressive XSLT subset
• Complexity of Data Tree Patterns over XML Documents
• Structured document transformations based on XSL
• Containment and equivalence for a fragment of XPath
• Deciding equivalence of top-down XML transformations in polynomial time

Cited in

(5)

• A theoretical foundation of the DSSSL location model
• Equivalences and optimizations in an expressive XSLT subset
• A Rewrite Approach for Pattern Containment
• On the equivalence of distributed systems with queries and communication
• Succinctness of pattern-based schema languages for XML

This page was built for publication: On the equivalence of XML patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767136)