XML schema matching based on incremental ontology update

Jun Seung Lee, Kyong Ho Lee

Research output: Chapter in Book/Report/Conference proceedingChapter

6 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
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsXiaofang Zhou, Maria E. Orlowska, Stanley Su, Mike P. Papazoglou, Keith G. Jeffery
PublisherSpringer Verlag
Pages608-618
Number of pages11
ISBN (Electronic)3540238948, 9783540238942
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3306
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'XML schema matching based on incremental ontology update'. Together they form a unique fingerprint.

Cite this