Skip to main content
SpringerLink
Log in
Book cover

Schema Matching and Mapping pp 191–222Cite as

Schema Mapping Evolution Through Composition and Inversion

  • Chapter
  • First Online:

Part of the book series: Data-Centric Systems and Applications ((DCSA))

Abstract

Mappings between different representations of data are the essential building blocks for many information integration tasks. A schema mapping is a high-level specification of the relationship between two schemas, and represents a useful abstraction that specifies how the data from a source format can be transformed into a target format. The development of schema mappings is laborious and time consuming, even in the presence of tools that facilitate this development. At the same time, schema evolution inevitably causes the invalidation of the existing schema mappings (since their schemas change). Providing tools and methods that can facilitate the adaptation and reuse of the existing schema mappings in the context of the new schemas is an important research problem. In this chapter, we show how two fundamental operators on schema mappings, namely composition and inversion, can be used to address the mapping adaptation problem in the context of schema evolution. We illustrate the applicability of the two operators in various concrete schema evolution scenarios, and we survey the most important developments on the semantics, algorithms, and implementation of composition and inversion. We also discuss the main research questions that still remain to be addressed.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    These were introduced in Fagin et al. (2009b) under a different name: universal-faithful inverses. However, the term relaxed chase-inverses, which we use in this paper, is a more suggestive term that also reflects the relationship with the chase-inverses.

  2. 2.

    A stricter version of LAV s-t tgds, where no repeated variables in the left-hand side Q(x) are allowed and all variables in xappear in the right-hand side, is also used in literature. We refer to this type of LAV s-t tgds as strictLAV s-t tgds.

  3. 3.

    Note that it is logically equivalent to the earlier way we expressed \(\mathcal{M}\circ \mathcal{M} \), and where the roles of coand co′were switched.

  4. 4.

    In fact, that is how Madhavan and Halevy defined composition of schema mappings.

