Dominance-Partitioned Subgraph Matching on Large RDF Graph

Algorithm 4

Subgraph matching algorithm on k-partitioned RDF graph (subMatching()).

	Input: a query graph
	Output: the subgraph mappings ℳ of q on
(1)	If i =  then;
(2)	Output M ⟶ ℳ;
(3)	Else
(4)	If i = −1 then;
(5)	Continue to ui.successor;
(6)	Else
(7)	Foreach ∈ M(ui, ) do
(8)	If candidateValid(, ui) then
(9)	⟶ M;
(10)	subMatching(q(ui.successor));
(11)	subMatching(q(ui.precursor));