Graph spectrum and reachable path number-based sub-graph query method for undirected weighted graph

Abstract

The invention discloses a graph spectrum and reachable path number-based sub-graph query method for an undirected weighted graph. The method comprises the steps of 1, calculating codes of node marks of a query graph and graphs in a known graph data set, codes of weighted adjacent edge marks and a code of a reachable path number; 2, generating graph spectrums of the query graph and the graphs in the known graph data set; 3, by using the codes of the node marks of the graphs in the known graph data set, the codes of the weighted adjacent edge marks, the code of the reachable path number and thegraph spectrums, constructing an index tree; and 4, comparing the query graph and the node graphs of the index tree layer by layer from top to bottom, and meanwhile, performing screening, until the bottommost layer is screened out, wherein the obtained graphs are candidate graphs similar to the query graph. According to the method, the topological information of the graph is better described. Meanwhile, the features are coded, so that the storage is easy, the operation is simple, the comparison between the features can be accelerated, and the query speed of the whole sub-graph can be increased.

Description

technical field [0001] The invention belongs to the technical field of computer data mining, and in particular relates to a subgraph query method of an undirected weighted graph based on a map and the number of reachable paths. Background technique [0002] In recent years, many fields, including computers, have applied graphs as a data structure to describe data information. For example, in chemistry, molecules or atoms are modeled as nodes, and the chemical bonds between them are modeled as edges; in computer networks, personal computers are modeled as nodes, and the routing relationship between them is modeled as side. The wide application of graphs has triggered the pattern query of graph databases, among which subgraph query has become one of the most important research directions. The subgraph query problem can be boiled down to: Given a graph dataset and a query graph, find the set of all data graphs that contain the query graph, even if the query graph is a subgrap...

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a subgraph query method of an undirected weighted graph based on the map and the number of reachable paths, which solves the problem that the structure of the intermediate spanning tree in the Gcoding index method existing in the prior art will lose part of the structural information of the graph , which reduces the filtering efficiency, thereby reducing the query efficiency

Images