SGDB: simple graph database optimized for activation spreading computation

  • Authors:
  • Marek Ciglan;Kjetil Nørvåg

  • Affiliations:
  • Dep. of Computer and Information Science, NTNU, Trondheim, Norway;Dep. of Computer and Information Science, NTNU, Trondheim, Norway

  • Venue:
  • DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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 preloading 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 theWikipedia link graph.