We propose Algorithm 1 as an approximate heuristic.
the software generates an hop-1 query q 1 = x for each x ∈ X , finds the entity e 1 that aligns with q 1 , and then finds triples matching (e 1 , r 2 , ?).