Abstract
The common approach to integrating XML documents is based on existing formal structures, not originally designed to integration tasks. In this paper we propose a Complex Tree model designed from the beginning to integration tasks, capable of representing most tree structures. The Complex Tree model is defined on both Schema and Instance level, to better work in practical situations. The integration task for Complex Trees is also defined on both levels. A set of explicitly stated criteria for integration is given, to better design future integration algorithms, in respect of the desired aim of integration process. Finally a simple integration algorithm is presented, based on selected criteria.
This is a preview of subscription content, log in via an institution to check access.
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 Consenss. Journal of Classification 3, 299–317 (1986)
Arenas, M., Libkin, L.: A Normal Form for XML Documents. ACM Transactions on Database Systems 29(1), 195–232 (2004)
Bae, J.K., Kim, J.: Integration of heterogeneous models to predict consumer behavior. Expert Systems with Applications 37, 1821–1826 (2010)
Barthelemy, J.P., McMorris, F.R.: The Median Procedure for n-Trees. Journal of Classification 3, 329–334 (1986)
Bonifati, A., Ceri, S.: Comparative Analysis of Five XML Query Languages. ACM SIGMOD Record 29(1) (2000)
Danilowicz, Cz., Nguyen, N.T.: Methods for choice of representation of ordered partitions and coverings, Wroclaw (1992)
Day, W.H.E.: Optimal Algorithms for Comparing Trees with Labled Leaves. Journal of Classification 2, 7–28 (1985)
Delobel, C., Reynaud, C., Rousset, M.C., Sirot, J.P., Vodislav, D.: Semantic integration in Xyleme: a uniform tree-based approach. Data & Knowledge Engineering 44, 267–298 (2003)
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)
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 16(1) (January 2004)
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–180. Exit, Warszawa (2008)
Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal 10, 334–350 (2001)
Routledge, N., Bird, L., Goodchild, A.: UML and XML Schema. In: Zhou, X. (ed.) Conferences in Research and Practice in Information Technology, vol. 5 (2002)
Stinebrickner, R.: s-Consensus Trees and Indices. Bulletin of Mathematical Biology 46, 923–935 (1984)
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). A Model for Complex Tree Integration Tasks. In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20039-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-20039-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20038-0
Online ISBN: 978-3-642-20039-7
eBook Packages: Computer ScienceComputer Science (R0)