A restricted second order logic for finite structures
Information and Computation
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)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Composition of mappings given by embedded dependencies
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
Nested mappings: schema mapping reloaded
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Model management 2.0: manipulating richer mappings
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
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
Structural characterizations of schema-mapping languages
Proceedings of the 12th International Conference on Database Theory
The recovery of a schema mapping: Bringing exchanged data back
ACM Transactions on Database Systems (TODS)
Structural characterizations of schema-mapping languages
Communications of the ACM - Amir Pnueli: Ahead of His Time
Inverting schema mappings: bridging the gap between theory and practice
Proceedings of the VLDB Endowment
Composition with target constraints
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
Local transformations and conjunctive-query equivalence
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Data exchange beyond complete data
Journal of the ACM (JACM)
Hi-index | 0.00 |
The problems of composing and inverting schema mappings specified by source-to-target tuple-generating dependencies (st-tgds) have attracted a lot of attention, as they are of fundamental importance for the development of Bernstein@?s metadata management framework. In the case of the composition operator, a natural semantics has been proposed and the language of second-order tuple generating dependencies (SO-tgds) has been identified as the right language to express it. In the case of the inverse operator, several semantics have been proposed, most notably the maximum recovery, the only inverse notion that guarantees that every mapping specified by st-tgds is invertible. Unfortunately, less attention has been paid to combining both operators, which is the motivation of this paper. More precisely, we start our investigation by showing that SO-tgds are not good for inversion, as there exist mappings specified by SO-tgds that are not invertible under any of the notions of inversion proposed in the literature. To overcome this limitation, we borrow the notion of CQ-composition, which is a relaxation obtained by parameterizing the composition of mappings by the class of conjunctive queries (CQ), and we propose a restriction over the class of SO-tgds that gives rise to the language of plain SO-tgds. Then we show that plain SO-tgds are the right language to express the CQ-composition of mappings given by st-tgds, in the same sense that SO-tgds are the right language to express the composition of st-tgds, and we prove that every mapping specified by a plain SO-tgd admits a maximum recovery, thus showing that plain SO-tgds have a good behavior w.r.t. inversion. Moreover, we show that the language of plain SO-tgds shares some fundamental structural properties with the language of st-tgds, but being much more expressive, and we provide a polynomial-time algorithm to compute maximum recoveries for mappings specified by plain SO-tgds (which can also be used to compute maximum recoveries for mappings given by st-tgds). All these results suggest that the language of plain SO-tgds is a good alternative to be implemented in data exchange and data integration applications.