CFP last date
20 May 2024
Reseach Article

Article:XML Schema Matching - Using Structural Information

by A.Rajesh, S.K.Srivatsa
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 8 - Number 2
Year of Publication: 2010
Authors: A.Rajesh, S.K.Srivatsa
10.5120/1183-1632

A.Rajesh, S.K.Srivatsa . Article:XML Schema Matching - Using Structural Information. International Journal of Computer Applications. 8, 2 ( October 2010), 34-41. DOI=10.5120/1183-1632

@article{ 10.5120/1183-1632,
author = { A.Rajesh, S.K.Srivatsa },
title = { Article:XML Schema Matching - Using Structural Information },
journal = { International Journal of Computer Applications },
issue_date = { October 2010 },
volume = { 8 },
number = { 2 },
month = { October },
year = { 2010 },
issn = { 0975-8887 },
pages = { 34-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume8/number2/1183-1632/ },
doi = { 10.5120/1183-1632 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:57:01.605350+05:30
%A A.Rajesh
%A S.K.Srivatsa
%T Article:XML Schema Matching - Using Structural Information
%J International Journal of Computer Applications
%@ 0975-8887
%V 8
%N 2
%P 34-41
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Schema matching is the task of finding semantic correspondences between elements of two schemas. It takes two schemas as input and returns a mapping that identifies corresponding elements in the two schemas. Schema matching is an important and vital step in many schema and data translation and integration applications, such as integration of web data sources, data warehousing, XML message mapping etc. In this paper, we describe different characteristics exhibited by matching element pairs at various levels in the XML schema and propose a system which uses these characteristics to perform the matching process. The novelty in the system is the architecture of the system which comprises of a linguistic matcher in combination with a set of filters operating based on the level of the element pairs to be matched in the source and target XML schemas.

References
  1. Bergamaschi, S., Castano, S., Vincini, M., Beneventano, D., “Semantic Integration of Heterogeneous Information Sources,” Data & Knowledge Engineering, vol. 36, no. 3, pp. 215–249, 2001.
  2. Bright, M.W., Hurson, A.R., and Pakzad, S. H., “Automated Resolution of Semantic Heterogeneity in Multidatabases,” in the proceddings of TODS, vol.19, no. 2, pp. 212–253, 1994.
  3. Berlin, J., and Motro, A., “AutoPlex: Automated Discovery of Content for Virtual Databases,” in the proceedings of CoopIS, pp.108–122, 2001.
  4. Hong Hai Do and Rahm, E., “COMA - A System for Flexible Combination of Schema Matching Approaches,” in the proceedings of Int. Conference on Very Large Data Bases, 2002.
  5. Li, W., Clifton, C., “SEMINT: A tool for identifying attribute correspondences in heterogeneous databases using neural networks,” Data & Knowledge Engineering, vol. 33, no. 1, pp. 49-84, 2000.
  6. Madhavan, J., Bernstein, P., and Rahm, E., “Generic Schema Matching with Cupid,” in the proceedings of Int. Conference on Very Large Data Bases, pp. 49–58, 2001.
  7. Melnik, S., Garcia-Molina, H., Rahm, E., “Similarity Flooding: A Versatile Graph Matching Algorithm,” in the proceedings of ICDE, 2002.
  8. Miller, R.J., et a, “The Clio Project: Managing Heterogeneity,” SIGMOD Record vol. 30, no. 1, pp. 78-83, 2001.
  9. Naiyana Tansalarak, Kajal T. Claypool, “Qmatch – Using paths to match XML Schemas,” Data & Knowledge Engineering, vol. 60, pp. 260 – 282, 2007.
  10. Rahm, E., Bernstein, P.A., “A Survey of Approaches to Automatic Schema Matching,” VLDB Journal, vol. 10, no. 4, 2001.
Index Terms

Computer Science
Information Sciences

Keywords

Schema Matching Hybrid Schema Matching Schema Integration XML Schema Matching XML Schema Integration Semantic Matching