Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences

  • Yuan An
  • Alex Borgida
  • John Mylopoulos
Conference paper

DOI: 10.1007/11575801_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3761)
Cite this paper as:
An Y., Borgida A., Mylopoulos J. (2005) Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences. In: Meersman R., Tari Z. (eds) On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE. OTM 2005. Lecture Notes in Computer Science, vol 3761. Springer, Berlin, Heidelberg

Abstract

There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual model or ontology (CM) of the domain. This paper describes the underlying principles, algorithms, and a prototype of a tool which infers such semantic mappings when given simple correspondences from table columns in a relational schema and datatype properties of classes in an ontology. Although the algorithm presented is necessarily heuristic, we offer formal results stating that the answers returned are “correct” for relational schemas designed according to standard Entity-Relationship techniques. We also report on experience in using the tool with public domain schemas and ontologies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yuan An
    • 1
  • Alex Borgida
    • 2
  • John Mylopoulos
    • 1
  1. 1.University of TorontoCanada
  2. 2.Rutgers UniversityUSA

Personalised recommendations