Abstract
Schema Matching aims at finding the semantic correspondence of concepts between different data sources. Solving such match problems is a key task in numerous application fields, particularly to support data exchange, and all kinds of data integration. Researchers have proposed a number of matching methods in order to identify and discover such semantic correspondence across the XML data. In this paper, we propose the XML schema matching approach based on top-k mapping. We first calculate similarity of XML node elements and structure, then get the similarity matrix, respectively. Such similarity matrix could not distinguish the correct and incorrect mapping effectively. So we present the k best schema mapping, in an iterative process, to identify useful matching. Our experiment demonstrate the approach of the schema matching using top-k mapping have a better performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
