Abstract
A distributed and dynamic multi-agent system for integrated performing of gathering, processing, and retrieval of highly heterogeneous XML documents’ collections is presented. Collections of XML documents are assumed to be distributed among nodes of a network. The management process consists of a few steps: documents in each node are clustered, clusters’ representatives are computed and stored in metadata repository, queries are confronted with metadata repository, distributed retrieval is carried out over relevant clusters, retrieval results are integrated and final answer is presented to an end user. Major functions of such strategy were designed and implemented on JADE platform. Actual implementations of the proposed multi-agent system can vary, depending on applied models of XML documents’ clustering, indexing and retrieval.
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
Bellifemine, F., Caire, G., Poggi, A., Rimassa, G.: JADE - A white paper. Exp. 3(3) (2003), http://exp.telecomitalialab.com
Francesca, F., Gordano, G., Ortale, R., Tagarelli, A.: Distance-Based Clustering of XML Documents. In: Proc. ECML/PKDD 2003, pp. 75–78 (2003)
Java Agent DEvelopment Framework (JADE), http://jade.tilab.com
Jiang, T., Wang, L., Zhang, K.: Alignment of Trees – an Alternative to Tree Edit. Theoretical Computer Science 143(1), 137–148 (1995)
Klein, P.N.: Computing the Edit-Distance Between Un-rooted Ordered Trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91–102. Springer, Heidelberg (1998)
Koloniari, G., Pitoura, E.: Peer-to-Peer Management of XML Data: Issues and Research Challenges. SIGMOD Record 32(2), 6–17 (2005)
Long, J., Schwartz, D.G., Stoecklin, S.: An XML Distance Measure. In: Proc. 2005 International Conference on Data Mining (2005)
Niermann, A., Jagadish, H.V.: Evaluating Structural Similarity in XML Documents. In: Proc. 5th Int. Workshop on the Web and Databases, pp. 61–66 (2002)
Ro, J.S.: An evaluation of the applicability of ranking algorithms to improve the effectiveness of full-text retrieval. I. On effectiveness of full text-retrieval. Journal of the American Society for Information Science 39(2), 73–78 (1988)
Ro, J.S.: An evaluation of the applicability of ranking algorithms to improve the effectiveness of full-text retrieval. II. On the effectiveness of ranking algorithms on full-text retrieval. Journal of the American Society of Information Science 39(3), 147–160 (1988)
The Foundation for Intelligent Physical Agents (FIPA), http://fipa.org
Touzet, H.: Tree edit distance with gaps. Information Processing Letters 85(3), 123–129 (2003)
Zhang, K., Shasha, D.: Simple Fast Algorithms for Editing Distance Between Trees and Related Problems. SIAM J. Computing 18(6), 1245–1262 (1989)
Zhang, K., Shasha, D., Wang, J.T.L.: Approximate Tree Matching in the Presence of Variable Length Don’t Cares. Journal of Algorithms 16(1), 33–66 (1994)
Zhang, K.: Algorithms for the Constrained Editing Distance Between Ordered Labeled Trees and Related Problems. Pattern Recognition 28(3), 463–474 (1995)
Zhongping, Z., Rong, L., Shunliang, C., Yangyong, Z.: Similarity Metric for XML Documents. In: Workshop on Knowledge and Experience Management (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gieryluk, J., Katarzyniak, R., Maciejczyk, P., Sendal, M., Skorupa, G. (2009). A Multi-Agent Framework for Storage and Retrieval of Documents from Distributed XML Collections. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2009. Lecture Notes in Computer Science(), vol 5559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01665-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-01665-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01664-6
Online ISBN: 978-3-642-01665-3
eBook Packages: Computer ScienceComputer Science (R0)