Fig. 7

Suppose \(S^t={S_1}\) be the target partition. a The 1-hop partitions from \({S_1}\), described in schema as \(S_2\), \(S_3\), and \(S_4\) are selected; b the shortest paths from \({S_1}\) to selected partitions are trivial in this case; c the guide partitions for \(S_2\), \(S_3\), and \(S_4\) are identified as being \(S_1\) itself; d the partitions \(S_5\) and \(S_6\) are selected; e the shortest metapaths between \(S_5\) and \({S_1}\), and between \(S_6\) and \({S_1}\) are found; f the guide partition for \(S_5\) is identified as \(S_4\) and the guide partition for \(S_6\) is identified as \(S_2\)