Skip to main content
Springer Nature Link
Log in

Schema Homomorphism – An Algebraic Framework for Schema Matching

  • Conference paper
Advances in Computer Science – ASIAN 2005. Data Management on the Web (ASIAN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3818))

Included in the following conference series:

  • 468 Accesses

Abstract

A formal framework for SMP is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, we propose a formal definition of schema matching that is named multivalent matching, i.e., an individual of source schema can be associated with a set of individuals of target schema. Second, we develop the algebraic framework of multivalent matching that is called schema homomorphism and propose the algorithm model of SMP. Then, we discuss the relations between match cardinality and variants of schema homomorphism.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Hell, P.: Algorithmic aspects of graph homomorphisms. Combinatorics 2003, London Math. Society. Lecture Note Series  307, 239–276.

    Google Scholar 

  2. Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal 10, 334–350 (2001)

    Article  MATH  Google Scholar 

  3. Zhang, Z., Che, H.Y., Shi, P.-f., Sun, Y., Gu, J.: Multi-labeled graph matching - an algorithm model for schema matching. In: Grumbach, S., Sui, L., Vianu, V. (eds.) ASIAN 2005. LNCS, vol. 3818, pp. 90–103. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Zhang, Z., Che, H., Shi, P.-f., Sun, Y., Gu, J.: An algebraic framework for schema matching. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol. 3739, pp. 694–699. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Image Processing and Pattern Recognition, Shanghai Jiaotong University, Shanghai, 200030, China

    Zhi Zhang & Pengfei Shi

  2. Institute of Software, The Chinese Academy of Sciences, Beijing, 100080, China

    Haoyang Che

  3. Department of Computer Science, Science & Technology, University of Hong Kong, Hong Kong, China

    Yong Sun & Jun Gu

Authors
  1. Zhi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haoyang Che
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pengfei Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yong Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jun Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA-LIAMA Institute of Automation, Beijing, China

    Stéphane Grumbach

  2. Computer Science and Engineering Department, San Diego, University of California, 92093-0404, La Jolla, CA, USA

    Liying Sui

  3. UC San Diego, USA

    Victor Vianu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Z., Che, H., Shi, P., Sun, Y., Gu, J. (2005). Schema Homomorphism – An Algebraic Framework for Schema Matching. In: Grumbach, S., Sui, L., Vianu, V. (eds) Advances in Computer Science – ASIAN 2005. Data Management on the Web. ASIAN 2005. Lecture Notes in Computer Science, vol 3818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596370_25

Download citation

  • DOI: https://doi.org/10.1007/11596370_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30767-9

  • Online ISBN: 978-3-540-32249-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics