OWL schema matching

Schema matching is a fundamental issue to many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called extensional, instance-bas...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Brazilian Computer Society Vol. 16; no. 1; pp. 21 - 34
Main Authors Leme, Luiz André P. Paes, Casanova, Marco A., Breitman, Karin K., Furtado, Antonio L.
Format Journal Article
LanguageEnglish
Published London Springer London 01.05.2010
Sociedade Brasileira de Computação
Subjects
Computer Science
Computer System Implementation
Data Structures
Invited Paper
Operating Systems
Simulation and Modeling
Schema matching
Provenance
Similarity
OWL
Online AccessGet full text

Cover

More Information
Summary:Schema matching is a fundamental issue to many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called extensional, instance-based, or semantic, is to detect how the same real world objects are represented in different databases and to use the information thus obtained to match the schemas. Additionally, we argue that automatic approaches of schema matching should store provenance data about matchings. This paper describes an instance-based schema matching technique for an OWL dialect and proposes a data model for storing provenance data. The matching technique is based on similarity functions and is backed up by experimental results with real data downloaded from data sources found on the Web.
ISSN:0104-6500
1678-4804
DOI:10.1007/s13173-010-0005-3