Abstract
Hierarchical structures are common in modern applications. Tree integration is one of the tools for them that is not fully researched. We define a complex tree to model other common hierarchical structures. Complex tree integration is parametrized by specific integration criteria. Sub-tree agreement is a group of criteria that describes the relation of sub-tree number and structure between input trees and the integrated tree. This paper provides several definitions of sub-tree agreement, the most important properties of these criteria, and examples of algorithms based on sub-tree agreement.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Adams, E.N.: N-Trees as Nestings: Complexity, Similarity, and Consensus. Journal of Classification 3, 299–317 (1986)
Batini, C., Lenzerini, M., Navathe, S.B.: A comparative analysis of methodologies for database schema integration. ACM Computing Surveys (CSUR)
Batista, M.D.C.M., Salgado, A.C.: Minimality Quality Criterion Evaluation for Integrated Schemas. In: Proceedings of 2nd International Conference on Digital Information Management, ICDIM 2007, pp. 436–441 (2007)
Barthelemy, J.P., McMorris, F.R.: The Median Procedure for n-Trees. Journal of Classification 3, 329–334 (1986)
Comyn-Wattiau, I., Bouzeghoub, M.: Constraint Confrontation: An Important Step in View Integration. In: Loucopoulos, P. (ed.) CAiSE 1992. LNCS, vol. 593, pp. 507–523. Springer, Heidelberg (1992)
Day, W.H.E.: Optimal Algorithms for Comparing Trees with Labeled Leaves. Journal of Classification 2, 7–28 (1985)
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)
Farach, M., Przytycka, T.M., Thorup, M.: On the agreement of many trees. Information Processing Letters 55, 297–301 (1995)
Madria, S., Passi, K., Bhowmick, S.: An XML Schema integration and query mechanism system. Data & Knowledge Engineering 65, 266–303 (2008)
Maleszka, M., Nguyen, N.T.: Path-Oriented Integration Method for Complex Trees. In: Jezic, G., Kusek, M., Nguyen, N.-T., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2012. LNCS (LNAI), vol. 7327, pp. 84–93. Springer, Heidelberg (2012)
Maleszka, M., Nguyen, N.T.: A Method for Complex Hierarchical Data Integration. Cybernetics and Systems 42(5), 358–378 (2011)
Nguyen, N.T.: Inconsistency of Knowledge and Collective Intelligence. Cybernetics and Systems 39(6), 542–562 (2008)
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)
Stinebrickner, R.: s-Consensus Trees and Indices. Bulletin of Mathematical Biology 46, 923–935 (1984)
Trinkunas, J., Vasilecas, O.: Ontology Transformation: from Requirements to Conceptual Model. Scientific Papers, University of Latvia, Computer Science and Information Technologies 751, 52–64 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maleszka, M., Nguyen, N.T. (2013). Using Subtree Agreement for Complex Tree Integration Tasks. In: Selamat, A., Nguyen, N.T., Haron, H. (eds) Intelligent Information and Database Systems. ACIIDS 2013. Lecture Notes in Computer Science(), vol 7803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36543-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-36543-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36542-3
Online ISBN: 978-3-642-36543-0
eBook Packages: Computer ScienceComputer Science (R0)