Pattern Match Pattern

Many graph applications, especially in the multi-relational domain, have to do with identifying patterns in the graph. That is, identifying sub-graphs that match a particular topology and feature set. In single-relational graphs, usually a topology is only considered. For graphs that are labeled and have key/value pairs on the elements (i.e. property graphs), then features on that topology must be considered as well to be generally useful.