The Rewriting Of Optimization AXML Research And Application In Plan Scheduling

With the rapid development of Internet, especially the widespread use of Web services technology and e-commerce, XML as a self-described and semi-structured data model has become the new standards of Web data representation and exchange. More and more information processing system uses XML documents as the vector of information storage, exchange and dissemination. XML types of data have become the mainstream of data form. Because of XML, and Web services, distribution information on the network becomes very easy. XML and Web services have been the information resource standard of valuable and able to update dynamically. The rapid expansion of these standards inevitably has lead to a new generation of XML document generation,namely the XML document Active XML(AXML) document.AXML is defined as a Distributed Information Management Language, an XML extension. Its main idea is to embed XML documents in Web Services calls to realize the dynamic access to Web Services resources, but it is still valid XML document phraseological. An AXML document contains two kinds of information that came out directly in the document data is called "explicit data" and in Web Services invoking is referred to as "hidden data". Since the introduction of the embedded Web Services in XML document there is an increase in the dynamic and flexible aspects. However, it also brings many new problems, such as documentation rewrite, AXML document queries, documents including and termination of service calls and so on.This paper combines the characteristics of tree automata, analyzes and researches the current rewriting approach to solve XML. According to the relevant standard of Web Services, the approach based on tree automata techniques is proposed to solve AXML rewriting. The method defines an AXML document as a tree, and function nodes or data nodes in AXML document or model as the state nodes in tree automata. Accordiing to the state nodes with the function label node, by the algorithm test, it is to see if the document or mode rewritten can completely accord with the target mode to effectively realize AXML complete rewriting. This paper describes the algorithm by using the example of program scheduling.Finally, we test the algorithm involved in the paper. Experimental results show that the tree automata technology can effectively solve the problem AXML documents rewritten completely, and the proposed new method is superior to traditional methods in performance.