DMCA
Abstract
Cached
Download Links
- [korban.nres.uiuc.edu]
- [www.deg.byu.edu]
- [tango.byu.edu]
- [dithers.cs.byu.edu]
- [www.dfki.de]
- [drrc.lbl.gov]
- [arxiv.org]
- [arxiv.org]
- [www.dissertations.wsu.edu]
- [research.libraries.wsu.edu:8443]
- [www.deg.byu.edu]
- [www.comp.nus.edu.sg]
- [www.deg.byu.edu]
- [osm7.cs.byu.edu]
- [www.cs.unc.edu]
- [www.cs.ucla.edu]
- [www.cs.ucla.edu]
- [www.hsw-basel.ch]
- [www.cis.umassd.edu]
- [www.cis.umassd.edu]
- [papers.nips.cc]
- [www4.ncsu.edu]
- [www4.ncsu.edu]
| Citations: | 2 - 1 self |
BibTeX
@MISC{Xu_abstract,
author = {Li Xu and David W. Embley},
title = {Abstract},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely match directly. Thus, to complete the task of schema mapping, we must also compute indirect matches. In this paper, we present a composite approach for generating a source-totarget mapping that contains both direct and many indirect matches between a source schema and a target schema. Recognizing expected-data values associated with schema elements and applying schema-structure heuristics are the key ideas needed to compute indirect matches. Experiments we have conducted over several real-world application domains show encouraging results, yielding about 90 % precision and recall measures for both direct and indirect matches. 1
Keyphrases
indirect match schema mapping many indirect match source-totarget mapping composite approach encouraging result several real-world application source schema key idea schema element direct match schema mapping focus previous approach recall measure target schema schema-structure heuristic expected-data value
