Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs.

Many problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on labeled graphs (also called "heterogeneous information networks" or HINs). Given a large graph and a query pattern with node and edge label constraints, a fundamental challenge is to find the top- matches according to a ranking function over edge and node weights. For users, it is difficult to select value .