Efficient Subgraph Query Algorithm in Large Graph

Abstract

Subgraph query is an important problem in the research and application of large graph mining. For large graphs with symmetry relation substructures, the existing decomposition-join strategy always leads to low searching efficiency. To solve this problem, we proposed a new decomposition-Detection-join strategy, in which we detect symmetric relations of each sub part of the decomposition, and then determine the sequence of queries based on the detection results. The experimental results show that the algorithm has much improvement in query efficiency.