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

Jun Seung Lee, Kyong Ho Lee

Research output: Contribution to journalArticle

4 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 languageEnglish
Pages (from-to)937-946
Number of pages10
JournalInformation and Software Technology
Volume48
Issue number9
DOIs
Publication statusPublished - 2006 Sep 1

Fingerprint

XML
Ontology
Feedback

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Science Applications

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}",
year = "2006",
month = "9",
day = "1",
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",

}

Computing simple and complex matchings between XML schemas for transforming XML documents. / Lee, Jun Seung; Lee, Kyong Ho.

In: Information and Software Technology, Vol. 48, No. 9, 01.09.2006, p. 937-946.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Lee, Jun Seung

AU - Lee, Kyong Ho

PY - 2006/9/1

Y1 - 2006/9/1

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

VL - 48

SP - 937

EP - 946

JO - Information and Software Technology

JF - Information and Software Technology

SN - 0950-5849

IS - 9

ER -