ABSTRACT
An inverse of a schema mapping M is intended to "undo" what M does, thus providing a way to perform "reverse" data exchange. In recent years, three different formalizations of this concept have been introduced and studied, namely, the notions of an inverse of a schema mapping, a quasi-inverse of a schema mapping, and a maximum recovery of a schema mapping. The study of these notions has been carried out in the context in which source instances are restricted to consist entirely of constants, while target instances may contain both constants and labeled nulls. This restriction on source instances is crucial for obtaining some of the main technical results about these three notions, but, at the same time, limits their usefulness, since reverse data exchange naturally leads to source instances that may contain both constants and labeled nulls.
We develop a new framework for reverse data exchange that supports source instances that may contain nulls, thus overcoming the semantic mismatch between source and target instances of the previous formalizations. The development of this new framework requires a careful reformulation of all the important notions, including the notions of the identity schema mapping, inverse, and maximum recovery. To this effect, we introduce the notions of extended identity schema mapping, extended inverse, and maximum extended recovery, by making systematic use of the homomorphism relation on instances. We give results concerning the existence of extended inverses and of maximum extended recoveries, and results concerning their applications to reverse data exchange and query answering. Moreover, we show that maximum extended recoveries can be used to capture in a quantitative way the amount of information loss embodied in a schema mapping specified by source-to-target tuple-generating dependencies.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- M. Arenas, J. Pérez, and C. Riveros. The Recovery of a Schema Mapping: Bringing Exchanged Data Back. In PODS, pages 13--22, 2008. Google Scholar
Digital Library
- C. Beeri and M.Y. Vardi. A Proof Procedure for Data Dependencies. In JACM, 31(4):718--741, 1984. Google Scholar
Digital Library
- P.A. Bernstein. Applying Model Management to Classical Meta-Data Problems. In CIDR, pages 209--220, 2003.Google Scholar
- P.A. Bernstein, T.J. Green, S. Melnik, and A. Nash. Implementing Mapping Composition. In VLDB Journal, 17(2):333--353, 2008. Google Scholar
Digital Library
- A. Deutsch and V. Tannen. Optimization Properties for Classes of Conjunctive Regular Path Queries. In DBPL, pages 21--39, 2001. Google Scholar
Digital Library
- R. Fagin. Inverting schema mappings. In ACM TODS, 32(4), 2007. Google Scholar
Digital Library
- R. Fagin, P.G. Kolaitis, R.J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. In TCS, 336(1):89--124, 2005. Google Scholar
Digital Library
- R. Fagin, P.G. Kolaitis, L. Popa, and W.-C. Tan. Composing Schema Mappings: Second-order Dependencies to the Rescue. In ACM TODS, 30(4):994--1055, 2005. Google Scholar
Digital Library
- R. Fagin, P.G. Kolaitis, L. Popa, and W.C. Tan. Quasi-inverses of schema mappings. In ACM TODS, 33(2), 2008. Google Scholar
Digital Library
- A. Fuxman, M.A. Hernández, C.T.H. Ho, R.J. Miller, P. Papotti, and L. Popa. Nested Mappings: Schema Mapping Reloaded. In VLDB, pages 67--78, 2006. Google Scholar
Digital Library
- J. Madhavan and A.Y. Halevy. Composing Mappings Among Data Sources. In VLDB, pages 572--583, 2003. Google Scholar
Digital Library
- S. Melnik. Generic Model Management: Concepts and Algorithms, volume 2967 of Lecture Notes in Computer Science. Springer, 2004. Google Scholar
Digital Library
- A. Nash, P.A. Bernstein, and S. Melnik. Composition of Mappings Given by Embedded Dependencies. In ACM PODS, pages 172--183, 2005. Google Scholar
Digital Library
- L. Popa, Y. Velegrakis, R.J. Miller, M.A. Hernández, and R. Fagin. Translating Web Data. In VLDB, pages 598--609, 2002. Google Scholar
Digital Library
Index Terms
Reverse data exchange: coping with nulls
Recommendations
Reverse data exchange: Coping with nulls
An inverse of a schema mapping M is intended to undo what M does, thus providing a way to perform reverse data exchange. In recent years, three different formalizations of this concept have been introduced and studied, namely the notions of an inverse ...
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and the inverse operator, are regarded as especially important. Progress on the ...
Quasi-inverses of schema mappings
PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsSchema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and the inverse operator, are regarded as especially important. Progress on the ...






Comments