Show simple item record

dc.contributor.authorRull, Guillem
dc.contributor.authorFarré Tost, Carles
dc.contributor.authorTeniente López, Ernest
dc.contributor.authorUrpí Tubella, Antoni
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.citationRull, G., Farré, C., Teniente, E., Urpí, T. "Validation of mappings between schemas". 2007.
dc.description.abstractMappings between schemas are key elements in several contexts such as data exchange, data integration, peer data management systems, etc. In all these contexts, the process of designing a mapping requires the participation of a mapping designer that needs a way to validate the mapping being defined, i.e., to check whether the mapping is in fact what the designer intended. However, to date very little work has directly focused on the effective validation of schema mappings. In this paper, we present a new approach for validating schema mappings that allows the mapping designer to ask questions about the accomplishment of certain desirable properties of these mappings. We consider four properties of mappings: mapping satisfiability, mapping inference, query answerability and mapping losslessness. We reformulate these properties in terms of the problem of checking the liveliness of a derived predicate. We emphasize that this approach is independent of any particular method for liveliness checking and, to show the feasibility of our approach, we use an implementation of the CQC Method and provide some experimental results.
dc.format.extent12 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.otherData handling
dc.subject.otherElectronic data interchange
dc.subject.otherPeer-to-peer computing
dc.subject.otherQuery processing
dc.titleValidation of mappings between schemas
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorRull, G.; Farré, C.; Teniente, E.; Urpí, T.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder