Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach

Simple item page
dc.contributor.authorKim, Jaewook
dc.contributor.authorPeng, Yun
dc.contributor.authorIvezik, Nenad
dc.contributor.authorShin, Junho
dc.date.accessioned2018-11-20T17:12:28Z
dc.date.available2018-11-20T17:12:28Z
dc.date.issued2010-12-28
dc.descriptionThe Proceedings of International Conference on E-business, Management and Economicsen_US
dc.description.abstractWe 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_US
dc.description.sponsorshipThis work was supported in part by NIST award 70NANB9H9145.en_US
dc.description.urihttps://ebiquity.umbc.edu/paper/html/id/530/Semantic-based-Optimal-XML-Schema-Matching-A-Mathematical-Programming-Approachen_US
dc.format.extent7 pagesen_US
dc.genreconference papers and proceedings preprintsen_US
dc.identifierdoi:10.13016/M25Q4RQ7V
dc.identifier.urihttp://hdl.handle.net/11603/12066
dc.language.isoen_USen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department Collection
dc.relation.ispartofUMBC Faculty Collection
dc.rightsThis 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.rightsPublic Domain Mark 1.0*
dc.rightsThis 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.urihttp://creativecommons.org/publicdomain/mark/1.0/*
dc.subjectE-businessen_US
dc.subjectXML schema matchingen_US
dc.subjectoptimizationen_US
dc.subjectmaximum weighted bipartite graphen_US
dc.subjectsemantic similarityen_US
dc.subjectinteger programmingen_US
dc.subjectdynamic programmingen_US
dc.subjectUMBC Ebiquity Research Groupen_US
dc.titleSemantic-based Optimal XML Schema Matching: A Mathematical Programming Approachen_US
dc.typeTexten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
556.pd.pdf
Size:
420.08 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.56 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

UMBC Computer Science and Electrical Engineering Department
UMBC Faculty Collection