Skip to main content

Pre-matching: Large XML Schemas Decomposition Approach

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2009 Workshops (OTM 2009)

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

  • 1217 Accesses

Abstract

We propose a decomposition approach, as a pre-matching phase, which break down large XML schemas into smaller sub-schemas to improve the quality of large schema matching. Our approach identifies and extracts common structures between and within XML schemas (inter and intra-schemas) and finds the sub-schemas candidates for matching.

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

Access this chapter

Institutional subscriptions

Similar content being viewed by others

References

  1. Do, H.H., Rahm, E.: Matching large schemas: Approaches and evaluation. Journal of Information Systems, 857–885 (2007)

    Google Scholar 

  2. Termier, A., Rousset, M.A., Sebag, M.: DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), pp. 543–546 (2004)

    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 paper

Cite this paper

Sellami, S., Benharkat, AN., Amghar, Y. (2009). Pre-matching: Large XML Schemas Decomposition Approach. In: Meersman, R., Herrero, P., Dillon, T. (eds) On the Move to Meaningful Internet Systems: OTM 2009 Workshops. OTM 2009. Lecture Notes in Computer Science, vol 5872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05290-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05290-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-05290-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics