Distributed Allocation of a Corporate Semantic Web

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 1 G , each of whose nodes represents a set of documents having a common range of semantic indices. There exists a second graph 2 G modelling the distributed storage system. Our approach consists of embedding 1 G into 2 G , under space 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.