GraphChi: large-scale graph computation on just a PC

Carnegie Mellon University · University of Washington

Abstract

Current systems for graph computation require a distributed computing cluster to handle very large real-world problems, such as analysis on social networks or the web graph. While distributed computational resources have become more accessible, developing distributed graph algorithms still remains challenging, especially to non-experts.\nIn this work, we present GraphChi, a disk-based system for computing efficiently on graphs with billions of edges. By using a well-known method to break large graphs into small parts, and a novel parallel sliding windows method, GraphChi is able to execute several advanced data mining, graph mining, and machine learning algorithms on very large graphs, using just a single…

Citation impact

904
total citations
FWCI
73.00
Percentile
100%
References
49
Citations per year

Authors

3

Topics & keywords

Keywords
  • Computer science
  • Computation
  • Graph algorithms
  • Graph
  • Theoretical computer science
  • Distributed computing
  • Parallel computing
  • Algorithm
No related works found for this paper.