Correspondence and translation for heterogeneous data (2002)
| Citations: | 85 - 9 self |
BibTeX
@MISC{Abiteboul02correspondenceand,
author = {Serge Abiteboul and Sophie Cluet and Tova Milo},
title = { Correspondence and translation for heterogeneous data },
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Data integration often requires a clean abstraction of the different formats in which data are stored, and means for specifying the correspondences/relationships between data in different worlds and for translating data from one world to another. For that, we introduce in this paper a middleware data model that serves as a basis for the integration task, and a declarative rules language for specifying the integration. We show that using the language, correspondences between data elements can be computed in polynomial time in many cases, andmay require exponential time only when insensitivity to order or duplicates are considered. Furthermore, we show that in most practical cases the correspondence rules can be automatically turnedinto translation rules to map data from one representation to another. Thus, a complete integration task (derivation of correspondences, transformation of data from one world to the other, incremental integration of a new bulk of data, etc.) can be specified using a single set of declarative rules.
Keyphrases
heterogeneous data new bulk complete integration task middleware data model integration task turnedinto translation rule correspondence rule exponential time many case polynomial time different world declarative rule different format single set practical case declarative rule language incremental integration clean abstraction data element data integration
