XML Schema Ontology Matching for Automated Data Transformation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The exchange of data between systems with different XML schemas often requires postprocessing due to structural conflicts, leading to inefficiencies and the need for manual transformation instructions, which can be cumbersome and error-prone.
Innovation Solution
A system and method for matching elements of an XML schema to entity groups of an ontology, allowing for automated transformation by identifying corresponding elements and relations, thereby facilitating data exchange between systems with different data models.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If manual transformation instructions are used to map elements between different XML schemas, then data exchange between systems with different data models is enabled, but the process becomes cumbersome and error-prone
Solution Approach 1:
The system enables automated self-matching of schema elements to ontology entities without requiring manual intervention. The correspondence test automatically compares element identifiers, synonyms, and semantic relationships to determine matches, eliminating the need for manual transformation instructions while maintaining adaptability across different data models
Solution Approach 2:
The patent introduces an ontology as an intermediary layer between different XML schemas. This ontology serves as a semantic mediator that both schemas can reference, allowing automated inference of correspondence relationships. The ontology entities act as intermediaries that bridge the semantic gap between heterogeneous data models without requiring direct manual mapping
2Productivity
If automated matching is implemented without semantic information, then processing speed increases, but the accuracy of element correspondence decreases
Solution Approach 1:
The system transforms the matching process from simple string comparison to multi-parameter semantic analysis. It evaluates multiple parameters including element identifiers, synonyms, ontology entity relationships, and correspondence test results. This parameter enrichment maintains high processing speed through automated computation while significantly improving matching accuracy by considering semantic context
Solution Approach 2:
The correspondence test implements a feedback mechanism where the system continuously evaluates potential matches against ontology constraints and semantic relationships. The matching process receives feedback from ontology structure validation, synonym matching results, and correspondence confidence scores, allowing iterative refinement of matches to ensure high accuracy while maintaining automated processing
3Reliability
If all potential element matches are evaluated, then comprehensive coverage is achieved, but the number of comparisons increases significantly
Solution Approach 1:
The patent segments the matching process into hierarchical levels: first matching top-level schema elements to ontology entities, then recursively matching child elements to subordinate entities. This segmentation allows the system to evaluate only relevant subsets of potential matches at each level, achieving comprehensive coverage through structured decomposition while reducing overall comparison complexity
Solution Approach 2:
The system performs preliminary filtering by pre-loading ontology structures, pre-computing synonym relationships, and pre-establishing element hierarchies before the actual matching process. This preliminary preparation enables the correspondence test to quickly eliminate non-matching candidates and focus computational resources only on plausible matches, maintaining reliability while reducing processing time
Data Source
AI summary
A matching system stores an element of schema that is identifiable with a child node of a parent node of a tree. An entity group of ontology includes a subclass of a class of further entity group matching to a parent element identifiable with the parent node is stored. An access unit accesses the element of the schema and the entity group of the ontology. A match unit matches the elements of the schema to the entity groups of the ontology when the elements correspond to the entity groups according to a correspondence test.