Perhaps the depth of the node could be used as part of the
algorithm to determine the relevance of the match? That
would cause the main nodes to float closer to the top of
the search result list.
Possibly, but search is already expensive. My suggestion
ought to actually lighten the load, checking the depth
adds work; I would imagine the only thing a node knows
is its parent, not its family tree.