Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3290))

  • 887 Accesses

Abstract

Schema matching is a key operation in meta-information applications. In this paper, we propose a new efficient schema matching algorithm to find both direct element correspondences and indirect element correspondences. Our algorithm sufficiently exploits semantic, structure and instance information of two schemas. It has advantages of various kinds of algorithms and hence a learning methodism.

This work has been partially supported by The National High Technology Research and Development Program of China (863 Program) under contract 2002AA4Z3430.

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

Access this chapter

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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yan, L.L., Miller, R.J., Haas, L.M., Fagin, R.: Data-Driven Understanding and Refinement of Schema Mappings. In: SIGMOD (2001)

    Google Scholar 

  2. Miller, R.J., et al.: The Clio Project: Managing Heterogeneity. SIGMOD Record 30(1), 78–83 (2001)

    Article  Google Scholar 

  3. H. H., D., Rahm, E.: COMA – A System for Flexible Combination of Schema Matching Approach. VLDB (2002)

    Google Scholar 

  4. Madhavan, J., Bernstein, P.A., Rahm, E.: Generic Schema Matching with Cupid. VLDB, 49–58 (2001)

    Google Scholar 

  5. Li, W.S., Clifton, C.: Semantic Integration in Heterogeneous Databases Using Neural Networks. VLDB (1994)

    Google Scholar 

  6. Li, W.S., Clifton, C.: SemInt: A Tool for Identifying Attribute Correspondences in Heterogeneous Databases Using Neural Network. Data and Knowledge Engineering, 49–84 (2000)

    Google Scholar 

  7. Li, W.S., Clifton, C., Liu, S.Y.: Database Integration Using Neural Networks: Implementation and Experiences. Knowledge and Information Systems (2000)

    Google Scholar 

  8. Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm. ICDE (2002)

    Google Scholar 

  9. Mitra, P., Wiederhold, G., Jannink, J.: Semiautomatic integration of knowledge sources. In: Proceeding of Fusion 1999, Sunnyvale, USA (1999)

    Google Scholar 

  10. Mitra, P., Wiederhold, G., Kersten, M.: A graph oriented model for articulation of ontology interdependencies. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 86–100. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Doan, A.H., Domingos, P., Halevy, A.Y.: Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach. In: SIGMOD Conference (2001)

    Google Scholar 

  12. Kang, J., Naughton, J.F.: On schema matching with opaque column names and data values. In: International Conference on Management of Data and Symposium on Principles of Database Systems and Proceedings of the 2003 ACM SIGMOD international conference on Management of data San Diego, California (2003)

    Google Scholar 

  13. Rahm, E., Bernstein, P.A.: A Survey of Approaches to Automatic Schema Matching. VLDB Journal (2001)

    Google Scholar 

  14. Do, H.-H., Melnik, S., Rahm, E.: Comparison of Schema Matching Evaluations. evaluations. In: Proceedings of the 2nd Int. Workshop on Web Databases (German Informatics Society) (2002)

    Google Scholar 

  15. Xu, L., Embley, D.W.: Discovering Direct and Indirect Matches for Schema Elements. In: Eigthth International Conference on Database Systems for Advanced Applications, DASFAA 2003 (2003)

    Google Scholar 

  16. Wang, G., Goguen, J., Nam, Y.-K., Lin, K.: Critical Points for Interactive Schema Matching. In: Proceedings of the Sixth Asia Pacific Web Conference, Hangzhou, China (2004)

    Google Scholar 

  17. Palopoli, L., Teracina, G., Ursino, D.: The system DIKE: Towards the semi-automatic synthesis of cooperative information systems and data warehouses. In: Proceedings of ADBIS-DASFAA, pp. 108–117 (2000)

    Google Scholar 

  18. http://www.w3.org/TR/rdf-concepts/

  19. Doan, A., Madhavan, J., Domingos, P., Halevy, A.Y.: Learning to Map between Ontologies on the Semantic Web. In: Proceedings of the 11th International World Wide Web Conference, WWW (2002)

    Google Scholar 

  20. Milo, T., Zohar, S.: Using Schema Matching to Simplify Heterogeneous Data Translation. VLDB, 122–133 (1998)

    Google Scholar 

  21. Wordnet 2.0, http://www.cogsci.princeton.edu/~wn/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, S., Han, Z., Le, J. (2004). A Flexible and Composite Schema Matching Algorithm. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. OTM 2004. Lecture Notes in Computer Science, vol 3290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30468-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30468-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23663-4

  • Online ISBN: 978-3-540-30468-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics