NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach
Published
Author(s)
Jaewook Kim, Yun Peng, Nenad Ivezic, Jun H. Shin
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 two XML schemas 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.
Proceedings Title
2010 International Conference on E-business, Management and Economics
Kim, J.
, Peng, Y.
, Ivezic, N.
and Shin, J.
(2011),
Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach, 2010 International Conference on E-business, Management and Economics , Hong Kong, -1, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=907376
(Accessed October 14, 2025)