Skip to main content

Non-binary Evaluation for Schema Matching

  • Conference paper
Book cover Conceptual Modeling (ER 2012)

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

Included in the following conference series:

Abstract

In this work we extend the commonly used binary evaluation of schema matching to support evaluation methods for non-binary matching results as well. We motivate our work with some new applications of schema matching. Non-binary evaluation is formally defined together with two new, non-binary evaluation measures using a vector-space representation of schema matching outcome. We provide an empirical evaluation to support the usefulness of non-binary evaluation and show its superiority to its binary counterpart.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Li, W., Clifton, C.: Semint: A tool for identifying attribute correspondences in heterogeneous databases using neural networks. Data and Knowledge Engineering 33(1), 49–84 (2000)

    Article  MATH  Google Scholar 

  2. Duchateau, F., Bellahsene, Z., Coletta, R.: A Flexible Approach for Planning Schema Matching Algorithms. In: Meersman, R., Tari, Z. (eds.) OTM 2008, Part I. LNCS, vol. 5331, pp. 249–264. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Tu, K., Yu, Y.: CMC: Combining Multiple Schema-Matching Strategies Based on Credibility Prediction. In: Zhou, L.-Z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 888–893. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Mao, M., Peng, Y., Spring, M.: A harmony based adaptive ontology mapping approach. In: Proc. of SWWS (2008)

    Google Scholar 

  5. Lee, Y., Sayyadian, M., Doan, A.H., Rosenthal, A.S.: eTuner: tuning schema matching software using synthetic scenarios. The VLDB Journal 16(1), 97–122 (2007)

    Article  Google Scholar 

  6. Algergawy, A., Nayak, R., Saake, G.: XML Schema Element Similarity Measures: A Schema Matching Context. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2009, Part II. LNCS, vol. 5871, pp. 1246–1253. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Gal, A., Sagi, T.: Tuning the ensemble selection process of schema matchers. Information Systems 35(8), 845–859 (2010)

    Article  Google Scholar 

  8. Gal, A.: Uncertain schema matching. Synthesis Lectures on Data Management 3(1), 1–97 (2011)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. Zobel, J., Moffat, A.: Exploring the similarity space. SIGIR Forum 32, 18–34 (1998)

    Article  Google Scholar 

  11. Dong, X., Halevy, A., Yu, C.: Data integration with uncertainty. The VLDB Journal 18, 469–500 (2009)

    Article  Google Scholar 

  12. Gal, A., Martinez, M., Simari, G., Subrahmanian, V.: Aggregate query answering under uncertain schema mappings. In: ICDE, pp. 940–951 (2009)

    Google Scholar 

  13. Gal, A., Modica, G., Jamil, H., Eyal, A.: Automatic ontology matching using application semantics. AI Magazine 26(1), 21 (2005)

    Google Scholar 

  14. Marie, A., Gal, A.: On the stable marriage of maximum weight royal couples. In: Proceedings of AAAI Workshop on Information Integration on the Web (2007)

    Google Scholar 

  15. Berlin, J., Motro, A.: Autoplex: Automated Discovery of Content 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 

  16. Modica, G., Gal, A., Jamil, H.: The Use of Machine-Generated Ontologies in Dynamic Information Seeking. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 433–447. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Mena, E., Kashyap, V., Illarramendi, A., Sheth, A.P.: Imprecise answers in distributed environments: Estimation of information loss for multi-ontology based query processing. Int. J. Cooperative Inf. Syst. 9(4), 403–425 (2000)

    Article  Google Scholar 

  18. Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In: ICDE, pp. 117–128. IEEE (2002)

    Google Scholar 

  19. Duchateau, F., Bellahsene, Z., Coletta, R.: Matching and Alignment: What Is the Cost of User Post-Match Effort? In: Meersman, R., Dillon, T., Herrero, P., Kumar, A., Reichert, M., Qing, L., Ooi, B.-C., Damiani, E., Schmidt, D.C., White, J., Hauswirth, M., Hitzler, P., Mohania, M. (eds.) OTM 2011, Part I. LNCS, vol. 7044, pp. 421–428. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  20. Euzenat, J.: Semantic precision and recall for ontology alignment evaluation. In: Proc. IJCAI, pp. 348–353 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sagi, T., Gal, A. (2012). Non-binary Evaluation for Schema Matching. In: Atzeni, P., Cheung, D., Ram, S. (eds) Conceptual Modeling. ER 2012. Lecture Notes in Computer Science, vol 7532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34002-4_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34002-4_37

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics