Frequent subgraph indexing method and device applied to frequent subgraph query

Abstract

The invention discloses a frequent sub-graph indexing method and device applied to frequent sub-graph query, and the method comprises the steps: determining a frequent sub-graph set, dividing the frequent sub-graph set into graph set blocks, and building an external storage index for each graph set block; establishing a memory index for each frequent sub-graph in the frequent sub-graphs, storing each memory index into a memory, and storing each memory index, an external memory index and each graph set block into an external memory; under the condition that a query request for a target graph is received, judging whether the target graph is a frequent sub-graph or not; if so, determining a target memory index of the target image in a memory, determining a target image set block to which the target image belongs in an external memory based on the target memory index, and obtaining a target external memory index of the target image set block; and establishing target connection for the target graph based on the target memory index and the target external memory index. In the query process of the target graph, the query of the target graph is realized based on the memory index and the external memory index, the feature of the target graph does not need to be extracted, and the query speed is improved.

Description

technical field [0001] The invention relates to the technical field of data mining, in particular to a frequent subgraph indexing method and device applied to frequent subgraph query. Background technique [0002] Frequent subgraphs: Find a set of subgraph sequences from the dynamic deductive graph sequence such that it satisfies: (1) the appearance of these subgraphs in the dynamic graph sequence is frequent; (2) the graph sequence of these subgraphs changes with time situation remains consistent. [0003] At present, with the vigorous development of the Internet, the scale of the network is constantly expanding. In the process of large-scale graph data processing, the traditional graph pattern mining algorithm gradually increases in time or space as the support decreases. In some The feature extraction aspect is also more complicated, making the mining task difficult to complete in a reasonable time. Contents of the invention [0004] In view of this, the present inven...

AI Technical Summary

Problems solved by technology

[0004] In view of this, the present invention provides a frequent subgraph indexing method and device applied to frequent subgraph query, which is used to solve the problem that the traditional graph pattern mining algorithm gradually increases in time or space as the support degree decreases. , it is also more complicated in some feature extraction, which makes it difficult to complete the mining task in a reasonable time. The specific scheme is as follows:

Images