Efficient algorithms for exact ranked twig-pattern matching over graphs
Gang Gou, Rada Y. Chirkova · 2008
Querying large-scale graph-structured data with twig patterns is attracting growing interest. Generally, a twig pattern could have an extremely large, potentially exponential, number of matches in a graph. Retrieving and returning to the user this many answers may both incur high computational overhead and overwhelm the user.