Implementing Mapping Composition

Loading...
Thumbnail Image
Penn collection
Database Research Group (CIS)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Bernstein, Philip A
Melnik, Sergey
Nash, Alan
Contributor
Abstract

Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas S1 and S2 and a mapping over schemas S2 and S3, the composition problem is to compute an equivalent mapping over S1 and S3. We describe a new composition algorithm that targets practical applications. It incorporates view unfolding. It eliminates as many S2 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.

Advisor
Date of presentation
2006-09-01
Conference name
Database Research Group (CIS)
Conference dates
2023-05-17T00:26:36.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Postprint version. Copyright ACM, 2006. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 32nd International Conference on Very Large Data Bases, Volume 32, 2006, pages 55-66. Publisher URL: http://hdl.library.upenn.edu/1017/55
Recommended citation
Collection