Normalization and optimization of schema mappings.
Schema mappings are high-level specifications that describe the relationship between database schemas. They are an important tool in several areas of database research, notably in data integration and data exchange. However, a concrete theory of schema mapping optimization including the formulation...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2011
|
| _version_ | 1826258450090295296 |
|---|---|
| author | Gottlob, G Pichler, R Savenkov, V |
| author_facet | Gottlob, G Pichler, R Savenkov, V |
| author_sort | Gottlob, G |
| collection | OXFORD |
| description | Schema mappings are high-level specifications that describe the relationship between database schemas. They are an important tool in several areas of database research, notably in data integration and data exchange. However, a concrete theory of schema mapping optimization including the formulation of optimality criteria and the construction of algorithms for computing optimal schema mappings is completely lacking to date. The goal of this work is to fill this gap. We start by presenting a system of rewrite rules to minimize sets of source-to-target tuple-generating dependencies. Moreover, we show that the result of this minimization is unique up to variable renaming. Hence, our optimization also yields a schema mapping normalization. By appropriately extending our rewrite rule system, we also provide a normalization of schema mappings containing equality-generating target dependencies. An important application of such a normalization is in the area of defining the semantics of query answering in data exchange, since several definitions in this area depend on the concrete syntactic representation of the mappings. This is, in particular, the case for queries with negated atoms and for aggregate queries. The normalization of schema mappings allows us to eliminate the effect of the concrete syntactic representation of the mapping from the semantics of query answering. We discuss in detail how our results can be fruitfully applied to aggregate queries. © 2011 Springer-Verlag. |
| first_indexed | 2024-03-06T18:34:11Z |
| format | Journal article |
| id | oxford-uuid:0aab7bbd-0eeb-4e99-ac2b-55d7850a16b1 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T18:34:11Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | oxford-uuid:0aab7bbd-0eeb-4e99-ac2b-55d7850a16b12022-03-26T09:25:05ZNormalization and optimization of schema mappings.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:0aab7bbd-0eeb-4e99-ac2b-55d7850a16b1EnglishSymplectic Elements at Oxford2011Gottlob, GPichler, RSavenkov, VSchema mappings are high-level specifications that describe the relationship between database schemas. They are an important tool in several areas of database research, notably in data integration and data exchange. However, a concrete theory of schema mapping optimization including the formulation of optimality criteria and the construction of algorithms for computing optimal schema mappings is completely lacking to date. The goal of this work is to fill this gap. We start by presenting a system of rewrite rules to minimize sets of source-to-target tuple-generating dependencies. Moreover, we show that the result of this minimization is unique up to variable renaming. Hence, our optimization also yields a schema mapping normalization. By appropriately extending our rewrite rule system, we also provide a normalization of schema mappings containing equality-generating target dependencies. An important application of such a normalization is in the area of defining the semantics of query answering in data exchange, since several definitions in this area depend on the concrete syntactic representation of the mappings. This is, in particular, the case for queries with negated atoms and for aggregate queries. The normalization of schema mappings allows us to eliminate the effect of the concrete syntactic representation of the mapping from the semantics of query answering. We discuss in detail how our results can be fruitfully applied to aggregate queries. © 2011 Springer-Verlag. |
| spellingShingle | Gottlob, G Pichler, R Savenkov, V Normalization and optimization of schema mappings. |
| title | Normalization and optimization of schema mappings. |
| title_full | Normalization and optimization of schema mappings. |
| title_fullStr | Normalization and optimization of schema mappings. |
| title_full_unstemmed | Normalization and optimization of schema mappings. |
| title_short | Normalization and optimization of schema mappings. |
| title_sort | normalization and optimization of schema mappings |
| work_keys_str_mv | AT gottlobg normalizationandoptimizationofschemamappings AT pichlerr normalizationandoptimizationofschemamappings AT savenkovv normalizationandoptimizationofschemamappings |