Abstract
Hierarchical data integration becomes important with the abundance of XML based solution in today world. We have previously introduced a model of hierarchical data – the Complex Tree, a model for its integration and some criteria to guide the integration process. In this paper some of those criteria are further analyzed and their properties are described: 1) the completeness criterion based integration may be decomposed into subtasks with the same final result, 2) the minimality criterion based integration may also be decomposed, but the result, while correct, is not guaranteed to be the same, 3) the precision and relationship completeness criteria are in some cases mutually exclusive.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, E.N.: N-Trees as Nestrings: 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) 18(4), 323–364 (1986)
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)
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.: Methods for XML documents integration. In: Grzech, A., Swiatek, P., Drapala, J. (eds.) Advances in Systems. Warsaw “Exit”, pp. 333–342 (2010)
Maleszka, M., Nguyen, N.T.: A model for Complex Tree integration tasks. In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011, Part I. LNCS, vol. 6591, pp. 36–46. Springer, Heidelberg (2011)
Maleszka, M., Nguyen, N.T.: A Method for Complex Hierarchical Data Integration. In: Cybernetics and Systems (to appear)
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 Jour-nal 10, 334–350 (2001)
Schmitt, I., Saake, G.: A comprehensive database schema integration method based on the theory of formal concepts. Acta Informatica 41(7/8), 475–524 (2005)
Stinebricker, 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, vol. 751, pp. 52–64 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maleszka, M., Nguyen, N.T. (2011). Some Properties of Complex Tree Integration Criteria. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2011. Lecture Notes in Computer Science(), vol 6923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23938-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-23938-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23937-3
Online ISBN: 978-3-642-23938-0
eBook Packages: Computer ScienceComputer Science (R0)