Efficient and Scalable Graph Similarity Joins in MapReduce

Algorithm 1

MGSJoin.

  Input: graph object sets 𝑅 and 𝑆; GED threshold 𝜏

  Output: similar graph pairs ⟨𝑟,𝑠⟩

(1) Filter

(2)   Job 1: count the same type of common signatures for graph pairs;

(3)   Job 2: count the total common signatures and check the count filtering fir graph pairs;

(4) Verification

(5)   Job 1: replace sid with graph 𝑠;

(6)   Job 2: replace rid with graph 𝑟 and calculate GED for candidate pairs;