Practical Survey on MapReduce Subgraph Enumeration Algorithms

Xiaozhou Liu, Yudi Santoso, Venkatesh Srinivasan, Alex Thomo

Abstract: Subgraph enumeration is a basic task in many graph analyses. Therefore, it is necessary to get this task done within a reasonable amount of time. However, this objective is challenging when the input graph is very large, with millions of nodes and edges. Known solutions are limited in terms of scalability. Distributed computing is often proposed as a solution to improve scalability. However, it has to be done carefully to reduce the overhead cost and to really benefit from the distributed solution. In this work we provide a comprehensive overview of several Map-Reduce subgraph enumeration algorithms which currently represent the state of the art. We identify and describe the main conceptual approaches, giving insight on their advantages and limitations, and provide a summary of their similarities and differences.