{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:57Z","timestamp":1725566997610},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540279969"},{"type":"electronic","value":"9783540314844"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11531371_38","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T05:28:02Z","timestamp":1285651682000},"page":"273-284","source":"Crossref","is-referenced-by-count":8,"title":["An Experiment on the Matching and Reuse of XML Schemas"],"prefix":"10.1007","author":[{"given":"Jianguo","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengrui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ju","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Banerjee, S., Pedersen, T.: Extended Gloss Overlaps as a Measure of Semantic Relatedness. IJCAI (2003)"},{"issue":"8","key":"38_CR2","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett.\u00a018(8), 689\u2013694 (1997)","journal-title":"Pattern Recognition Lett."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Bunke, H.: Recent Developments in Graph Matching. In: Proc. 15th Int. Conf. on Pattern Recognition, Barcelona, vol.\u00a02, pp. 117\u2013124 (2000)","DOI":"10.1109\/ICPR.2000.906030"},{"key":"38_CR4","unstructured":"Biron, P.V., Malhotra, A. (eds.): W3C, XML Schema Part 2: Datatypes (April 2000), http:\/\/www.w3.org\/TR\/xmlschema-2\/"},{"key":"38_CR5","unstructured":"Budanitsky, A., Hirst, G.: Semantic distance in WordNet: An experimental, applicationoriented evaluation of five measures. In: Proceedings of the NAACL 2001 Workshop on WordNet and Other Lexical Resources, Pittsburgh (June 2001)"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Do, H., Rahm, E.: COMA A system for flexible combination of schema matching approaches. In: VLDB 2002 (2002)","DOI":"10.1016\/B978-155860869-6\/50060-3"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Do, H., Melnik, S., Rahm, E.: Comparison of Schema Matching Evaluations. In: Proc. GI-Workshop Web and Databases, Erfurt (October 2002)","DOI":"10.1007\/3-540-36560-5_17"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Doan, A., Domingos, P., Halevy, A.: Reconciling schemas of disparate data sources: A machine- learning approach. In: Proc. SIGMOD Conference (2001)","DOI":"10.1145\/375663.375731"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/PL00009212","volume":"21","author":"Gupta","year":"1998","unstructured":"Gupta, Nishimura, N.: Finding largest subtrees and smallest supertrees. Algorithmica\u00a021, 183\u2013210 (1998)","journal-title":"Algorithmica"},{"key":"38_CR10","unstructured":"HITIS - Hospitality Industry Technology Integration Standard, http:\/\/www.hitis.org"},{"key":"38_CR11","unstructured":"Hlaoui, A., Wang, S.: A Node-Mapping-Based Algorithm for Graph Matching, submitted (and revised) to J. Discrete Algorithms (2004)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Jarmasz, M., Szpakowicz, S.: Roget\u2019s Thesaurus and Semantic Similarity. In: RANLP 2003 (2003)","DOI":"10.1075\/cilt.260.12jar"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Lee, M.L., Yang, L.H., Hsu, W., Yang, X.: XClust: clustering XML schemas for effective integration. In: Proceedings of the eleventh international conference on Information and knowledge management, pp. 292\u2013299 (2002)","DOI":"10.1145\/584792.584841"},{"key":"38_CR15","unstructured":"Madhavan, J., Bernstein, P.A., Rahm, E.: Generic schema matching with Cupid. In: VLDB (2001)"},{"key":"38_CR16","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: ICDE (2002)"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Mili, A., Mili, R., Mittermeir, R.T.: A survey of software reuse libraries. Annals of Software Engineering (1998)","DOI":"10.1023\/A:1018964121953"},{"issue":"4","key":"38_CR18","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s007780100057","volume":"10","author":"E. Rahm","year":"2001","unstructured":"Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB J.\u00a010(4), 334\u2013350 (2001)","journal-title":"VLDB J."},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J., Zhang, K., Shih, F.Y.: Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man, and Cybernetics\u00a024(4) (April 1994)","DOI":"10.1109\/21.286387"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and Applications of Tree and Graph Searching. In: Proc. PODS 2002, June 3-5 (2002)","DOI":"10.1145\/543613.543620"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-47714-4_14","volume-title":"Advances in Web-Age Information Management","author":"H. Su","year":"2001","unstructured":"Su, H., Padmanabhan, S., Lo, M.: Identification of syntactically similar DTD Elements for schema matching. In: Wang, X.S., Yu, G., Lu, H. (eds.) WAIM 2001. LNCS, vol.\u00a02118, p. 145. Springer, Heidelberg (2001)"},{"issue":"1","key":"38_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/309844.309895","volume":"28","author":"K. Sycara","year":"1999","unstructured":"Sycara, K., Klusch, M., Widoff, S., Lu, J.: Dynamic Service Matchmaking among Agents in Open Information Environments. Journal of ACM SIGMOD Record\u00a028(1), 47\u201353 (1999)","journal-title":"Journal of ACM SIGMOD Record"},{"key":"38_CR23","unstructured":"Thompson, H.S., Beech, D., Maloney, M., Mendelsohn, N. (eds.): W3C, XML Schema Part 1: Structures (April 2000), http:\/\/www.w3.org\/TR\/xmlschema-1\/"},{"key":"38_CR24","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/16.662797","volume":"20","author":"J. Wang","year":"1998","unstructured":"Wang, J., Shapiro, B.A., Shasha, D., Zhang, K., Currey, K.M.: An algorithm for finding the largest approximately common substructures of two trees. IEEE Trans. PAMI\u00a020, 889\u2013895 (1998)","journal-title":"IEEE Trans. PAMI"},{"key":"38_CR25","unstructured":"Wang, S., Lu, J., Wang, J.: Approximate Common Structures in XML Schema Matching (submitted)"},{"key":"38_CR26","unstructured":"WordNet\u2013a lexical database for English, http:\/\/www.cogsci.princeton.edu\/~wn\/"},{"issue":"6","key":"38_CR27","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing\u00a018(6), 1245\u20131263 (1989)","journal-title":"SIAM Journal of Computing"},{"key":"38_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, K., Shasha, D., Wang, J.T.L.: Approximate Tree Matching in the Presence of Variable Length Don\u2019t Cares. Journal of Algorithms\u00a016(1), 33\u201366","DOI":"10.1006\/jagm.1994.1003"}],"container-title":["Lecture Notes in Computer Science","Web Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11531371_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:57Z","timestamp":1605643737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11531371_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540279969","9783540314844"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11531371_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}