On Ranked Approximate Matching Of Large Attributed Graphs