Publications

Stats

View publication

Title Query Language-based Inverses of Schema Mappings: Semantics, Computation, and Closure Properties
Authors Marcelo Arenas, Jorge Pérez, Cristian Riveros, Juan Reutter
Publication date 2012
Abstract The inversion of schema mappings has been identified as
one of
the fundamental operators for the development of a general framework for
metadata management. During the last few years, three alternative notions of
inversion for schema mappings have been proposed (Fagin-inverse (Fagin, TODS
32(4), 25:1?25:53, 2007), quasi-inverse (Fagin et al., TODS 33(2),
11:1?11:52, 2008), and maximum recovery (Arenas et al., TODS 34(4),
22:1?22:48, 2009)). However, these notions lack some fundamental
properties that limit their practical applicability: most of them are
expressed in languages including features that are difficult to use in
practice, some of these inverses are not guaranteed to exist for mappings
specified with source-to-target tuple-generating dependencies (st-tgds), and
it has been futile to search for a meaningful mapping language that is
closed under any of these notions of inverse. In this paper, we develop a
framework for the inversion of schema mappings that fulfills all of the
above requirements. It is based on the notion of C-maximum recovery, for a
query language C, a notion designed to generate inverse mappings that
recover back only the information that can be retrieved with queries in C.
By focusing on the language of conjunctive queries (CQ), we are able to find
a mapping language that contains the class of st-tgds, is closed under
CQ-maximum recovery, and for which the chase procedure can be used to
exchange data efficiently. Furthermore, we show that our choices of inverse
notion and mapping language are optimal, in the sense that choosing a more
expressive inverse operator or mapping language causes the loss of these
properties.
Pages 823-842
Volume 21
Journal name The VLDB Journal
Publisher Springer (New York, NY, USA)
Reference URL View reference page