A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Relative information capacity of simple relational database schemata
SIAM Journal on Computing
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
EXPRESS: a data EXtraction, Processing, and Restructuring System
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
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
Generic Model Management: Concepts And Algorithms (Lecture Notes in Computer Science)
Generic Model Management: Concepts And Algorithms (Lecture Notes in Computer Science)
Composing schema mappings: second-order dependencies to the rescue
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Supporting executable mappings in model management
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Semantic adaptation of schema mappings when schemas evolve
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Nested mappings: schema mapping reloaded
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Composition of mappings given by embedded dependencies
ACM Transactions on Database Systems (TODS)
Model management 2.0: manipulating richer mappings
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
CWA-solutions for data exchange settings with target dependencies
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Quasi-inverses of schema mappings
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Information preserving XML schema embedding
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
Answering aggregate queries in data exchange
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data integration with uncertainty
The VLDB Journal — The International Journal on Very Large Data Bases
Logical foundations of relational data exchange
ACM SIGMOD Record
Schema mapping and query translation in heterogeneous P2P XML databases
The VLDB Journal — The International Journal on Very Large Data Bases
Answering non-monotonic queries in relational data exchange
Proceedings of the 13th International Conference on Database Theory
Tuning the ensemble selection process of schema matchers
Information Systems
Automatic schema merging using mapping constraints among incomplete sources
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Logic and data exchange: which solutions are "good" solutions?
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
A relational database integrity framework for access control policies
Journal of Intelligent Information Systems
Hi-index | 0.00 |
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). Although the notion of an inverse of a schema mapping is important, the exact definition of an inverse mapping is somewhat elusive. This is because a schema mapping may associate many target instances with each source instance, and many source instances with each target instance. Based on the notion that the composition of a mapping and its inverse is the identity, we give a formal definition for what it means for a schema mapping M′ to be an inverse of a schema mapping M for a class S of source instances. We call such an inverse an S-inverse. A particular case of interest arises when S is the class of all instances, in which case an S-inverse is a global inverse. We focus on the important and practical case of schema mappings defined by source-to-target tuple-generating dependencies, and uncover a rich theory. When S is defined by a set of dependencies with a finite chase, we show how to construct an S-inverse when one exists. In particular, we show how to construct a global inverse when one exists. Given M and M′, we show how to define the largest class S such that M′ is an S-inverse of M.