2009/10/18 by Marcelo Arenas, Arenas, Marcelo, Jorge Perez +7
Computer Science · #Advanced Database Systems and Queries #Databases (cs.DB) #FOS: Computer and information sciences #Semantic Web and Ontologies #Service-Oriented Architecture and Web Services #cs.DB
paper · pdf · doi:10.48550/arxiv.0910.3372
openalex publication_date 2009/10/18 · arxiv created 2010/03/04 · arxiv updated 2010/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the recent years, a lot of attention has been paid to the development of solid foundations for the composition and inversion of schema mappings. In this paper, we review the proposals for the semantics of these crucial operators. For each of these proposals, we concentrate on the three following problems: the definition of the semantics of the operator, the language needed to express the operator, and the algorithmic issues associated to the problem of computing the operator. It should be pointed out that we primarily consider the formalization of schema mappings introduced in the work on data exchange. In particular, when studying the problem of computing the composition and inverse of a schema mapping, we will be mostly interested in computing these operators for mappings specified by source-to-target tuple-generating dependencies.