An Tentative Study Of XML Semantic Verification Algorthm And Its Application

In recent years, the application of XML has being covered more and more fields. Nevertheless, the effective management of the enormous and various XML data is still under research. Among all this research projects, the verification of XML data model functioned as a prerequisite guarantees the following process. So, the research of verifying XML data algorithm turns out to be a significant research topic.XML (extensible Markup Language), being the accurate standard of the decoding data in the virtual Internet/Intranet, has been applied to a variety of other settings. One major objective of XML technology application is to facilitate the exchange of information. Apparently, only the XML formats or structures match each other can this objective be achieved. XML Schema, which is the model describing the information structure, can be adopted to verify the legality of the XML contents. However, much complex logic is still out of verification with this method. Based on the verification of XML data, this paper aims to further study the data verification algorithm.Due to XML advantages of further expansion and clear structure, nowadays, it is applied to various settings extensively. Moreover, on the basis of XML data model and its principles, a large number of studies on the data verification algorithm have been conducted; a brand-new data verification algorithm is expected to verify the schema (type, scope and format) as well as the more complex logic verification. This brand-new method constitutes a more comprehensive verification system; meanwhile it maintains the functions of stable self-repairing and sound scalability. In all, it can be transferred into other fields and achieves the widespread applications.