{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:17:35Z","timestamp":1742998655397,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200380"},{"type":"electronic","value":"9783642200397"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20039-7_4","type":"book-chapter","created":{"date-parts":[[2011,4,16]],"date-time":"2011-04-16T03:37:49Z","timestamp":1302925069000},"page":"36-46","source":"Crossref","is-referenced-by-count":4,"title":["A Model for Complex Tree Integration Tasks"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Maleszka","sequence":"first","affiliation":[]},{"given":"Ngoc Thanh","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01894192","volume":"3","author":"E.N. Adams","year":"1986","unstructured":"Adams, E.N.: N-Trees as Nestrings: Complexity, Similarity, and Consenss. Journal of Classification\u00a03, 299\u2013317 (1986)","journal-title":"Journal of Classification"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/974750.974757","volume":"29","author":"M. Arenas","year":"2004","unstructured":"Arenas, M., Libkin, L.: A Normal Form for XML Documents. ACM Transactions on Database Systems\u00a029(1), 195\u2013232 (2004)","journal-title":"ACM Transactions on Database Systems"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.1016\/j.eswa.2009.07.012","volume":"37","author":"J.K. Bae","year":"2010","unstructured":"Bae, J.K., Kim, J.: Integration of heterogeneous models to predict consumer behavior. Expert Systems with Applications\u00a037, 1821\u20131826 (2010)","journal-title":"Expert Systems with Applications"},{"key":"4_CR4","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":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bonifati, A., Ceri, S.: Comparative Analysis of Five XML Query Languages. ACM SIGMOD Record\u00a029(1) (2000)","DOI":"10.1145\/344788.344822"},{"key":"4_CR6","unstructured":"Danilowicz, Cz., Nguyen, N.T.: Methods for choice of representation of ordered partitions and coverings, Wroclaw (1992)"},{"key":"4_CR7","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 Labled Leaves. Journal of Classification\u00a02, 7\u201328 (1985)","journal-title":"Journal of Classification"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0169-023X(02)00140-4","volume":"44","author":"C. Delobel","year":"2003","unstructured":"Delobel, C., Reynaud, C., Rousset, M.C., Sirot, J.P., Vodislav, D.: Semantic integration in Xyleme: a uniform tree-based approach. Data & Knowledge Engineering\u00a044, 267\u2013298 (2003)","journal-title":"Data & Knowledge Engineering"},{"key":"4_CR9","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":"4_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(95)00110-X","volume":"55","author":"M. Farach","year":"1995","unstructured":"Farach, M., Przytycka, T.M., Thorup, M.: On the agreement of many trees. Information Processing Letters\u00a055, 297\u2013301 (1995)","journal-title":"Information Processing Letters"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Lian, W., Cheung, D.W., Mamoulis, N., Yiu, S.M.: An Efficient and Scalable Algorithm for Clustering XML Documents by Structure. IEEE Transactions on Knowledge and Data Engineeing\u00a016(1) (January 2004)","DOI":"10.1109\/TKDE.2004.1264824"},{"key":"4_CR12","first-page":"165","volume-title":"Knowledge Processing and Reasoning for Information Society","author":"M. Maleszka","year":"2008","unstructured":"Maleszka, M., Mianowska, B., Prusiewicz, A.: On some approaches to reduce the computational costs of similarity measures between XML trees. In: Nguyen, N.T., Kolaczek, G., Gabrys, B. (eds.) Knowledge Processing and Reasoning for Information Society, pp. 165\u2013180. Exit, Warszawa (2008)"},{"key":"4_CR13","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":"4_CR14","unstructured":"Routledge, N., Bird, L., Goodchild, A.: UML and XML Schema. In: Zhou, X. (ed.) Conferences in Research and Practice in Information Technology, vol.\u00a05 (2002)"},{"key":"4_CR15","first-page":"923","volume":"46","author":"R. Stinebrickner","year":"1984","unstructured":"Stinebrickner, R.: s-Consensus Trees and Indices. Bulletin of Mathematical Biology\u00a046, 923\u2013935 (1984)","journal-title":"Bulletin of Mathematical Biology"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20039-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:53:44Z","timestamp":1558569224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20039-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200380","9783642200397"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20039-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}