Scalable maximum clique computation using MapReduce

Jingen Xiang, Cong Guo, Ashraf Aboulnaga

Research output: Chapter in Book/Report/Conference proceedingConference contribution

40 Citations (Scopus)

Abstract

We present a scalable and fault-tolerant solution for the maximum clique problem based on the MapReduce framework. The key contribution that enables us to effectively use MapReduce is a recursive partitioning method that partitions the graph into several subgraphs of similar size. After partitioning, the maximum cliques of the different partitions can be computed independently, and the computation is sped up using a branch and bound method. Our experiments show that our approach leads to good scalability, which is unachievable by other partitioning methods since they result in partitions of different sizes and hence lead to load imbalance. Our method is more scalable than an MPI algorithm, and is simpler and more fault tolerant.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Pages74-85
Number of pages12
DOIs
Publication statusPublished - 15 Aug 2013
Externally publishedYes
Event29th International Conference on Data Engineering, ICDE 2013 - Brisbane, QLD, Australia
Duration: 8 Apr 201311 Apr 2013

Other

Other29th International Conference on Data Engineering, ICDE 2013
CountryAustralia
CityBrisbane, QLD
Period8/4/1311/4/13

Fingerprint

Branch and bound method
Scalability
Experiments

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Cite this

Xiang, J., Guo, C., & Aboulnaga, A. (2013). Scalable maximum clique computation using MapReduce. In Proceedings - International Conference on Data Engineering (pp. 74-85). [6544815] https://doi.org/10.1109/ICDE.2013.6544815

Scalable maximum clique computation using MapReduce. / Xiang, Jingen; Guo, Cong; Aboulnaga, Ashraf.

Proceedings - International Conference on Data Engineering. 2013. p. 74-85 6544815.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xiang, J, Guo, C & Aboulnaga, A 2013, Scalable maximum clique computation using MapReduce. in Proceedings - International Conference on Data Engineering., 6544815, pp. 74-85, 29th International Conference on Data Engineering, ICDE 2013, Brisbane, QLD, Australia, 8/4/13. https://doi.org/10.1109/ICDE.2013.6544815
Xiang J, Guo C, Aboulnaga A. Scalable maximum clique computation using MapReduce. In Proceedings - International Conference on Data Engineering. 2013. p. 74-85. 6544815 https://doi.org/10.1109/ICDE.2013.6544815
Xiang, Jingen ; Guo, Cong ; Aboulnaga, Ashraf. / Scalable maximum clique computation using MapReduce. Proceedings - International Conference on Data Engineering. 2013. pp. 74-85
@inproceedings{7d4c11c5854945a6a6a834cabe55ea0f,
title = "Scalable maximum clique computation using MapReduce",
abstract = "We present a scalable and fault-tolerant solution for the maximum clique problem based on the MapReduce framework. The key contribution that enables us to effectively use MapReduce is a recursive partitioning method that partitions the graph into several subgraphs of similar size. After partitioning, the maximum cliques of the different partitions can be computed independently, and the computation is sped up using a branch and bound method. Our experiments show that our approach leads to good scalability, which is unachievable by other partitioning methods since they result in partitions of different sizes and hence lead to load imbalance. Our method is more scalable than an MPI algorithm, and is simpler and more fault tolerant.",
author = "Jingen Xiang and Cong Guo and Ashraf Aboulnaga",
year = "2013",
month = "8",
day = "15",
doi = "10.1109/ICDE.2013.6544815",
language = "English",
isbn = "9781467349086",
pages = "74--85",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - Scalable maximum clique computation using MapReduce

AU - Xiang, Jingen

AU - Guo, Cong

AU - Aboulnaga, Ashraf

PY - 2013/8/15

Y1 - 2013/8/15

N2 - We present a scalable and fault-tolerant solution for the maximum clique problem based on the MapReduce framework. The key contribution that enables us to effectively use MapReduce is a recursive partitioning method that partitions the graph into several subgraphs of similar size. After partitioning, the maximum cliques of the different partitions can be computed independently, and the computation is sped up using a branch and bound method. Our experiments show that our approach leads to good scalability, which is unachievable by other partitioning methods since they result in partitions of different sizes and hence lead to load imbalance. Our method is more scalable than an MPI algorithm, and is simpler and more fault tolerant.

AB - We present a scalable and fault-tolerant solution for the maximum clique problem based on the MapReduce framework. The key contribution that enables us to effectively use MapReduce is a recursive partitioning method that partitions the graph into several subgraphs of similar size. After partitioning, the maximum cliques of the different partitions can be computed independently, and the computation is sped up using a branch and bound method. Our experiments show that our approach leads to good scalability, which is unachievable by other partitioning methods since they result in partitions of different sizes and hence lead to load imbalance. Our method is more scalable than an MPI algorithm, and is simpler and more fault tolerant.

UR - http://www.scopus.com/inward/record.url?scp=84881364571&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84881364571&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2013.6544815

DO - 10.1109/ICDE.2013.6544815

M3 - Conference contribution

SN - 9781467349086

SP - 74

EP - 85

BT - Proceedings - International Conference on Data Engineering

ER -