Skip to main content

Complex Schema Match Discovery and Validation through Collaboration

  • Conference paper

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

Abstract

In this paper, we demonstrate an approach for the discovery and validation of n:m schema match in the hierarchical structures like the XML schemata. Basic idea is to propose an n:m node match between children (leaf nodes) of two matching non-leaf nodes of the two schemata. The similarity computation of the two non-leaf nodes is based upon the syntactic and linguistic similarity of the node labels supported by the similarity among the ancestral paths from nodes to the root. The n:m matching proposition is then validated with the help of the mini-taxonomies: hierarchical structures extracted from a large set of schema trees belonging to the same domain. The technique intuitively supports the collective intelligence of the domain users, indirectly collaborating for the validation of the complex match propositions.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

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

  3. Embley, D.W., Xu, L., Ding, Y.: Automatic Direct and Indirect Schema Mapping: Experiences and Lessons Learned. ACM SIGMOD Record 33(4), 14–19 (2004)

    Article  Google Scholar 

  4. 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, pp. 61–75. Springer, Heidelberg (2004)

    Google Scholar 

  5. He, B., Chang, K.C.-C., Han, J.: Discovering complex matchings across web query interfaces: a correlation mining approach. In: KDD, pp. 148–157 (2004)

    Google Scholar 

  6. Lee, D., Mani, M., Chiu, F., Chu, W.W.: Net Cot: Translating relational schemas to XML schemas using semantic constraints. In: CIKM (2002)

    Google Scholar 

  7. Melnik, S., Rahm, E., Bernstein, P.A.: RONDO: A Programming Platform for Generic Model Management. In: SIGMOD, pp. 193–204 (2003)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Saleem, K., Bellahsene, Z.: Automatic extraction of structurally coherent mini-taxonomies. In: ER (2008)

    Google Scholar 

  10. Saleem, K., Bellahsene, Z., Hunt, E.: PORSCHE: Performance ORiented SCHEma mediation. Information Systems - Elsevier 33(7-8), 637–657 (2008)

    Google Scholar 

  11. Wang, G., Zavesov, V., Rifaieh, R., Rajasekar, A., Goguen, J., Miller, M.: Towards User Centric Schema Mapping Platform. In: VLDB Workshop Semantic Data and Semantic Integration (2007)

    Google Scholar 

  12. Zaki, M.J.: Efficiently Mining Frequent Embedded Unordered Trees. Fundamenta Informaticae 66(1-2), 33–52 (2005)

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

Saleem, K., Bellahsene, Z. (2009). Complex Schema Match Discovery and Validation through Collaboration. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2009. OTM 2009. Lecture Notes in Computer Science, vol 5870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05148-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05148-7_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05147-0

  • Online ISBN: 978-3-642-05148-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics