An experiment on the matching and reuse of XML schemas

Lecture Notes in Computer Science

Volumn 3579, Issue , 2005, Pages 273-284

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

^a UNIVERSITY OF WINDSOR   (Canada)

^b UNIVERSITÉ DE SHERBROOKE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; TREES (MATHEMATICS); WORLD WIDE WEB;

SCHEMA MATCHING; SCHEMA REUSE; XML SCHEMAS;

XML;

EID: 26444508832     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11531371_38     Document Type: Conference Paper

References (28)

1. S. Banerjee, T. Pedersen. Extended Gloss Overlaps as a Measure of Semantic Relatedness. IJCAI, 2003.
2. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett. 1997 18(8), 689-694.
3. H. Bunke, Recent Developments in Graph Matching, Proc. 15th Int. Conf. on Pattern Recognition, Barcelona, 2000, Vol 2, 117-124.
4. P. V. Biron, A. Malhotra (ed.), W3C, April 2000, 'XML Schema Part 2: Datatypes', http://www.w3.org/TR/xmlschema-2/
5. A. Budanitsky, G. Hirst. Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures. In Proceedings of the NAACL 2001 Workshop on WordNet and Other Lexical Resources, Pittsburgh, June 2001.
6. H. Do, E. Rahm. COMA A system for flexible combination of schema matching approaches. VLDB 2002
7. H. Do., S. Melnik, E. Rahm, Comparison of Schema Matching Evaluations, Proc. GI-Workshop "Web and Databases", Erfurt, Oct. 2002.
8. A. Doan, P. Domingos, A. Halevy. Reconciling schemas of disparate data sources: A machine-learning approach. In proc. SIGMOD Conference, 2001
9. Gupta, N. Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21:183-210, 1998
10. HITIS - Hospitality Industry Technology Integration Standard, http://www.hitis.org.
11. A. Hlaoui and S. Wang, "A Node-Mapping-Based Algorithm for Graph Matching", submitted (and revised) to J. Discrete Algorithms 2004.
12. M. Jarmasz, S. Szpakowicz. Roget's Thesaurus and Semantic Similarity. RANLP 2003
13. H. W. KUHN. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2 (1955), 83-97.
14. M. L. Lee, L. H. Yang, W. Hsu, X. Yang. XClust: clustering XML schemas for effective integration. In Proceedings of the eleventh international conference on Information and knowledge management, Pages: 292-299, 2002
15. J. Madhavan, P. A. Bernstein, E. Rahm. Generic schema matching with Cupid. VLDB, 2001.
16. S. Melnik, H. Garcia-Molina, E. Rahm. Similarity flooding: a versatile graph matching algorithm and its application to schema matching. ICDE 2002.
17. A Mili, R Mili, RT Mittermeir, A survey of software reuse libraries, Annals of Software Engineering, 1998.
18. E. Rahm, P. A. Bernstein. A survey of approaches to automatic schema matching. VLDB J., 10(4):334-350, 2001.
19. D. Shasha, J. Wang, K. Zhang, F. Y. Shih. Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man, and Cybernetics. Vol 24, NO.4, April 1994.
20. D. Shasha, J. T. L. Wang, R. Giugno, Algorithmics and Applications of Tree and Graph Searching, In Proc. PODS'02, June 3-5 2002.
21. H. Su, S. Padmanabhan, M. Lo. Identification of syntactically similar DTD Elements for schema matching. WAIM, 2001.
22. K. Sycara, M. Klusch, S. Widoff, J. Lu, Dynamic Service Matchmaking among Agents in Open Information Environments, Journal of ACM SIGMOD Record, 28(1):47-53, 1999.
23. H. S. Thompson, D. Beech, M. Maloney, N. Mendelsohn (ed.), W3C, April 2000, 'XML Schema Part 1: Structures', http://www.w3.org/TR/xmlschema-1/.
24. J. Wang, B. A. Shapiro, D. Shasha, K. Zhang, K. M. Currey. An algorithm for finding the largest approximately common substructures of two trees. IEEE Trans. PAMI 20, 1998, 889-895.
25. Shengrui Wang, Jianguo Lu, Ju Wang, Approximate Common Structures in XML Schema Matching. Submitted.
26. WordNet - a lexical database for English, http://www.cogsci.princeton. edu/~wn/
27. K. Zhang, D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18(6):1245-1263, Dec. 1989.
28. K. Zhang, D. Shasha, J. T. L. Wang, Approximate Tree Matching in the Presence of Variable Length Don't Cares, Journal of Algorithms, 16(1):33-66.