论文部分内容阅读
The problem of document rewriting is a fundamental problem in active XML(AXML) data exchange and usually has a higher complexity.Prior work was focused on string automaton theory.This paper tries to solve it by using tree automaton.More precisely, the paper firstly defines a new tree automaton, active XML tree automaton (AXTA),which can efficiently represent the set of AXML documents produced by an AXML document or AXML document schema.And then, an algorithm for constructing AXTA automaton is also proposed.Finally, a polynomial time(PTIME) determining algorithm for AXML document rewriting is presented based on AXTA automaton.