loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Data Engineering Workshops (ICDEW'05)
The Data Mapping Problem: Algorithmic and Logical Characterizations
Tokyo, Japan
April 05-April 08
ISBN: 0-7695-2657-8
ASCII Text
x 
 
George H. L. Fletcher, "The Data Mapping Problem: Algorithmic and Logical Characterizations," Data Engineering Workshops, 22nd International Conference on, pp. 1263, 21st International Conference on Data Engineering Workshops (ICDEW'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ICDE.2005.293,
author = {George H. L. Fletcher},
title = {The Data Mapping Problem: Algorithmic and Logical Characterizations},
journal ={Data Engineering Workshops, 22nd International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2657-8},
pages = {1263},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.293},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Engineering Workshops, 22nd International Conference on
TI - The Data Mapping Problem: Algorithmic and Logical Characterizations
SN - 0-7695-2657-8
SP
EP
A1 - George H. L. Fletcher,
PY - 2005
KW - null
VL - 0
JA - Data Engineering Workshops, 22nd International Conference on
ER -
 
George H. L. Fletcher, Computer Science, Indiana University, Bloomington, USA
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.
Citation:
George H. L. Fletcher, "The Data Mapping Problem: Algorithmic and Logical Characterizations," icdew, pp.1263, 21st International Conference on Data Engineering Workshops (ICDEW'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.