Dominance-Partitioned Subgraph Matching on Large RDF Graph

Algorithm 1

Dominance-partitioned subgraph matching algorithm (DP-SM).

	Input: a pattern graph , a query graph q, and a data graph
	Output: the set M of all subgraph mappings of q on
(1)	-extraction from;
(2)	k-Partition of on ;
(3)	M ⟵ subMatching (q, );
(4)	Return M;