In addition, there is a lack of general framework for subgraph matching that can be tailored to the problem in hand. Most datasets, in addition to edge and node type contain multiple attributes per node/edge and the combination of these features are used to match a data graph edge to a query edge. Similarly, the definition of match itself varies depending upon the data and problem at hand. Some of the commonly used matching techniques include subgraph isomorphism [1]}, [2]}, [3]}, [4]}, homomorphism [5]}, [6]}, [7]}, [8]}, and simulation [9]}, [10]}. Most of the existing works hard-code these specifications in their system.Without expertise in graph analysis, it is very difficult for users to choose appropriate subgraph matching solutions or make necessary changes.
