XML schema matching

International Journal of Software Engineering and Knowledge Engineering

Volumn 17, Issue 5, 2007, Pages 575-597

  Lu, Jianguo ^a   Wang, Ju ^b   Wang, Shengrui ^c  

^a UNIVERSITY OF WINDSOR   (Canada)

^b Open Text Corporation Canada   (Canada)

^c UNIVERSITÉ DE SHERBROOKE   (Canada)

Author keywords

Data integration; Schema matching; Software component search; Software reuse; Tree matching algorithm; XML schema

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE REUSABILITY; DATA ACQUISITION; PROBLEM SOLVING; TREES (MATHEMATICS);

DATA INTEGRATION; SCHEMA MATCHING; SOFTWARE COMPONENT SEARCH; TREE MATCHING ALGORITHM;

XML;

EID: 36549017093     PISSN: 02181940     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218194007003446     Document Type: Article

References (36)

1. S. Banerjee and T. Pedersen, Extended gloss overlaps as a measure of semantic relatedness, IJCAI 2003.
2. A. Budanitsky and G. Hirst, Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures, in Proc. NAACL 2001 Workshop on WordNet and Other Lexical Resources, Pittsburgh, June 2001.
3. H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Lett. 18(8) (1997) 689-694.
4. H. Bunke, Recent developments in graph matching, in Proc. 15th Int. Conf. on Pattern Recognition, Barcelona, 2000, Vol. 2, pp. 117-124.
5. P. V. Biron and A. Malhotra (eds.), W3C, April 2000, 'XML Schema, Part 2: Datatypes', http://www.w3.org/TR-/xmlschema-2.
6. A. Budanitsky and G. Hirst, Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures, in Proc. NAACL 2001 Workshop on WordNet and Other Lexical Resources, Pittsburgh, June 2001.
7. H. Do and E. Rahm, COMA: A system for flexible combination of schema matching approaches, VLDB 2002.
8. H. Do, S. Melnik, and E. Rahm, Comparison of schema matching evaluations, in Proc. GI-Workshop on Web and Databases, Erfurt, October 2002.
9. A. Doan, P. Domingos, and A. Halevy, Reconciling schemas of disparate data sources: A machine-learning approach, in Proc. SIGMOD Conference, 2001.
10. X. Dong, A. Halevy, J. Madhavan, E. Nemes, and J. Zhang, Similarity search for web services, 30th VLDB Conference, August-September 2004.
11. A. Gupta and N. Nishimura, Finding largest subtrees and smallest supertrees, Algorithmica 21 (1998) 183-210.
12. HITIS -Hospitality Industry Technology Integration Standard, http://www.hitis.org.
13. A. Hlaoui and S. Wang, A Node-Mapping-Based Algorithm for Graph Matching, submitted (and revised), J. Discrete Algorithms.
14. M. Jarmasz and S. Szpakowicz, Roget's Thesaurus and Semantic Similarity, RANLP 2003.
15. H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly 2 (1955) 83-97.
16. M. L. Lee, L. H. Yang, W. Hsu, and X. Yang, XClust: Clustering XML schemas for effective integration, in Proc. 11th Int. Conf. on Information and Knowledge Management, 2002, pp. 292-299.
17. J. Lu, S. Wang, and J. Wang, An experiment on the matching and reuse of XML schemas, 5th Int. Conf. on Web Engineering (ICWE 2005), July 2005, Sydney, pp. 273-284.
18. J. Madhavan, P. A. Bernstein, and E. Rahm, Generic schema matching with Cupid, VLDB 2001.
19. S. Melnik, H. Garcia-Molina, and E. Rahm, Similarity flooding: A versatile graph matching algorithm and its application to schema matching, ICDE 2002.
20. A. Mili, R. Mili, and R. T. Mittermeir, A survey of software reuse libraries, Annals of Software Engineering, 1998.
21. P. Mitra, G. Wiederhold, and M. Kersten, A graph-oriented model for articulation of ontology interdependencies, EDBT 2000, LNCS, Vol. 1777, Springer Verlag, 2000, pp. 86-100.
22. M. Paolucci, T. Kawamura, T. R. Payne, and K. Sycara, Semantic matching of web services capabilities, 1st Int. Semantic Web Conf., 2002, pp. 333-347.
23. E. Rahm and P. A. Bernstein, A survey of approaches to automatic schema matching, VLDB J. 10(4) (2001) 334-350.
24. T. Schilieder and F. Naumann, Approximate tree embedding for querying XML data, ACM SIGIR. 2000 Workshop on XML and Information Retrieval, Athens, Greece, July 28, 2000.
25. D. Shasha, J. Wang, K. Zhang, and F. Y. Shih, Exact and approximate algorithms for unordered tree matching, IEEE Trans. on Systems, Man, and Cybernetics, 24(4) (1994).
26. D. Shasha, J. T. L. Wang, and R. Giugno, Algorithmics and applications of tree and graph searching, in Proc. PODS'02, June 3-5, 2002.
27. H. Su, S. Padmanabhan, and M. Lo, Identification of syntactically similar DTD elements for schema matching, WAIM, 2001.
28. Sun, Java Architecture for XML Binding (JAXB), www.sun.com, 2002.
29. K. Sycara, J. Lu, and M. Klusch, Interoperability among Heterogeneous Software Agents on the Internet, Technical Report CMU-RJ-TR-98-22, CMU, Pittsburgh.
30. H. S. Thompson, D. Beech, M. Maloney, and N. Mendelsohn (eds.), W3C, April 2000, XML Schema Part 1: Structures, http://www.w3.org/TR/xmlschema-1/.
31. J. Wang, B. A. Shapiro, D. Shasha, K. Zhang, and K. M. Currey, An algorithm for finding the largest approximately common substructures of two trees, IEEE Trans. PAMI 20 (1998) 889-895.
32. S. Wang, J. Lu, and J. Wang, Approximate common structure in XML schema matching, WAIM 2005, pp. 900-905.
33. WordNet - a lexical database for English, http://www.cogsci.princeton. edu/~wn/.
34. J. T. Yao and M. Zhang, A fast tree pattern matching algorithm for XML query, in Proc. IEEE/WIC/ACM Int. Conf. on Web Intelligence, Beijing, China, September 20-24, 2004, pp. 235-241.
35. K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Computing 18(6) (1989) 1245-1263.
36. K. Zhang, D. Shasha, and J. T. L. Wang, Approximate tree matching in the presence of variable length don't cares, J. Algorithms 16(1) (1994) 33-66.