{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:09:33Z","timestamp":1744902573581},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112886"},{"type":"electronic","value":"9783319112893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11289-3_44","type":"book-chapter","created":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T21:07:33Z","timestamp":1409864853000},"page":"434-443","source":"Crossref","is-referenced-by-count":2,"title":["On Decomposing Integration Tasks for Hierarchical Structures"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Maleszka","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01894194","volume":"3","author":"J.P. Barthelemy","year":"1986","unstructured":"Barthelemy, J.P., McMorris, F.R.: The median procedure for n-trees. Journal of Classification\u00a03, 329\u2013334 (1986)","journal-title":"Journal of Classification"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01897165","volume":"5","author":"J.P. Barthelemy","year":"1988","unstructured":"Barthelemy, J.P.: Thresholded consensus for n-trees. Journal of Classification\u00a05, 229\u2013236 (1988)","journal-title":"Journal of Classification"},{"issue":"4","key":"44_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M. Bordewich","year":"2005","unstructured":"Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics\u00a08(4), 409\u2013423 (2005)","journal-title":"Annals of Combinatorics"},{"issue":"5","key":"44_CR4","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R. Cole","year":"2000","unstructured":"Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, T.: An o(nlog n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput.\u00a030(5), 1385\u20131404 (2000)","journal-title":"SIAM J. Comput."},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"W.H.E. Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. Journal of Classification\u00a02, 7\u201328 (1985)","journal-title":"Journal of Classification"},{"key":"44_CR6","unstructured":"Do, H.H.: Schema Matching and Mapping-based Data Integration. Ph.D. Thesis, University of Leipzig (2006)"},{"key":"44_CR7","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":"44_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.datak.2007.09.008","volume":"65","author":"S. Madria","year":"2008","unstructured":"Madria, S., Passi, K., Bhowmick, S.: An XML Schema integration and query mechanism system. Data and Knowledge Engineering\u00a065, 266\u2013303 (2008)","journal-title":"Data and Knowledge Engineering"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-319-05476-6_25","volume-title":"Intelligent Information and Database Systems","author":"M. Maleszka","year":"2014","unstructured":"Maleszka, M.: Knowledge Generalization during Hierarchical Structures Integration. In: Nguyen, N.T., Attachoo, B., Trawi\u0144ski, B., Somboonviwat, K. (eds.) ACIIDS 2014, Part I. LNCS, vol.\u00a08397, pp. 242\u2013250. Springer, Heidelberg (2014)"},{"issue":"5","key":"44_CR10","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1080\/01969722.2011.595341","volume":"42","author":"M. Maleszka","year":"2011","unstructured":"Maleszka, M., Nguyen, N.T.: A Method for Complex Hierarchical Data Integration. Cybernetics and Systems\u00a042(5), 358\u2013378 (2011)","journal-title":"Cybernetics and Systems"},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-23938-0_1","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"M. Maleszka","year":"2011","unstructured":"Maleszka, M., Nguyen, N.T.: Some Properties of Complex Tree Integration Criteria. In: J\u0119drzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part II. LNCS, vol.\u00a06923, pp. 1\u20139. Springer, Heidelberg (2011)"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Maleszka, M., Mianowska, B., Nguyen, N.T.: A method for collaborative recommendation using knowledge integration tools and hierarchical structure of user profiles. Knowledge-Based Systems 47, 1\u201313 (2013)","DOI":"10.1016\/j.knosys.2013.02.016"},{"key":"44_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-45705-4_21","volume-title":"E-Commerce and Web Technologies","author":"K. Passi","year":"2002","unstructured":"Passi, K., Lane, L., Madria, S., Sakamuri, B.C., Mohania, M., Bhowmick, S.: A Model for XML Schema Integration. In: Bauknecht, K., Tjoa, A.M., Quirchmayr, G. (eds.) EC-Web 2002. LNCS, vol.\u00a02455, pp. 193\u2013202. Springer, Heidelberg (2002)"},{"key":"44_CR14","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"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence. Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11289-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T13:34:11Z","timestamp":1565789651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11289-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112886","9783319112893"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11289-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}