Constraint-aware schema transformation
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/1822/26605 |
Resumo: | Ninth International Workshop on Rule-Based Programming (Rule 2008) |
id |
RCAP_8618382e8106e7d30edd50a04dcfcad3 |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/26605 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Constraint-aware schema transformationSchema transformationInvariantsData refinementStrategic term rewritingPoint-free program transformationHaskellConstraintsStrategic rewritingScience & TechnologyNinth International Workshop on Rule-Based Programming (Rule 2008)Data schema transformations occur in the context of software evolution, refactoring, and cross-paradigm data mappings. When constraints exist on the initial schema, these need to be transformed into constraints on the target schema. Moreover, when high-level data types are refined to lower level structures, additional target schema constraints must be introduced to balance the loss of structure and preserve semantics. We introduce an algebraic approach to schema transformation that is constraint-aware in the sense that constraints are preserved from source to target schemas and that new constraints are introduced where needed. Our approach is based on refinement theory and point-free program transformation. Data refinements are modeled as rewrite rules on types that carry point-free predicates as constraints. At each rewrite step, the predicate on the reduct is computed from the predicate on the redex. An additional rewrite system on point-free functions is used to normalize the predicates that are built up along rewrite chains. We implemented our rewrite systems in a type-safe way in the functional programming language Haskell. We demonstrate their application to constraint-aware hierarchical-relational mappings.FCT -Fundação para a Ciência e a Tecnologia(SFRH/BD/30215/2006)ElsevierUniversidade do MinhoAlves, Tiago L.Silva, Paulo F.Visser, Joost20122012-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/26605eng1571-066110.1016/j.entcs.2012.11.008http://www.sciencedirect.com/science/article/pii/S1571066112000783#info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T12:49:27Zoai:repositorium.sdum.uminho.pt:1822/26605Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:47:56.419549Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Constraint-aware schema transformation |
title |
Constraint-aware schema transformation |
spellingShingle |
Constraint-aware schema transformation Alves, Tiago L. Schema transformation Invariants Data refinement Strategic term rewriting Point-free program transformation Haskell Constraints Strategic rewriting Science & Technology |
title_short |
Constraint-aware schema transformation |
title_full |
Constraint-aware schema transformation |
title_fullStr |
Constraint-aware schema transformation |
title_full_unstemmed |
Constraint-aware schema transformation |
title_sort |
Constraint-aware schema transformation |
author |
Alves, Tiago L. |
author_facet |
Alves, Tiago L. Silva, Paulo F. Visser, Joost |
author_role |
author |
author2 |
Silva, Paulo F. Visser, Joost |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Alves, Tiago L. Silva, Paulo F. Visser, Joost |
dc.subject.por.fl_str_mv |
Schema transformation Invariants Data refinement Strategic term rewriting Point-free program transformation Haskell Constraints Strategic rewriting Science & Technology |
topic |
Schema transformation Invariants Data refinement Strategic term rewriting Point-free program transformation Haskell Constraints Strategic rewriting Science & Technology |
description |
Ninth International Workshop on Rule-Based Programming (Rule 2008) |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012 2012-01-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/26605 |
url |
http://hdl.handle.net/1822/26605 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1571-0661 10.1016/j.entcs.2012.11.008 http://www.sciencedirect.com/science/article/pii/S1571066112000783# |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133055713017856 |