Logo image
Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences
Book chapter   Open access   Peer reviewed

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

Yuan An, Alex Borgida and John Mylopoulos
On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE, pp 1152-1169
2005
url
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.2266View

Abstract

Database Schema Relational Schema Relational Table Semantic Mapping Steiner Tree
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.

Metrics

12 Record Views
53 citations in Scopus
53 readers on Mendeley
1 readers on CiteULike

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Computer Science, Information Systems
Computer Science, Theory & Methods
Logo image