Specifying Complex Correspondences Between Relational Schemas in a Data Integration Environment

Valéria Pequeno, Helena Galhardas

2014

Abstract

When dealing with the data integration problem, the designer usually encounters incompatible data models characterized by differences in structure and semantics, even in the context of the same organization. In this work, we propose a declarative and formal approach to specify 1-to-1, 1-m, and m-to-n correspondences between relational schema components. Differently from usual correspondences, our Correspondence Asser- tions (CAs) have semantics and can deal with joins, outer-joins, and data-metadata relationships. Finally, we demonstrate how we can generate mapping expressions in the form of SQL queries from CAs.

Paper Citation

in Harvard Style

Pequeno V. and Galhardas H. (2014). Specifying Complex Correspondences Between Relational Schemas in a Data Integration Environment . In Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-027-7, pages 18-29. DOI: 10.5220/0004870200180029

in Bibtex Style

@conference{iceis14,
author={Valéria Pequeno and Helena Galhardas},
title={Specifying Complex Correspondences Between Relational Schemas in a Data Integration Environment},
booktitle={Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2014},
pages={18-29},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004870200180029},
isbn={978-989-758-027-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 16th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - Specifying Complex Correspondences Between Relational Schemas in a Data Integration Environment
SN - 978-989-758-027-7
AU - Pequeno V.
AU - Galhardas H.
PY - 2014
SP - 18
EP - 29
DO - 10.5220/0004870200180029