{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T02:10:11Z","timestamp":1736043011812,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292272"},{"type":"electronic","value":"9783540320876"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11563952_100","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T11:24:50Z","timestamp":1129721090000},"page":"900-905","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Common Structures in XML Schema Matching"],"prefix":"10.1007","author":[{"given":"Shengrui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguo","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ju","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"100_CR1","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":"100_CR2","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":"100_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/PL00009212","volume":"21","author":"A. Gupta","year":"1998","unstructured":"Gupta, A., Nishimura, N.: Finding Largest Subtrees and Smallest Supertrees. Algorithmica\u00a021, 183\u2013210 (1998)","journal-title":"Algorithmica"},{"key":"100_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11531371_38","volume-title":"Web Engineering","author":"J. Lu","year":"2005","unstructured":"Lu, J., Wang, J., Wang, S.: An Experiment on the Matching and Reuse of XML Schemas. In: Lowe, D.G., Gaedke, M. (eds.) ICWE 2005. LNCS, vol.\u00a03579, pp. 273\u2013284. Springer, Heidelberg (2005)"},{"key":"100_CR5","unstructured":"Madhavan, J., Bernstein, P.A., Rahm, E.: Generic Schema Matching with Cupid. In: VLDB 2001 (2001)"},{"key":"100_CR6","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching. In: ICDE 2002 (2002)"},{"key":"100_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-46439-5_6","volume-title":"Advances in Database Technology - EDBT 2000","author":"P. Mitra","year":"2000","unstructured":"Mitra, P., Wiederhold, G., Kersten, M.: A Graph-oriented Model for Articulation of Ontology Interdependencies. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 86\u2013100. Springer, Heidelberg (2000)"},{"issue":"4","key":"100_CR8","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":"100_CR9","unstructured":"Schilieder, T., Naumann, F.: Approximate Tree Embedding for Querying XML Data. In: ACM SIGIR 2000 Workshop On XML and Information Retrieval, Athens, Greece, July 28 (2000)"},{"key":"100_CR10","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J., Zhang, K., Shih, F.Y.: Exact and Approximate Algorithms for Unordered Tree Matching. IEEE Trans. on Sys., Man, and Cyber.\u00a024(4) (April 1994)","DOI":"10.1109\/21.286387"},{"key":"100_CR11","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)"},{"key":"100_CR12","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.: An Algo. for Finding the Largest Approxi. Common Substructures of Two Trees. IEEE Trans. PAMI\u00a020, 889\u2013895 (1998)","journal-title":"IEEE Trans. PAMI"},{"key":"100_CR13","doi-asserted-by":"crossref","unstructured":"Yao, J.T., Zhang, M.: A Fast Tree Pattern Matching Algorithm for XML Query. In: Proc. of the IEEE\/WIC\/ACM Int. Conf. on Web Intelligence, Beijing, September 20-24, pp. 235\u2013241 (2004)","DOI":"10.1109\/WI.2004.10048"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11563952_100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T01:50:13Z","timestamp":1736041813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11563952_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292272","9783540320876"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11563952_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}