An Association-Oriented Partitioning Approach for Streaming Graph Query

Algorithm 1

Retracing start vertex and computing association.

Input:

subgraph formed through sliding window:

Output:

start vertex set for each vertex ,

Association set

(1)  startVertexSet

(2)  

while  Queue is not empty  do

(3) ; Queue.pop();

(4) if    do

(5) ; ;

(6) foreach  

(7) if  local indegree of   and  local outdegree of

(8) Queue.push();

(9) else

(10)foreach    do

(11)if    do

(12)clean  ,  ;

(13)else    do

(14)update  ,  ;

(15)if    and    do

(16);