Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences (2005)
Cached
Download Links
- [dit.unitn.it]
- [www.cs.toronto.edu]
- [www.cs.uoregon.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In ODBASE’05 |
| Citations: | 35 - 8 self |
BibTeX
@INPROCEEDINGS{An05inferringcomplex,
author = {Yuan An and Alex Borgida and John Mylopoulos},
title = {Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences},
booktitle = {In ODBASE’05},
year = {2005},
pages = {1152--1169}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 to 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. 1
