A composite approach to automating direct and indirect schema mappings

Li - Xu, David W. Embley

Research output: Contribution to journalArticle

29 Citations (Scopus)

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-to-target 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.

Original languageEnglish (US)
Pages (from-to)697-732
Number of pages36
JournalInformation Systems
Volume31
Issue number8
DOIs
StatePublished - Dec 2006

Fingerprint

Composite materials
Experiments

Keywords

  • Composite approach
  • Data exchange
  • Data-extraction ontologies
  • Direct and indirect schema matching
  • Schema mapping

ASJC Scopus subject areas

  • Management Information Systems
  • Management of Technology and Innovation
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

A composite approach to automating direct and indirect schema mappings. / Xu, Li -; Embley, David W.

In: Information Systems, Vol. 31, No. 8, 12.2006, p. 697-732.

Research output: Contribution to journalArticle

Xu, Li - ; Embley, David W. / A composite approach to automating direct and indirect schema mappings. In: Information Systems. 2006 ; Vol. 31, No. 8. pp. 697-732.
@article{84fcce31ec4c445bae99a34554f4f946,
title = "A composite approach to automating direct and indirect schema mappings",
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-to-target 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.",
keywords = "Composite approach, Data exchange, Data-extraction ontologies, Direct and indirect schema matching, Schema mapping",
author = "Xu, {Li -} and Embley, {David W.}",
year = "2006",
month = "12",
doi = "10.1016/j.is.2005.01.003",
language = "English (US)",
volume = "31",
pages = "697--732",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",
number = "8",

}

TY - JOUR

T1 - A composite approach to automating direct and indirect schema mappings

AU - Xu, Li -

AU - Embley, David W.

PY - 2006/12

Y1 - 2006/12

N2 - 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-to-target 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.

AB - 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-to-target 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.

KW - Composite approach

KW - Data exchange

KW - Data-extraction ontologies

KW - Direct and indirect schema matching

KW - Schema mapping

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

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

U2 - 10.1016/j.is.2005.01.003

DO - 10.1016/j.is.2005.01.003

M3 - Article

AN - SCOPUS:33748694106

VL - 31

SP - 697

EP - 732

JO - Information Systems

JF - Information Systems

SN - 0306-4379

IS - 8

ER -