SGDB – Simple Graph Database Optimized for Activation Spreading Computation Authors: Marek Ciglan and Kjetil Nørvåg Keywords: spreading activation, graph, link graph, graph database, persistent media
Abstract:
In this paper, we present SGDB, a graph database with a storage model optimized for computation of Spreading Activation (SA) queries. The primary goal of the system is to minimize the execution time of spreading activation algorithm over large graph structures stored on a persistent media; without pre-loading the whole graph into the memory. We propose a storage model aiming to minimize number of accesses to the storage media during execution of SA and we propose a graph query type for the activation spreading operation. Finally, we present the implementation and its performance characteristics in scope of our pilot application that uses the activation spreading over the Wikipedia link graph.
Useful if your topic map won’t fit into memory or you want to use spreading activation with your topic map. Not to mention that the SGDB has some interesting performance characteristics versus a general graph database. Or so the article says, I haven’t verified the claims, you need to make your own judgment.
Software: SGDB