Abstract
This paper outlines a general method for allocating a document collection over a distributed storage system. Documents are organized to make up a corporate semantic web featured by a graph G1, each of whose nodes represents a set of documents having a common range of semantic indices. There exists a second graph G2 modelling the distributed storage system. Our approach consists of embedding G1 into G2, under size restrictions. We use a meta-heuristic called "Ant Colony Optimization", to solve the corresponding instances of the graph embedding problem, which is known to be a NP problem. Our solution provides an efficient mechanism for information storage and retrieval. © 2009 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Rios-Alvarado, A. B., Marcelín-Jiménez, R., & Medina-Ramírez, R. C. (2009). ACO for solving the distributed allocation of a corporate semantic web. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5845 LNAI, pp. 27–38). https://doi.org/10.1007/978-3-642-05258-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
