Signal/collect: graph algorithms for the (semantic) web

  • Authors:

  • Philip Stutz;Abraham Bernstein;William Cohen

  • Affiliations:

  • DDIS, Department of Informatics, University of Zurich, Zurich, Switzerland;DDIS, Department of Informatics, University of Zurich, Zurich, Switzerland;Machine Learning Department, Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confronts researchers with a conundrum: Whilst the data is available the programming models that facilitate scalability and the infrastructure to run various algorithms on the graph are missing. Some use MapReduce - a good solution for many problems. However, even some simple iterative graph algorithms do not map nicely to that programming model requiring programmers to shoehorn their problem to the MapReduce model. This paper presents the Signal/Collect programming model for synchronous and asynchronous graph algorithms. We demonstrate that this abstraction can capture the essence of many algorithms on graphs in a concise and elegant way by giving Signal/Collect adaptations of various relevant algorithms. Furthermore, we built and evaluated a prototype Signal/Collect framework that executes algorithms in our programming model. We empirically show that this prototype transparently scales and that guiding computations by scoring as well as asynchronicity can greatly improve the convergence of some example algorithms. We released the framework under the Apache License 2.0 (at http://www.ifi.uzh.ch/ddis/research/sc).