{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:24Z","timestamp":1725564744007},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540307679"},{"type":"electronic","value":"9783540322498"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596370_9","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T08:20:56Z","timestamp":1132820456000},"page":"90-103","source":"Crossref","is-referenced-by-count":2,"title":["Multi-labeled Graph Matching \u2013 An algorithm Model for Schema Matching"],"prefix":"10.1007","author":[{"given":"Zhi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyang","family":"Che","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengfei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-44751-2_10","volume-title":"Cooperative Information Systems","author":"J. Berlin","year":"2001","unstructured":"Berlin, J., Motro, A.: Autoplex: Automated discovery of content for virtual databases. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol.\u00a02172, pp. 108\u2013122. Springer, Heidelberg (2001)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-44958-2_6","volume-title":"Modeling and Using Context","author":"P. Bouquet","year":"2003","unstructured":"Bouquet, P., Magnini, B., Serafini, L., Zanobini, S.: A SAT-based algorithm for context matching. In: Blackburn, P., Ghidini, C., Turner, R.M., Giunchiglia, F. (eds.) CONTEXT 2003. LNCS(LNAI), vol.\u00a02680, pp. 66\u201379. Springer, Heidelberg (2003)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45006-8_9","volume-title":"Case-Based Reasoning Research and Development","author":"P.-A. Champin","year":"2003","unstructured":"Champin, P.-A., Solnon, C.: Measuring the similarity of labeled graphs. In: Ashley, K.D., Bridge, D.G. (eds.) ICCBR 2003. LNCS(LNAI), vol.\u00a02689, pp. 80\u201395. Springer, Heidelberg (2003)"},{"key":"9_CR4","unstructured":"Cohen, W.W., Ravikumar, P., Fienberg, S.E.: A Comparison of String Distance Metrics for Name-Matching Tasks. In: IJCAI 2003, pp. 3\u201378 (2003)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Do, H.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":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-36560-5_17","volume-title":"Web, Web-Services, and Database Systems","author":"H.-H. Do","year":"2003","unstructured":"Do, H.-H., Melnik, S., Rahm, E.: Comparison of schema matching evaluations. In: Chaudhri, A.B., Jeckle, M., Rahm, E., Unland, R. (eds.) NODe-WS 2002. LNCS, vol.\u00a02593, pp. 221\u2013237. Springer, Heidelberg (2003)"},{"key":"9_CR7","first-page":"279","volume-title":"Machine Learning","author":"A. Doan","year":"2003","unstructured":"Doan, A., Domingos, P., Halevy, A.: Learning to Match the Schemas of Data Sources: A Multistrategy Approach. In: Machine Learning, vol.\u00a050, pp. 279\u2013301. Kluwer Academic Publishers Manufactured in The Netherlands, Dordrecht (2003)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-25956-5_5","volume-title":"The Semantic Web: Research and Applications","author":"F. Giunchiglia","year":"2004","unstructured":"Giunchiglia, F., Shvaiko, P., Yatskevich, M.: S-Match: An algorithm and an implementation of semantic matching. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol.\u00a03053, pp. 61\u201375. Springer, Heidelberg (2004)"},{"key":"9_CR9","unstructured":"Madhavan, J., Bernstein, P.A., Rahm, E.: Generic Schema Matching with Cupid. In: 27th VLDB Conference"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b97859","volume-title":"Generic Model Management","author":"S. Melnik","year":"2004","unstructured":"Melnik, S.: Generic Model Management. LNCS, vol.\u00a02967. Springer, Heidelberg (2004)"},{"key":"9_CR11","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm. In: ICDE 2002 (2002)"},{"key":"9_CR12","unstructured":"Miller, R.J., Haas, L.M., Hern\u00e1ndez, M.A.: Clio: Schema Mapping as Query Discovery. In: Proc. VLDB 2000 (2000)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Pedersen, T., Patwardhan, S., Patwardhan, S.: WordNet:Similarity - Measuring the Relatedness of Concepts. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence, San Jose, CA (2004)","DOI":"10.3115\/1614025.1614037"},{"key":"9_CR14","unstructured":"Rahm, E., Bernstein, P.A.: On matching schemas automatically. Microsoft Research, Redmon, WA. Technical Report MSR-TR-2001-17 (2001)"},{"key":"9_CR15","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. The VLDB Journal\u00a010, 334\u2013350 (2001)","journal-title":"The VLDB Journal"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-31988-7_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Sorlin","year":"2005","unstructured":"Sorlin, S., Solnon, C.: Reactive Tabu Search for Measuring Graph Similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol.\u00a03434, pp. 172\u2013182. Springer, Heidelberg (2005)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/11563952_66","volume-title":"Advances in Web-Age Information Management","author":"Z. Zhang","year":"2005","unstructured":"Zhang, Z., Che, H.y., Shi, P.-f., Sun, Y., Gu, J.: An algebraic framework for schema matching. In: Fan, W., Wu, Z., Yang, J. (eds.) WAIM 2005. LNCS, vol.\u00a03739, pp. 694\u2013699. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Science \u2013 ASIAN 2005. Data Management on the Web"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596370_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:55:18Z","timestamp":1619492118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596370_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307679","9783540322498"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11596370_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}