ABSTRACT
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metadata management. There have been many achievements in this area, and semantics have been defined for operators on schema mappings such as composition and inverse. However, little research has been pursued towards providing formal tools to compare schema mappings, in terms of their ability to transfer data and avoid storing redundant information, which has hampered the development of foundations for more complex operators as many of them involve these notions.
In this paper, we address the problem of providing foundations for metadata management by developing an order to compare the amount of information transferred by schema mappings. From this order we derive several other criteria to compare mappings, we provide tools to deal with these criteria, and we show their usefulness in defining and studying schema mapping operators. More precisely, we show how the machinery developed can be used to study the extract and merge operators, that have been identified as fundamental for the development of a metadata management framework. We also use our machinery to provide simpler proofs for some fundamental results regarding the inverse operator, and we give an effective characterization for the decidability of the well-known schema evolution problem.
- M. Arenas, J. Pérez, J. Reutter, and C. Riveros. Composition and Inversion of Schema Mappings. SIGMOD Record, 38(3):17--28, 2009. Google Scholar
Digital Library
- M. Arenas, J. Pérez, J. Reutter, and C. Riveros. Inverting schema mappings: bridging the gap between theory and practice. In VLDB, pages 1018--1029, 2009. Google Scholar
Digital Library
- M. Arenas, J. Pérez, and C. Riveros. The recovery of a schema mapping: bringing exchanged data back. In TODS, 34(4), 2009. Google Scholar
Digital Library
- P. Bernstein, A. Halevy and R. Pottinger. A Vision of Management of Complex Models. SIGMOD Record, 29(4):55--63, 2000. Google Scholar
Digital Library
- P. Bernstein. Applying Model Management to Classical Meta Data Problems. In CIDR, 2003.Google Scholar
- P. Bernstein and S. Melnik. Model management 2.0: manipulating richer mappings. In SIGMOD, pages 1--12, 2007. Google Scholar
Digital Library
- P. Buneman, S. B. Davidson and A. Kosky. Theoretical aspects of schema merging. In EDBT, pages 152--167, 1992. Google Scholar
Digital Library
- O. Duschka and M. Genesereth. Answering recursive queries using views. In PODS, pages 109--116, 1997. Google Scholar
Digital Library
- B. ten Cate, P. Kolaitis. Structural Characterizations of Schema-Mapping Languages. In ICDT, pages 63--72, 2009. Google Scholar
Digital Library
- R. Fagin. Horn clauses and database dependencies. JACM, 29(4):952--985, 1982. Google Scholar
Digital Library
- R. Fagin. Inverting schema mappings. 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. TCS, 336(1):89--124, 2005. Google Scholar
Digital Library
- R. Fagin, P. G. Kolaitis and L. Popa. Data exchange: getting to the core. TODS,. 30(1):174--210, 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. 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 PODS, pages 123--132, 2007. Google Scholar
Digital Library
- R. Fagin, P. Kolaitis, L. Popa, and W.-C. Tan. Reverse data exchange: coping with nulls. In PODS, pages 23--32, 2009. Google Scholar
Digital Library
- R. Fagin, A. Nash. The structure of inverses in schema mappings. IBM Research Report RJ10425, version 4, April 2008.Google Scholar
- A. Y. Halevy. Answering queries using views: A survey. VLDB J., 10(4):270--294, 2001. Google Scholar
Digital Library
- P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS, pages 61--75, 2005. Google Scholar
Digital Library
- A. Y. Levy, A. O. Mendelzon, Y. Sagiv and D. Srivastava. Answering queries using views. In PODS, pages 95--104, 1995. Google Scholar
Digital Library
- S. Melnik, E. Rahm, and P. Bernstein. Rondo: A Programming Platform for Generic Model Management. In SIGMOD, pages 193--204, 2003. Google Scholar
Digital Library
- S. Melnik. Generic model management: concepts and algorithms. Volume 2967 of LNCS, Springer, 2004. Google Scholar
Digital Library
- S. Melnik, P. Bernstein, A. Y. Halevy, and E. Rahm. Supporting executable mappings in model management. In SIGMOD, pages 167--178, 2005. Google Scholar
Digital Library
- A. Nash, P. Bernstein, S. Melnik. Composition of mappings given by embedded dependencies. In PODS pages 172--183, 2005. Google Scholar
Digital Library
- R. Pottinger and P. A. Bernstein. Merging models based on given correspondences. In VLDB, pages 826--873, 2003. Google Scholar
Digital Library
- R. Pottinger and P. A. Bernstein. Schema merging and mapping creation for relational sources. In EDBT, pages 73--84, 2008. Google Scholar
Digital Library
- R. Pottinger and A. Y. Halevy. MiniCon: A scalable algorithm for answering queries using views. VLDB J., 10(2--3):182--198, 2001. Google Scholar
Digital Library
Index Terms
Foundations of schema mapping management
Recommendations
The recovery of a schema mapping: Bringing exchanged data back
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the target, a natural question is whether one can undo the process and recover the ...
Towards a theory of schema-mapping optimization
PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsA schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data exchange and data integration, an extensive investigation of the foundations ...
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 ...






Comments