Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas S1 and S2 and a mapping over schemas S2 and S3, the composition problem is to compute an equivalent mapping over S1 and S3. We describe a new composition algorithm that targets practical applications. It incorporates view unfolding. It eliminates as many S2 symbols as possible, even if not all can be eliminated. It covers constraints expressed using arbitrary monotone relational operators and, to a lesser extent, non-monotone operators. And it introduces the new technique of left composition. We describe our implementation, explain how to extend it to support user-defined operators, and present experimental result
To achieve interoperability, modern information systems and e-commerce applications use mappings to ...
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgd...
Schema mapping algorithms rely on value correspondences -- i.e., correspondences among semantically ...
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over...
Defining and composing mappings are fundamental operations required in any data sharing architecture...
Composition of mappings between schemas is essential to support schema evolution, data exchange, dat...
Schemas evolve over time to accommodate the changes in the information they represent. Such evolutio...
Abstract—There are a large number of indirect schema mappings between peers in the network. To impro...
A schema mapping is a high-level specification that describes how data from a source schema is to be...
Composition of mappings between schemas is essential to support schema evolution, data ex-change, da...
It is known that the composition of schema mappings, each specified bysource-to-target tgds (st-tgds...
The mapping semantics that combines the schema-level and the data-level mappings is called bi-level ...
Schema mapping is becoming pervasive in all data transformation, exchange and integration tasks. It ...
Finding semantically correct mappings between the schemas of two data sources is a fundamental probl...
We describe DMSL, a domain specific language for defining schema mappings. Schema mappings are asser...
To achieve interoperability, modern information systems and e-commerce applications use mappings to ...
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgd...
Schema mapping algorithms rely on value correspondences -- i.e., correspondences among semantically ...
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over...
Defining and composing mappings are fundamental operations required in any data sharing architecture...
Composition of mappings between schemas is essential to support schema evolution, data exchange, dat...
Schemas evolve over time to accommodate the changes in the information they represent. Such evolutio...
Abstract—There are a large number of indirect schema mappings between peers in the network. To impro...
A schema mapping is a high-level specification that describes how data from a source schema is to be...
Composition of mappings between schemas is essential to support schema evolution, data ex-change, da...
It is known that the composition of schema mappings, each specified bysource-to-target tgds (st-tgds...
The mapping semantics that combines the schema-level and the data-level mappings is called bi-level ...
Schema mapping is becoming pervasive in all data transformation, exchange and integration tasks. It ...
Finding semantically correct mappings between the schemas of two data sources is a fundamental probl...
We describe DMSL, a domain specific language for defining schema mappings. Schema mappings are asser...
To achieve interoperability, modern information systems and e-commerce applications use mappings to ...
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgd...
Schema mapping algorithms rely on value correspondences -- i.e., correspondences among semantically ...