Two main difficulties for these methods are that processing through all relations in a KG is not practical as the combination of these relations is nearly infinite, and that the number of candidate paths grows exponentially with the path length and quickly becomes intractable for large knowledge graphs.
current relation-chain-based methods set the maximum length of candidate paths to 1, 2 or 3.