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

Jun Seung Lee, Kyong Ho Lee

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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
Issue number9
Publication statusPublished - 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


Dive into the research topics of 'Computing simple and complex matchings between XML schemas for transforming XML documents'. Together they form a unique fingerprint.

Cite this