Abstract
Similarity plays a crucial role in many research fields. Similarity serves as an organization principle by which individuals classify objects, form concepts. Similarity can be computed at different layers of abstraction: at data layer, at type layer or between the two layers (i.e. similarity between data and types). In this paper we propose an algorithm context path similarity, which captures the degree of similarity in the paths of two elements. In our approach, this similarity contributes to determine the structural similarity measure between XML schemas, in the domain of schema matching. We essentially focus on how to maximize the use of structural information to derive mappings between source and target XML schemas. For this, we adapt several existing algorithms in many fields, dynamic programming, data integration, and query answering to serve computing similarities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Cluet, S., Milo, T.: Correspondence and Translation for heterogeneous data. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 351–363. Springer, Heidelberg (1996)
Amer-Yahia, A., Cho, S., Srivastava, D.: Tree Pattern Relaxation. In: Proceedings of DBT 2002 (2002)
Carmel, D., Efraty, G., Landau, G.M., Maarek, Y.S., Mass, Y.: An Extension of the vector space model for querying XML documents via XML fragments. In: XML and IR Workshop, 2nd edn., SIGIR Forum (2002)
Castano, S., De Antonellis, V.: A schema analysis and Reconciliation Tool Environment For Heterogeneous Databases. In: Proceedings of International Database Engineering and Applications Symposium (1999)
Doan, A., Madhavan, J., Domingos, P., Halevey, A.: Reconciling schemas of disparate data sources: A machine Learning Approach. In: Proceedings ACM SIGMOD conference, pp. 509–520 (2001)
Drew, P., King, R., McLeod, D., Rusinkiewicz, M., Silberschatz, A.: Report of the Workshop on Semantic Heterogeneity and Interoperation in Multidatabase Systems. In: Proceedings ACM SIGMOD record, pp. 47–56 (1993)
Hirschberg, D.S.: A Linear Space Algorithm for Computing Maximal Common Subsequences. Communications of the ACM (1975)
Li, W.S., Clifton, C.: Semantic Integration in Heterogeneous Databases Using Neural Networks. VLDB (1994)
Li, W.S., Clifton, C.: SemInt: A Tool for Identifying Attribute Correspondences in Heterogeneous Databases Using Neural Network. Data and Knowledge Engineering (2000)
Madhavan, J., Bernstein, P., Rahm, E.: Generic schema matching with cupid. VLDB (2001)
Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A versatile Graph Matching and its Application to Schema Matching. Data Engineering (2002)
Miller, A.G., Hass, L., Hernandez, M.A.: Schema mapping as query discovery. VLDB, 77–88 (2000)
Rahm, E., Bernstein, P.: A survey of approaches to automatic schema matching. VLDB Journal, 334–350 (2001)
XML Schema, W3C Recommendation, XML-Schema Primer, W3 Consortium (2001), http://www.w3.org/TR/xmlschema-0
Zerdazi, A., Lamolle, M.: Modélisation des schémas XML par adjonction de métaconnaissances sémantiques. In: ASTI 2005 (2005)
Zerdazi, A., Lamolle, M.: Matching of Enhanced XML Schema with a measure of structural-context similarity. In: Proceeding of The 3rd International Conference on Web Information Systems and Technologies, WEBIST 2007 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zerdazi, A., Lamolle, M. (2008). Computing Path Similarity Relevant to XML Schema Matching. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2008 Workshops. OTM 2008. Lecture Notes in Computer Science, vol 5333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88875-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-88875-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88874-1
Online ISBN: 978-3-540-88875-8
eBook Packages: Computer ScienceComputer Science (R0)