Skip to main content
SpringerLink
Log in

A Flexible Approach for Planning Schema Matching Algorithms

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

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

Abstract

Most of the schema matching tools are assembled from multiple match algorithms, each employing a particular technique to improve matching accuracy and making matching systems extensible and customizable to a particular domain. The solutions provided by current schema matching tools consist in aggregating the results obtained by several match algorithms to improve the quality of the discovered matches. However, aggregation entails several drawbacks. Recently, it has been pointed out that the main issue is how to select the most suitable match algorithms to execute for a given domain and how to adjust the multiple knobs (e.g. threshold, performance, quality, etc.). In this article, we present a novel method for selecting the most appropriate schema matching algorithms. The matching engine makes use of a decision tree to combine the most appropriate match algorithms. As a first consequence of using the decision tree, the performance of the system is improved since the complexity is bounded by the height of the decision tree. Thus, only a subset of these match algorithms is used during the matching process. The second advantage is the improvement of the quality of matches. Indeed, for a given domain, only the most suitable match algorithms are used. The experiments show the effectiveness of our approach w.r.t. other matching tools.

Supported by ANR Research Grant ANR-05-MMSA-0007.

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

Access this chapter

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 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. The UIUC web integration repository. Computer Science Department, University of Illinois at Urbana-Champaign (2003), http://metaquerier.cs.uiuc.edu/repository

  2. Aumueller, D., Do, H.H., Massmann, S., Rahm, E.: Schema and ontology matching with coma++. In: SIGMOD Conference, Demo paper, pp. 906–908 (2005)

    Google Scholar 

  3. Avesani, P., Giunchiglia, F., Yatskevich, M.: A large scale taxonomy mapping evaluation. In: International Semantic Web Conference, pp. 67–81 (2005)

    Google Scholar 

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

    Article  Google Scholar 

  5. Berlin, J., Motro, A.: Automated discovery of contents for virtual databases. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 108–122. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Berlin, J., Motro, A.: Database schema matching using machine learning with feature selection. In: CAiSE (2002)

    Google Scholar 

  7. Bozovic, N., Vassalos, V.: Two-phase schema matching in real world relational databases. In: Data Engineering Workshop, ICDE

    Google Scholar 

  8. Do, H.H., Melnik, S., Rahm, E.: Comparison of schema matching evaluations. In: IWWD (2003)

    Google Scholar 

  9. Do, H.H., Rahm, E.: Coma - a system for flexible combination of schema matching approaches. In: VLDB, pp. 610–621 (2002)

    Google Scholar 

  10. Doan, A., Domingos, P., Halevy, A.Y.: Reconciling schemas of disparate data sources: a machine-learning approach. In: SIGMOD, pp. 509–520 (2001)

    Google Scholar 

  11. Doan, A., Madhavan, J., Dhamankar, R., Domingos, P., Halevy, A.Y.: Learning to match ontologies on the semantic web. VLDB J. 12(4), 303–319 (2003)

    Article  Google Scholar 

  12. Doan, A., Madhavan, J., Domingos, P., Halevy, A.: Ontology matching: A machine learning approach. In: Handbook on Ontologies, International Handbooks on IS (2004)

    Google Scholar 

  13. Drumm, C., Schmitt, M., Do, H.H., Rahm, E.: Quickmig: automatic schema matching for data migration projects. In: CIKM, pp. 107–116. ACM, New York (2007)

    Google Scholar 

  14. Duchateau, F., Bellahsène, Z., Hunt, E.: Xbenchmatch: a benchmark for xml schema matching tools. In: VLDB Proceedings, pp. 1318–1321. VLDB Endowment (2007)

    Google Scholar 

  15. Duchateau, F., Bellahsene, Z., Roche, M.: A context-based measure for discovering approximate semantic matching between schema elements. In: RCIS (2007)

    Google Scholar 

  16. Ehrig, M., Staab, S., Sure, Y.: Bootstrapping ontology alignment methods with apfel. In: ISWC (2005)

    Google Scholar 

  17. Embley, D.W., Xu, L., Ding, Y.: Automatic direct and indirect schema mapping: Experiences and lessons learned. SIGMOD Record journal 33(4), 14–19 (2004)

    Article  Google Scholar 

  18. Euzenat, J., Shvaiko, P.: Ontology matching. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  19. Gal, A.: The generation y of xml schema matching (panel description). In: XSym, pp. 137–139 (2007)

    Google Scholar 

  20. Giunchiglia, F., Shvaiko, P., Yatskevich, M.: S-match: an algorithm and an implementation of semantic matching. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol. 3053. Springer, Heidelberg (2004)

    Google Scholar 

  21. Hammer, J., Stonebraker, M., Topsakal, O.: Thalia: Test harness for the assessment of legacy information integration approaches. In: Proceedings of ICDE, pp. 485–486 (2005)

    Google Scholar 

  22. Lee, Y., Sayyadian, M., Doan, A., Rosenthal, A.: Etuner: tuning schema matching software using synthetic scenarios. VLDB J. 16(1), 97–122 (2007)

    Article  Google Scholar 

  23. Li, C., Clifton, C.: Semantic integration in hetrogeneous databases using neural networks. In: VLDB (1994)

    Google Scholar 

  24. Madhavan, J., Bernstein, P.A., Rahm, E.: Generic schema matching with cupid. In: VLDB, pp. 49–58 (2001)

    Google Scholar 

  25. Marie, A., Gal, A.: Managing uncertainty in schema matcher ensembles. In: Prade, H., Subrahmanian, V.S. (eds.) SUM 2007. LNCS (LNAI), vol. 4772, pp. 60–73. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Melnik, S., Molina, H.G., Rahm, E.: Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In: Data Engineering, pp. 117–128 (2002)

    Google Scholar 

  27. Meo, P.D., Quattrone, G., Terracina, G., Ursino, D.: Integration of xml schemas at various severity levels. Information Systems, 397–434 (2006)

    Google Scholar 

  28. Milo, T., Zohar, S.: Using schema matching to simplify heterogeneous data translation. In: VLDB, pp. 122–133 (1998)

    Google Scholar 

  29. Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81–106 (1987)

    Google Scholar 

  30. Quinlan, J.R.: Improved use of continuous attributes in c4.5. Journal of Artificial Intelligence Research 4, 77–90 (1996)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  32. Secondstring, http://secondstring.sourceforge.net/

  33. Shvaiko, P., Euzenat, J.: A survey of schema-based matching approaches. J. Data Semantics IV, 146–171 (2005)

    Google Scholar 

  34. Spaccapietra, S., Parent, C., Dupont, Y.: Model independent assertions for integration of hetrogeneous schemas. In: VLDB, pp. 81–126 (1992)

    Google Scholar 

  35. Wordnet (2007), http://wordnet.princeton.edu

Download references

Author information

Authors and Affiliations

  1. LIRMM, Université Montpellier 2, 161 rue Ada, 34000, Montpellier

    Fabien Duchateau, Zohra Bellahsene & Remi Coletta

Authors
  1. Fabien Duchateau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zohra Bellahsene
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Remi Coletta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. STARLab, Bldg G/10, Vrije Universiteit Brussel (VUB), Pleinlaan 2, 1050, Brussels, Belgium

    Robert Meersman

  2. School of Computer Science and Information Technology, Bld 10.10, RMIT University, 376-392 Swanston Street, VIC 3001, Melbourne, Australia

    Zahir Tari

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duchateau, F., Bellahsene, Z., Coletta, R. (2008). A Flexible Approach for Planning Schema Matching Algorithms. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems: OTM 2008. OTM 2008. Lecture Notes in Computer Science, vol 5331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88871-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88871-0_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88870-3

  • Online ISBN: 978-3-540-88871-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation