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 G(1), each of whose nodes represents a set of documents having a common range of semantic indices. There exists a second graph G(2) modelling the distributed storage system. Our approach consists of embedding G(1) into G(2), 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. |
Year | Venue | Keywords |
---|---|---|
2009 | KMIS 2009: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON KNOWLEDGE MANAGEMENT AND INFORMATION SHARING | Semantic Web,Ontologies,Distributed Storage |
Field | DocType | Citations |
World Wide Web,Semantic Web Stack,Computer science,Data Web,Semantic Web,Semantic analytics,Semantic grid,Social Semantic Web,Semantic Web Rule Language,Semantic computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ana B. Rios-Alvarado | 1 | 28 | 6.51 |
Ricardo Marcelín-jiménez | 2 | 7 | 3.88 |
R. Carolina Medina Ramírez | 3 | 8 | 3.06 |