3 Ranking
The structural similarity which considers the compact-
ness of a subtree is very important for ranking graph
data, and identifying the rich structural relationships is
at least as important as discovering more keywords,
perhaps even more crucial. Accordingly, these two
cases are integrated together to give a more meaningful
ranking function.