.png){kind=icon}
Return
Computing simple and complex matchings between XML schemas for transforming XML documents
.png){kind=icon}
PRE
AI
DOI：10.1016/j.infsof.2005.12.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
XML
schema matching
dynamic ontology
complex matching
simple matching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
3.8K
Citations:
7.7K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave no more
no more