The data mapping problem: algorithmic and logical characterizations

Fletcher, George H.L. (2005) The data mapping problem: algorithmic and logical characterizations. In: UNSPECIFIED (ed.) Proceedings of the 21st International Conference on Data Engineering Workshops: ICDE 2005. IEEE Computer Society. ISBN 0769526578.

Full text not available from this repository.

Official URL: https://doi.org/10.1109/ICDE.2005.293

Abstract

Technologies for overcoming heterogeneities between autonomous data sources are key in the emerging networked world. Our doctoral research investigates technologies for alleviating structural heterogeneity between relational data sources. At the heart of structural heterogeneity is the data mapping problem. The data mapping problem is to discover effective mappings between structured data sources. These mappings are the basic "glue" for facilitating large-scale ad-hoc information sharing between autonomous peers in a dynamic environment. Automating their discovery is one of the fundamental unsolved challenges for data interoperability. Our research on solutions to the data mapping problem has two main components: (1) a general algorithmic approach to automating the discovery of mappings and (2) a general formal approach to understanding the data mapping problem. We outline our progress on each of these fronts and discuss directions for future research.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	30 Mar 2021 07:54
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43731

Statistics

Archive Staff Only (login required)

Edit/View Item