Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach
| dc.contributor.author | Kim, Jaewook | |
| dc.contributor.author | Peng, Yun | |
| dc.contributor.author | Ivezik, Nenad | |
| dc.contributor.author | Shin, Junho | |
| dc.date.accessioned | 2018-11-20T17:12:28Z | |
| dc.date.available | 2018-11-20T17:12:28Z | |
| dc.date.issued | 2010-12-28 | |
| dc.description | The Proceedings of International Conference on E-business, Management and Economics | en |
| dc.description.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-topath, 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. | en |
| dc.description.sponsorship | This work was supported in part by NIST award 70NANB9H9145. | en |
| dc.description.uri | https://ebiquity.umbc.edu/paper/html/id/530/Semantic-based-Optimal-XML-Schema-Matching-A-Mathematical-Programming-Approach | en |
| dc.format.extent | 7 pages | en |
| dc.genre | conference papers and proceedings preprints | en |
| dc.identifier | doi:10.13016/M25Q4RQ7V | |
| dc.identifier.uri | http://hdl.handle.net/11603/12066 | |
| dc.language.iso | en | en |
| dc.relation.isAvailableAt | The University of Maryland, Baltimore County (UMBC) | |
| dc.relation.ispartof | UMBC Computer Science and Electrical Engineering Department Collection | |
| dc.relation.ispartof | UMBC Faculty Collection | |
| dc.rights | Public Domain Mark 1.0 | * |
| dc.rights | This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author. | |
| dc.rights | This work was written as part of one of the author's official duties as an Employee of the United States Government and is therefore a work of the United States Government. In accordance with 17 U.S.C. 105, no copyright protection is available for such works under U.S. Law. | |
| dc.rights.uri | http://creativecommons.org/publicdomain/mark/1.0/ | * |
| dc.subject | E-business | en |
| dc.subject | XML schema matching | en |
| dc.subject | optimization | en |
| dc.subject | maximum weighted bipartite graph | en |
| dc.subject | semantic similarity | en |
| dc.subject | integer programming | en |
| dc.subject | dynamic programming | en |
| dc.subject | UMBC Ebiquity Research Group | en |
| dc.title | Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach | en |
| dc.type | Text | en |