Implementing mapping composition

  • Authors:
  • Philip A. Bernstein;Todd J. Green;Sergey Melnik;Alan Nash

  • Affiliations:
  • Microsoft Research, Redmond, USA;University of Pennsylvania, Philadelphia, USA;Microsoft Research, Redmond, USA;IBM Almaden Research Center, San Jose, USA

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 驴1 and 驴2 and a mapping over schemas 驴2 and 驴3, the composition problem is to compute an equivalent mapping over 驴1 and 驴3. We describe a new composition algorithm that targets practical applications. It incorporates view unfolding. It eliminates as many 驴2 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 results which validate its effectiveness.