{'fraction_non_alphanumeric': 0.01935483870967742, 'fraction_numerical': 0.0, 'mean_word_length': 5.1655629139072845, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Novel Method for XML Scheme Matching

XML Schema is becoming a critical technology for e-business applications and the emergence of web services. With its widespread adoption and its web accessibility, XML Schema matching is becoming imperative. This paper presents an approach to elements matching between two XML Schemas using similarity measure and constraint optimization. In our method, we first transform the schema matching problem into a tree matching problem by transforming schemas to be matched into labeled (including node label and edge label) trees. The similarity measure considers element categories and properties. In order to get an optimal matching, we compute the structural similarity value based on the neighbors of each element (ancestor, children, and sibling). We test our method experimentally on three groups of XML Schemas. The experiments show that the proposed method has a high degree of accuracy.