Computing simple and complex matchings between XML schemas for transforming XML documents

Jun Seung Lee; Kyong Ho Lee

doi:10.1016/j.infsof.2005.12.007

Computing simple and complex matchings between XML schemas for transforming XML documents

Jun Seung Lee, Kyong Ho Lee

College of Computing

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: computing preliminary matching relationships between leaf nodes in the two XML schemas based on proposed ontology and leaf node similarity, and extracting final matchings based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. Furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method performs better than previous methodologies, resulting in a precision of 97% and a recall of 83% on the average.

Original language	English
Pages (from-to)	937-946
Number of pages	10
Journal	Information and Software Technology
Volume	48
Issue number	9
DOIs	https://doi.org/10.1016/j.infsof.2005.12.007
Publication status	Published - 2006 Sept

Bibliographical note

Funding Information:
This work was supported by the Korea Research Foundation Grant (KRF-2003-003-D00429). The preliminary version of this paper was published in Proceedings of the Fifth International Conference on Web Information Systems Engineering (WISE), Brisbane, Australia, 2004.

All Science Journal Classification (ASJC) codes

Software
Information Systems
Computer Science Applications

Access to Document

10.1016/j.infsof.2005.12.007

Cite this

@article{56fc7caadd124613859e67e9a5690dad,

title = "Computing simple and complex matchings between XML schemas for transforming XML documents",

abstract = "This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: computing preliminary matching relationships between leaf nodes in the two XML schemas based on proposed ontology and leaf node similarity, and extracting final matchings based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. Furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method performs better than previous methodologies, resulting in a precision of 97% and a recall of 83% on the average.",

author = "Lee, {Jun Seung} and Lee, {Kyong Ho}",

note = "Funding Information: This work was supported by the Korea Research Foundation Grant (KRF-2003-003-D00429). The preliminary version of this paper was published in Proceedings of the Fifth International Conference on Web Information Systems Engineering (WISE), Brisbane, Australia, 2004. ",

year = "2006",

month = sep,

doi = "10.1016/j.infsof.2005.12.007",

language = "English",

volume = "48",

pages = "937--946",

journal = "Information and Software Technology",

issn = "0950-5849",

publisher = "Elsevier",

number = "9",

}

TY - JOUR

T1 - Computing simple and complex matchings between XML schemas for transforming XML documents

AU - Lee, Jun Seung

AU - Lee, Kyong Ho

N1 - Funding Information: This work was supported by the Korea Research Foundation Grant (KRF-2003-003-D00429). The preliminary version of this paper was published in Proceedings of the Fifth International Conference on Web Information Systems Engineering (WISE), Brisbane, Australia, 2004.

PY - 2006/9

Y1 - 2006/9

N2 - This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: computing preliminary matching relationships between leaf nodes in the two XML schemas based on proposed ontology and leaf node similarity, and extracting final matchings based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. Furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method performs better than previous methodologies, resulting in a precision of 97% and a recall of 83% on the average.

AB - This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: computing preliminary matching relationships between leaf nodes in the two XML schemas based on proposed ontology and leaf node similarity, and extracting final matchings based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. Furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method performs better than previous methodologies, resulting in a precision of 97% and a recall of 83% on the average.

UR - http://www.scopus.com/inward/record.url?scp=33746206437&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746206437&partnerID=8YFLogxK

U2 - 10.1016/j.infsof.2005.12.007

DO - 10.1016/j.infsof.2005.12.007

M3 - Article

AN - SCOPUS:33746206437

SN - 0950-5849

VL - 48

SP - 937

EP - 946

JO - Information and Software Technology

JF - Information and Software Technology

IS - 9

ER -

Computing simple and complex matchings between XML schemas for transforming XML documents

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this