References

  1. Alexe B, Hernández MA, Popa L, Tan WC (2010) MapMerge: Correlating independent schema mappings. In: PVLDB, vol 3(1), pp 81–92

    Google Scholar 

  2. Arenas M, Pérez J, Riveros C (2008) The recovery of a schema mapping: Bringing exchanged data back. In: PODS. ACM, NY, pp 13–22

    Google Scholar 

  3. Bernstein PA (2003) Applying model management to classical meta-data problems. In: Conference on innovative data systems research (CIDR), Asilomar, CA, pp 209–220

    Google Scholar 

  4. Bernstein PA, Green TJ, Melnik S, Nash A (2008) Implementing mapping composition. VLDB J 17(2):333–353

    Article  Google Scholar 

  5. Chandra AK, Merlin PM (1977) Optimal implementation of conjunctive queries in relational data bases. In: ACM symposium on theory of computing (STOC). ACM, NY, pp 77–90

    Google Scholar 

  6. Curino C, Moon HJ, Zaniolo C (2008) Graceful database schema evolution: The PRISM workbench. PVLDB 1(1):761–772

    Google Scholar 

  7. Deutsch A, Tannen V (2003) MARS: A system for publishing XML from mixed and redundant storage. In: International conference on very large data bases (VLDB). VLDB Endowment,pp 201–212

    Google Scholar 

  8. Deutsch A, Popa L, Tannen V (1999) Physical data independence, constraints and optimization with universal plans. In: International conference on very large data bases (VLDB). Morgan Kaufmann, CA, pp 459–470

    Google Scholar 

  9. Deutsch A, Popa L, Tannen V (2006) Query reformulation with constraints. SIGMOD Rec 35(1):65–73

    Article  Google Scholar 

  10. Fagin R (2007) Inverting schema mappings. ACM Trans Database Syst (TODS) 32(4), Article No. 11

    Google Scholar 

  11. Fagin R, Kolaitis PG, Popa L, Tan WC (2004) Composing schema mappings: Second-order dependencies to the rescue. In: ACM symposium on principles of database systems (PODS). ACM, NY, pp 83–94

    Google Scholar 

  12. Fagin R, Kolaitis PG, Miller RJ, Popa L (2005a) Data exchange: Semantics and query answering. Theor Comput Sci (TCS) 336(1):89–124

    Article  MathSciNet  MATH  Google Scholar 

  13. Fagin R, Kolaitis PG, Popa L, Tan WC (2005b) Composing schema mappings: Second-order dependencies to the rescue. ACM Trans Database Syst (TODS) 30(4):994–1055

    Article  Google Scholar 

  14. Fagin R, Kolaitis PG, Nash A, Popa L (2008a) Towards a theory of schema-mapping optimization. In: ACM symposium on principles of database systems (PODS). ACM, NY, pp 33–42

    Google Scholar 

  15. Fagin R, Kolaitis PG, Popa L, Tan WC (2008b) Quasi-inverses of schema mappings. ACM Trans Database Syst (TODS) 33(2), Article No. 11

    Google Scholar 

  16. Fagin R, Haas LM, Hernández MA, Miller RJ, Popa L, Velegrakis Y (2009a) Clio: Schema mapping creation and data exchange. In: Conceptual modeling: Foundations and applications, Essays in Honor of John Mylopoulos. Springer, Heidelberg, pp 198–236

    Google Scholar 

  17. Fagin R, Kolaitis PG, Popa L, Tan WC (2009b) Reverse data exchange: Coping with nulls. In: ACM symposium on principles of database systems (PODS). ACM, NY, pp 23–32

    Google Scholar 

  18. Fagin R, Kolaitis PG, Popa L, Tan WC (2010) Reverse data exchange: Coping with nulls. In: ACM symposium on principles of database systems (PODS). ACM, NY, pp 23–32

    Google Scholar 

  19. Haas LM, Hernández MA, Ho H, Popa L, Roth M (2005) Clio grows up: From research prototype to industrial tool. In: SIGMOD. ACM, NY, pp 805–810

    Google Scholar 

  20. Hartung M, Terwilliger J, Rahm E (2011) Recent advances in schema and ontology evolution. In: Bellahsene Z, Bonifati A, Rahm E (eds) Schema matching and mapping. Data-Centric Systems and Applications Series. Springer, Heidelberg

    Google Scholar 

  21. Lenzerini M (2002) Data integration: A theoretical perspective. In: ACM symposium on principles of database systems (PODS). ACM, NY, pp 233–246

    Google Scholar 

  22. Madhavan J, Halevy AY (2003) Composing mappings among data sources. In: International conference on very large data bases (VLDB). VLDB Endowment, pp 572–583

    Google Scholar 

  23. Melnik S (2004) Generic model management: Concepts and algorithms. Lecture Notes in Computer Science, vol 2967. Springer, Heidelberg

    Google Scholar 

  24. Melnik S, Bernstein PA, Halevy A, Rahm E (2005) Applying model management to executable mappings. In: SIGMOD, ACM, NY, pp 167–178

    Google Scholar 

  25. Nash A, Bernstein PA, Melnik S (2005) Composition of mappings given by embedded dependencies. In: ACM symposium on principles of database systems (PODS). ACM, NY,pp 172–183

    Google Scholar 

  26. Shu NC, Housel BC, Taylor RW, Ghosh SP, Lum VY (1977) EXPRESS: A data extraction, processing, amd restructuring system. ACM Trans Database Syst (TODS) 2(2):134–174

    Article  Google Scholar 

  27. Velegrakis Y, Miller RJ, Popa L (2003) Mapping adaptation under evolving schemas. In: International conference on very large data bases (VLDB). VLDB Endowment, pp 584–595

    Google Scholar 

  28. Yu C, Popa L (2005) Semantic adaptation of schema mappings when schemas evolve. In: VLDB. VLDB Endowment, pp 1006–1017

    Google Scholar 

Download references

Acknowledgements

The authors thank Erhard Rahm for reading an earlier version of this chapter and providing valuable feedback. The research of Kolaitis and Tan is supported by NSF grant IIS-0430994 and NSF grant IIS-0905276. Tan is also supported by NSF CAREER award IIS-0347065.

Author information

Authors and Affiliations

  1. IBM Almaden Research Center, San Jose, CA, USA

    Ronald Fagin, Phokion G. Kolaitis, Lucian Popa & Wang-Chiew Tan

  2. UC Santa Cruz, Santa Cruz, CA, 95064, USA

    Phokion G. Kolaitis & Wang-Chiew Tan

Authors
  1. Ronald Fagin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Phokion G. Kolaitis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lucian Popa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wang-Chiew Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ronald Fagin .

Editor information

Editors and Affiliations

  1. LIRMM CNRS/Univ. Montpellier 2, Rue Ada 161, Montpellier, 34392, France

    Zohra Bellahsene

  2. Consiglio Nazionale delle Ricerche (CNR), Via P. Bucci 41/C, Rende, 87036, Italy

    Angela Bonifati

  3. Inst. Informatik, Universität Leipzig, Augustusplatz 10-11, Leipzig, 04109, Germany

    Erhard Rahm

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fagin, R., Kolaitis, P.G., Popa, L., Tan, WC. (2011). Schema Mapping Evolution Through Composition and Inversion. In: Bellahsene, Z., Bonifati, A., Rahm, E. (eds) Schema Matching and Mapping. Data-Centric Systems and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16518-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16518-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16517-7

  • Online ISBN: 978-3-642-16518-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation