Abstract
Hierarchical structures have became a common data structure in modern applications, thus the needs to process them efficiently has increased. In this paper we provide a full description of a mathematical model of complex tree integration, whicha allows the representation of various types of hierarchical structures and integration tasks. We use this model to show that it is possible to decompose some integration tasks by splitting them into subtasks. Thanks to this procedure it is possible to solve large integration tasks faster, without the need to develop new, less computationally complex, algorithms. Decomposition is an important step towards developing methods of multi-stage integration of hierarchical structures.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barthelemy, J.P., McMorris, F.R.: The median procedure for n-trees. Journal of Classification 3, 329–334 (1986)
Barthelemy, J.P.: Thresholded consensus for n-trees. Journal of Classification 5, 229–236 (1988)
Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8(4), 409–423 (2005)
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. 30(5), 1385–1404 (2000)
Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. Journal of Classification 2, 7–28 (1985)
Do, H.H.: Schema Matching and Mapping-based Data Integration. Ph.D. Thesis, University of Leipzig (2006)
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. 2593, pp. 221–237. Springer, Heidelberg (2003)
Madria, S., Passi, K., Bhowmick, S.: An XML Schema integration and query mechanism system. Data and Knowledge Engineering 65, 266–303 (2008)
Maleszka, M.: Knowledge Generalization during Hierarchical Structures Integration. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds.) ACIIDS 2014, Part I. LNCS, vol. 8397, pp. 242–250. Springer, Heidelberg (2014)
Maleszka, M., Nguyen, N.T.: A Method for Complex Hierarchical Data Integration. Cybernetics and Systems 42(5), 358–378 (2011)
Maleszka, M., Nguyen, N.T.: Some Properties of Complex Tree Integration Criteria. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part II. LNCS, vol. 6923, pp. 1–9. Springer, Heidelberg (2011)
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–13 (2013)
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. 2455, pp. 193–202. Springer, Heidelberg (2002)
Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal 10, 334–350 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Maleszka, M. (2014). On Decomposing Integration Tasks for Hierarchical Structures. In: Hwang, D., Jung, J.J., Nguyen, NT. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2014. Lecture Notes in Computer Science(), vol 8733. Springer, Cham. https://doi.org/10.1007/978-3-319-11289-3_44
Download citation
DOI: https://doi.org/10.1007/978-3-319-11289-3_44
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11288-6
Online ISBN: 978-3-319-11289-3
eBook Packages: Computer ScienceComputer Science (R0)