Skip to main content

Associativity and Commutativity in Generic Merge

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5600))

Abstract

A model is a formal description of a complex application artifact, such as a database schema, an application interface, a UML model, an ontology, or a message format. The problem of merging such models lies at the core of many meta data applications, such as view integration, mediated schema creation for data integration, and ontology merging. This paper examines the problem of merging two models given correspondences between them. In particular it concentrates on the associativity and commutativity of Merge, which are crucial properties if Merge is to be composed with other operators.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Batini, C., Lenzerini, M., Navathe, S.B.: A comparative analysis of methodologies for database schema integration. ACM Computing Surveys 18(4), 323–364 (1986)

    Article  Google Scholar 

  2. Beeri, C., Milo, T.: Schemas for integration and translation of structured and semi-structured data. In: ICDT, pp. 296–313 (1999)

    Google Scholar 

  3. Bergamaschi, S., Castano, S., Vincini, M.: Semantic integration of semistructured and structured data sources. SIGMOD Record 28(1), 54–59 (1999)

    Article  Google Scholar 

  4. Buneman, P., Davidson, S.B., Kosky, A.: Theoretical aspects of schema merging. In: Pirotte, A., Delobel, C., Gottlob, G. (eds.) EDBT 1992. LNCS, vol. 580, pp. 152–167. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  5. Calvanese, D., De Giacomo, G., Lenzerini, M.: What can knowledge representation do for semi-structured data? In: AAAI (1998)

    Google Scholar 

  6. Doan, A., Halevy, A.: Semantic integration research in the database community: A brief survey. AI Magazine 26(1), 83–94 (2005)

    Google Scholar 

  7. Noy, N.F., Musen, M.A.: Smart: Automated support for ontology merging and alignment. In: Banff Workshop on Knowledge Acquisition, Modeling, and Management (1999)

    Google Scholar 

  8. Noy, N.F., Musen, M.A.: Prompt: Algorithm and tool for ontology merging and alignment. In: AAAI (2000)

    Google Scholar 

  9. Pottinger, R.A., Bernstein, P.A.: Merging models based on given correspondences. In: VLDB, pp. 862–873 (2003)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  11. Spaccapietra, S., Parent, C.: View integration: A step forward in solving structural conflicts. TKDE 6(2), 258–274 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pottinger, R., Bernstein, P.A. (2009). Associativity and Commutativity in Generic Merge. In: Borgida, A.T., Chaudhri, V.K., Giorgini, P., Yu, E.S. (eds) Conceptual Modeling: Foundations and Applications. Lecture Notes in Computer Science, vol 5600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02463-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02463-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics