Please use this identifier to cite or link to this item:
|Title:||XML application schema matching using similarity measure and relaxation labeling|
|Authors:||Yi, S. |
|Citation:||Yi, S., Huang, B., Chan, W.T. (2005-01-06). XML application schema matching using similarity measure and relaxation labeling. Information Sciences 169 (1-2) : 27-46. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ins.2004.02.013|
|Abstract:||Information integration for distributed and heterogeneous data sources is still an open challenging, and schema matching is critical in this process. This paper presents an approach to automatic elements matching between XML application schemas using similarity measure and relaxation labeling. The semantic modeling of XML application schema has also been presented. The similarity measure method considers element categories and their properties. In an effort to achieve an optimal matching, contextual constraints are used in the relaxation labeling method. Based on the semantic modeling of XML application schemas, the compatible constraint coefficients are devised in terms of the structures and semantic relationships as defined in the semantic model. To examine the effectiveness of the proposed methods, an algorithm for XML schema matching has been developed, and corresponding computational experiments show that the proposed approach has a high degree of accuracy. © 2004 Elsevier Inc. All rights reserved.|
|Source Title:||Information Sciences|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2018
WEB OF SCIENCETM
checked on Nov 27, 2018
checked on Nov 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.