Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine

Understand

Graph mining is one of the most important categories of graph algorithms.

• However, exploring the subgraphs of an input graph produces a huge amount of intermediate data.
• The 'think like a vertex' programming paradigm, pioneered by Pregel, cannot readily formulate mining problems, which is designed to produce graph computation problems like PageRank.
• Existing mining systems like Arabesque and RStream need large amounts of computing and memory resources.