Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The Piazza Peer Data Management System
IEEE Transactions on Knowledge and Data Engineering
Generic Model Management: Concepts And Algorithms (Lecture Notes in Computer Science)
Generic Model Management: Concepts And Algorithms (Lecture Notes in Computer Science)
Locally consistent transformations and query answering in data exchange
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Supporting executable mappings in model management
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Model management 2.0: manipulating richer mappings
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
On reconciling data exchange, data integration, and peer data management
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Composing mappings among data sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Quasi-inverses of schema mappings
ACM Transactions on Database Systems (TODS)
Towards a theory of schema-mapping optimization
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compiling mappings to bridge applications and databases
ACM Transactions on Database Systems (TODS)
Structural characterizations of schema-mapping languages
Proceedings of the 12th International Conference on Database Theory
Logical foundations of relational data exchange
ACM SIGMOD Record
The recovery of a schema mapping: Bringing exchanged data back
ACM Transactions on Database Systems (TODS)
Inverting schema mappings: bridging the gap between theory and practice
Proceedings of the VLDB Endowment
Composing local-as-view mappings: closure and applications
Proceedings of the 13th International Conference on Database Theory
Composition and inversion of schema mappings
ACM SIGMOD Record
The structure of inverses in schema mappings
Journal of the ACM (JACM)
Reverse data exchange: Coping with nulls
ACM Transactions on Database Systems (TODS)
Data exchange beyond complete data
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hi-index | 0.00 |
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 $${\mathcal{C}}$$ -maximum recovery, for a query language $${\mathcal{C}}$$ , a notion designed to generate inverse mappings that recover back only the information that can be retrieved with queries in $${\mathcal{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.