Sub-graph matching device and sub-graph matching method

A matching device and subgraph technology, applied in the field of data search, can solve problems such as time-consuming, large matching result sets, and poor performance, and achieve the effect of improving speed

Active Publication Date: 2013-05-01
SHENZHEN INST OF ADVANCED TECH CHINESE ACAD OF SCI
View PDF1 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the face of large data graphs, the matching result set of a given query is very large, so it will be very time-consuming to use the existing subgraph matching algorithm to find all the matches, and then obtain the top-k results by sorting
[0006] 2. The existing top-k connection algorithm can

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Sub-graph matching device and sub-graph matching method
  • Sub-graph matching device and sub-graph matching method
  • Sub-graph matching device and sub-graph matching method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary only for explaining the present invention and should not be construed as limiting the present invention.

[0030] In the description of the present invention, the orientation or positional relationship indicated by the terms "inner", "outer", "longitudinal", "transverse", "upper", "lower", "top", "bottom" etc. are based on the drawings The orientations or positional relationships shown are only for the convenience of describing the invention and do not require the invention to be constructed and operated in a specific orientation, and thus should not be construed as limitations on the invention.

[0031] see figure 1 , figure 1 Shown is a b...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a sub-graph matching device, which is used for finding out a sub-graph matched with a loop graph in a large-scale graph. The device comprises a spanning tree module, a matching module, a judging module and a gathering module. A spanning tree of the loop graph is found by the spanning tree module according to a minimum spanning tree algorithm; the spanning tree matching is carried out on a data graph by the matching module from bottom to top to find a tree Li (i>=1) matched with the spanning tree; whether the sum of a grading function value of the tree Li and the missing edge number is larger than or equal to a preset value or not is judged by the judging module, if so, whether the tree Li can be expanded into the loop graph or not is judged by the judging module; and the gathering module can be used for outputting the previous fixed value number of matching graphs in a set V when the sum of the grading function value of the tree Li and the missing edge number is larger than or equal to the preset value.

Description

technical field [0001] The invention relates to data search technology, in particular to a subgraph matching device and a subgraph matching method for performing subgraph matching on a large data graph. Background technique [0002] With the development of web technologies and new data management and storage technologies, graph-structured data is becoming more and more common. The graph structure can clearly express the complex relationship between objects. Many applications need to deal with graph-structured data, such as semantic web [1], protein interaction network in bioinformatics [2] and social network in social science, etc. These applications require efficient storage and analysis of single or multiple large graph data. [0003] When analyzing graph data, it is often necessary to query the graph. Unlike the query in the relational database, the query of the graph is generally based on the structure of the graph. Queries related to graphs can be roughly divided int...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 曾理成杰峰冯圣中
Owner SHENZHEN INST OF ADVANCED TECH CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap