A Distributed Algorithm to Enumerate All Maximal Cliques in MapReduce

Citations Over TimeTop 10% of 2009 papers

Abstract

Structure mining plays an important part in the researches in biology, physics, Internet or telecommunications in recently emerging network science. As a main task in this area, the problem of maximal clique enumeration has attracted much interest and been studied in variant avenues in prior works. However, most of these works mainly rely on single chip computational capacity and have been constrained by local optimization. Thus it is an impossible mission for these methods to process terabytes datasets. In this paper, to extract maximal cliques from graphs, we propose a general enumeration process in a distributed manner on cluster system with the help of MapReduce. Graph is firstly split into small subgraphs automatically. Then a novel key-based clique enumeration algorithm is proposed based on subgraphs. We demonstrate that our algorithm has a high parallelism and a prominent performance on extremely huge graphs. Our method is implemented to fully utilize MapReduce execution mechanism and the experiments are soundly discussed as using such a powerful distributed platform. However we not only show the scalability and efficiency of the algorithm but also share some critical experience in using MapReduce computing model.

Related Papers

• → INITIAL SEGMENTS OF THE ENUMERATION DEGREES(2016)5 cited
• → <title>Challenge of terabyte optical recording</title>(2001)1 cited
• → Does selective enumeration improve total enumeration?(1993)1 cited
• → Optical Mass Storage For A 10 Terabyte Archive: System Integration Problems And User Interface(1987)
• → Does selective enumeration improve total enumeration?(2010)