Browse > Article
http://dx.doi.org/10.5391/IJFIS.2003.3.1.032

A XML DTD Matching using Fuzzy Similarity Measure  

Kim, Chang-Suk (Dept. of Multimedia Kongju National University)
Son, Dong-Cheul (Dept. of ICE Cheonan University)
Kim, Dae-Su (Dept. of Computer Science Hanshin University)
Publication Information
International Journal of Fuzzy Logic and Intelligent Systems / v.3, no.1, 2003 , pp. 32-36 More about this Journal
Abstract
An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.
Keywords
XML; DTD; Schema Matching; Similarity Measure; Information Integration;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Doan, P. Domingos and A. Levy, Learning Source Descriptions for Data Integration , Proc. on WebDB2000, PP. 81-86, 2000
2 D. Lee and W. Chu, Constraints-preserving Transformation from XML Document Type Definition to Relational Schema , UCLA-CS-TR-200001, 2001
3 P. Wood, Optimizing Web Queries Using DocumentType Definitions, Proc. Intl Workshop on WebInformation and Data Management, PP. 1-5, 1999
4 W. Li and C. Clifton, SEMINT: A tool for identifying attribute correspondences in heterogeneous databasesusing neural networks , Data & KnowIwdge Engineering 33, PP. 49-84, 2000   DOI   ScienceOn
5 J. Shanmugasundaram, K. Tufte, G. He, C. Zhang, D.Dewitt and J. Naughton, Relational Databases for Querying XML Documents: Limitations and Opportunities, Proc. on VLDB, Edinburgh, Scotland,pp. 302 314, 1999
6 P. Wood, Rewriting XQL Queries on XMLRepositories, Proc. $17^{th}$ British National Conf. On Databases, PP. 209-226, 2000
7 A. Deutsch, M. Femandez and D. Suciu, StoringSemistructured Data with STORED , Proc. onSIGMOD, Philadelphia, USA., 1998
8 C. S. Kim, A Complex Matching of XML Schema,Proc. of the 20th International Conferenceon Internet Computing, Las Vegas, Nevada, U. S. A., CSREAPress, pp.484-489, 2002
9 C. S. Kim, Systematic Generation Method and Efficient Representation of Proximity Relations for Fuzzy Relational Database Systems, Proc. of the 20th EUROMICRO Conference, Liverpool, England, IEEE Computer Society Press, PP.549-555, 1994
10 T. Milo and S. Zohar, Using Schema Matching to Simplify Heterogeneous Data Translation , Proc. on VLDB, New York, USA, PP. 122-133, 1998