<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tags/html/?t=xml+schema+matching">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tags/html/?t=xml+schema+matching]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for xml schema matching]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/600/An-Optimization-Approach-for-Semantic-based-XML-Schema-Matching"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/530/Semantic-based-Optimal-XML-Schema-Matching-A-Mathematical-Programming-Approach"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/600/An-Optimization-Approach-for-Semantic-based-XML-Schema-Matching">
  <title><![CDATA[An Optimization Approach for Semantic-based  XML Schema Matching]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/600/An-Optimization-Approach-for-Semantic-based-XML-Schema-Matching</link>
  <description><![CDATA[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, whi...]]></description>
  <dc:date>2011-01-30</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/530/Semantic-based-Optimal-XML-Schema-Matching-A-Mathematical-Programming-Approach">
  <title><![CDATA[Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/530/Semantic-based-Optimal-XML-Schema-Matching-A-Mathematical-Programming-Approach</link>
  <description><![CDATA[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 pro...]]></description>
  <dc:date>2010-12-28</dc:date>
 </item>
</rdf:RDF>
