An algorithm for checking termination of Active XML documents materialization

Introducing Web services into XML documents, Active XML (AXML for short) brings more flexibility and dynamics, but also some new problems. Termination of materializing AXML documents is such a problem to XML documents and is undecidable in general case. This paper develope the termination problem of AXML documents materialization and propose algorithms running polynomial time to solve it under some restricts for AXML schema definitions. The main idea of our algorithm is to decide the termination problem by building corresponding AXML schema dependent graph and checking the acyclic of the graph. Finally, the correctness of the algorithm is also proved.