Name
Title | ||
|---|---|---|
Parallelized Similarity Flooding Algorithm for Processing Large Scale Graph Datasets with MapReduce |
Abstract | ||
|---|---|---|
Measures of graph similarity have a broad range of applications but involve compute-intensive process. Similarity flooding algorithm is an efficient algorithm for comparing the similarity of graphs of small size and small datasets. However, nowadays more and more large-scale graph applications emerge and existing stand-alone similarity flooding algorithm cannot efficiently conduct the similarity comparison process for large scale graph datasets in acceptable time. This paper presents a parallelized similarity flooding algorithm with MapReduce for large-scale graph datasets. The experimental results demonstrate that the parallelized algorithm achieves significant performance improvement compared to the stand-alone similarity flooding algorithm. Experimental results also reveal that the parallelized algorithm can obtain excellent speedup when the size of cluster increases. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/PDCAT.2012.109 | PDCAT |
Keywords | Field | DocType |
stand-alone similarity flooding algorithm,mapreduce,graph similarity,large scale graph datasets,large-scale graph datasets,large-scale graph application,parallelized algorithm,similarity comparison process,efficient algorithm,parallel algorithms,parallelized similarity flooding algorithm,compute-intensive process,data handling,graph theory,large-scale graph data,cluster size,similarity flooding algorithm | Graph theory,Graph,Data mining,Graph similarity,Parallel algorithm,Computer science,Flooding algorithm,Group method of data handling,Performance improvement,Speedup | Conference |
ISBN | Citations | PageRank |
978-0-7695-4879-1 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Zhang | 1 | 0 | 0.34 |
| Chunfeng Yuan | 2 | 418 | 30.84 |
| Huang, Yihua | 3 | 167 | 22.07 |