Reducing the cost of validating mapping compositions by exploiting semantic relationships

  • Authors:

  • Eduard Dragut;Ramon Lawrence

  • Affiliations:

  • Department of Computer Science, University of Illinois at Chicago;Department of Computer Science, University of British Columbia Okanagan

  • Venue:
  • ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Defining and composing mappings are fundamental operations required in any data sharing architecture (e.g data warehouse, data integration) Mapping composition is used to generate new mappings from existing ones and is useful when no direct mapping is available The complexity of mapping composition depends on the amount of syntactic and semantic information in the mapping The composition of mappings has proven to be inefficient to compute in many situations unless the mappings are simplified to binary relationships that represent “similarity” between concepts Our contribution is an algorithm for composing metadata mappings that capture explicit semantics in terms of binary relationships Our approach allows the hard cases of mapping composition to be detected and semi-automatically resolved, and thus reduces the manual effort required during composition We demonstrate how the mapping composition algorithm is used to produce a direct mapping between schemas from independently produced schema-to-ontology mappings An experimental evaluation shows that composing semantic mappings results in a more accurate composition result compared to composing mappings as morphisms.