| With the characteristics of self-description, extensibility and openness, XML has become the factual standard of the data representation and exchange in the Web. If the two sides of exchange abide by the same schema criterion it will be easier to share resource and complete the integrate information between them. In fact, the widely application of XML face the problem of disunity of the schemata. So it requires us to find the mapping relationship between the related elements in the two input schemata. And then according to the output mapping one schema can be transformed into another schema.In this thesis, the first work is to study the methods of the schema matching. A schema matching algorithm is presented by comprehensively analyzing the existing methods. And then, aiming at the absence of research on automatically transform between two heterogeneous documents, it is proposed a solution based on algorithm to automate the transformation between them.The tree structure is used as the schema documents storing structure in the algorithm. Ontology is presented to get the exist matching, and can be updated by user when they modify the wrong mapping which the system offered. Furthermore, the ontology can help to realize the 1:n complicated matching. In this thesis, the similarity of two elements depends on two similarity, basic similarity and structural similarity, and the computing method of the structural similarity has been improved. The proposed method consists of two steps: computing preliminary matching relationships between leaf nodes in the two XML schemas and extracting final matches based on proposed structural similarity.In the solution of the automatically transforming between two XML documents, the semantic mapping relationship between two schema elements can be found by using the proposed algorithm. And then according to the result of matching it will automatically create the script of XSLT. Finally, it will complete the transformation by using the XSLT engine. |
PDF Full Text Request