Algorithm for Rewriting Active XML Schema
Hao Zhong-xiao · 2009
The problem of schema rewriting is a fundamental problem of Active XML(AXML for short) data exchange and usually has a higher complexity.We defined an extended tree automaton,AXML schema tree automaton(ASTA),which can efficiently describe the set of all AXML documents that conform to the given schema.Then based on ASTA automata,we proposed an algorithm performed in polynomial time for deciding whether one AXML schema can rewrite into the other one.Finally,the experimental results prove that our algorithm for checking AXML schema rewriting can be more efficiency than existing algorithm.