XML schema matching based on incremental ontology update

Jun Seung Lee, Kyong Ho Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Schema matching is important as a prerequisite to the transformation of XML documents with different schemas. This paper presents a schema matching algorithm based on a dynamic ontology. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed based on the ontology and a proposed leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, unlike static ontologies of previous works, the proposed ontology is updated by user feedback for a sophisticated schema matching. Furthermore, since the ontology can describe various relationships such as IsA or PartOf, the method can compute not only simple matchings but also complex matchings. Experimental results with various XML schemas show that the proposed method is superior to previous works.

Original languageEnglish
Pages (from-to)608-618
Number of pages11
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3306
Publication statusPublished - 2004 Dec 1

Fingerprint

Schema Matching
XML Schema
XML
Ontology
Update
Schema
Leaves
Matching Algorithm
Vertex of a graph
Feedback
Path
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{da83841bd8be4e39971e93fd0293490e,
title = "XML schema matching based on incremental ontology update",
abstract = "Schema matching is important as a prerequisite to the transformation of XML documents with different schemas. This paper presents a schema matching algorithm based on a dynamic ontology. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed based on the ontology and a proposed leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, unlike static ontologies of previous works, the proposed ontology is updated by user feedback for a sophisticated schema matching. Furthermore, since the ontology can describe various relationships such as IsA or PartOf, the method can compute not only simple matchings but also complex matchings. Experimental results with various XML schemas show that the proposed method is superior to previous works.",
author = "Lee, {Jun Seung} and Lee, {Kyong Ho}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3306",
pages = "608--618",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - XML schema matching based on incremental ontology update

AU - Lee, Jun Seung

AU - Lee, Kyong Ho

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Schema matching is important as a prerequisite to the transformation of XML documents with different schemas. This paper presents a schema matching algorithm based on a dynamic ontology. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed based on the ontology and a proposed leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, unlike static ontologies of previous works, the proposed ontology is updated by user feedback for a sophisticated schema matching. Furthermore, since the ontology can describe various relationships such as IsA or PartOf, the method can compute not only simple matchings but also complex matchings. Experimental results with various XML schemas show that the proposed method is superior to previous works.

AB - Schema matching is important as a prerequisite to the transformation of XML documents with different schemas. This paper presents a schema matching algorithm based on a dynamic ontology. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed based on the ontology and a proposed leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, unlike static ontologies of previous works, the proposed ontology is updated by user feedback for a sophisticated schema matching. Furthermore, since the ontology can describe various relationships such as IsA or PartOf, the method can compute not only simple matchings but also complex matchings. Experimental results with various XML schemas show that the proposed method is superior to previous works.

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

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

M3 - Article

VL - 3306

SP - 608

EP - 618

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -