Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).

View the beta site
NIST logo

Publication Citation: An Optimization Approach for Semantic-based XML Schema Matching

NIST Authors in Bold

Author(s): Jaewook Kim; Yun Peng; Nenad Ivezic; Jun H. Shin;
Title: An Optimization Approach for Semantic-based XML Schema Matching
Published: May 16, 2013
Abstract: We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching leaf nodes between two XML schema trees by reducing the tree-to-tree matching problem to simpler problems of path-to-path, node-to-node, and word-to-word matching. We formulate these matching problems as maximum-weighted bipartite graph matching problems with different constraints, which are solved by different mathematical programming techniques, including integer programming and dynamic programming. Solutions to simpler problems provide weights for the next stage until the optimal tree-to-tree matching solution is obtained. The effectiveness of this approach has been verified and demonstrated by computer experiments.
Citation: International Journal of Trade Economics and Finance
Keywords: E-business, XML schema matching, maximum-weighted bipartite graph, semantic similarity, mathematical programming
Research Areas: Supply Chain, Systems Integration
PDF version: PDF Document Click here to retrieve PDF version of paper (447KB)