An Algorithm Of XML Schema Matching And Its Application In Heterogeneous Information Integration

XML is the de facto standard of the data and information exchange in distributed environment. Schema matching plays an important role in many application domains, such as schema integration, data warehouses, e-commerce and data integration and so on. However, a large number of existed schemas are heterogeneous due to the variety of schema representation and complexity of schema type. Accordingly, XML applications are also suffering from unconsistence of schemas. So it is necessary to map schemas.This paper focuses on the XML schema matching problem, and proposed an XML schema matching algorithm based on synthesized similarity. The algorithm is put forward based on tree structure of XML document and referring to schema-related information such as XML schema, started with computing basic similarity and structure similarity of leaf node and non-leaf node in the XML schema tree separately, and then computing synthesized similarity, finally a triple set is obtained which contain pairs of nodes matched and their synthesized similarity. The mappings are able to be determined according to the relationships between the synthesized similarity degree and the pre-definition the threshold value. The algorithm of creating integrated XML schema is also presented which is used for automatic integrating schemas. In order to improve the efficiency of schema matching, an algorithm of the judgement and choice of source schema is proposed, which helps to filter the schema irrelevant to the domain or practically impossible matching before the matching starts.The algorithm of XML schema matching proposed in this paper can be employed in integrating heterogeneous information into an unified XML document, which shows that it is effective based on theoretical analysis and practical examples.