An efficient schema matching approach using previous mapping result set

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The widespread adoption of eXtensible Markup Language pushed a growing number of researchers to design XML specific Schema Matching approaches, aiming at finding the semantic correspondence of concepts between different data sources. In the latest years, there has been a growing need for developing high performance matching systems in order to identify and discover such semantic correspondence across XML data. XML schema matching methods face several challenges in the form of definition, utilization, and combination of element similarity measures. In this paper, we propose the XML schema matching framework based on previous mapping result set (PMRS). We first parse XML schemas as schema trees and extract schema feature. Then we construct PMRS as the auxiliary information and conduct the retrieving algorithm based on PMRS. To cope with complex matching discovery, we compute the similarity among XML schemas semantic information carried by XML data. Our experimental results demonstrate the performance benefits of the schema matching framework using PMRS.

Cite

CITATION STYLE

APA

Fan, H., Liu, J., Luo, W., & Deng, K. (2016). An efficient schema matching approach using previous mapping result set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9645, pp. 285–293). Springer Verlag. https://doi.org/10.1007/978-3-319-32055-7_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free