Dominance-Partitioned Subgraph Matching on Large RDF Graph

Algorithm 3

Dominance-driven k-partition algorithm.

	Input: a dominant connected pattern graph , an RDF graph
	Output: a set of k-partitioned data subgraph
(1)	Initializing weighted matrix of size ;
(2)	For each t ∈ do
(3)	;
(4)	;
(5)	Fordo;
(6)	;
(7)	, ;
(8)	C ← K-Means(F), C = {C1, …, C2};
(9)	For Ci ∈ C and t ∈ do
(10)	If t ∈ (Ci), then
(11)	;
(12)	Return;