The data mapping problem : algorithmic and logical characterizations (Abstract)

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)
    23 Downloads (Pure)

    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.
    Original languageEnglish
    Title of host publicationProceedings of the 21st International Conference on Data Engineering (ICDE 2005, Tokyo, Japan, April 5-8, 2005)
    PublisherIEEE Computer Society
    Pages1263-
    ISBN (Print)0-7695-2285-8
    DOIs
    Publication statusPublished - 2005

    Fingerprint Dive into the research topics of 'The data mapping problem : algorithmic and logical characterizations (Abstract)'. Together they form a unique fingerprint.

    Cite this