Graph pattern matching method based on multi-source-point parallel exploration

A matching method and graph mode technology, applied in the field of distributed computing in the field of big data, can solve problems such as increasing time complexity, graph simulation algorithms cannot be directly applied, and are not suitable for large-scale graph queries

Active Publication Date: 2021-03-26
ZHEJIANG BANGSUN TECH CO LTD
View PDF7 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The pattern of the trade network is sensitive to the graph topology, and graph simulation algorithms suitable for social network analysis cannot be directly applied to this network
The

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
  • Graph pattern matching method based on multi-source-point parallel exploration
  • Graph pattern matching method based on multi-source-point parallel exploration
  • Graph pattern matching method based on multi-source-point parallel exploration

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] In order to enable those skilled in the art to better understand the present invention, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific examples.

[0031] like figure 1As shown, the overall process of the present invention is as follows: selecting a source point from the model map in a suitable way, and decomposing the model map into multiple layers with the source point as the center. There is a hierarchical relationship between the layers. After selecting the starting point on the data map, the data map is explored layer by layer from the bottom level to the high level in units of layers. The source point of the schema graph and the starting point of the data graph need to meet certain constraints. Optionally, select one or more sub-source points on the pattern map, repeat the exploration step on the sub-graphs that have been explored, and calculate the intersection of the results to improve t...

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 graph pattern matching method based on multi-source-point parallel exploration. The graph pattern matching method can be used for graph pattern fuzzy query starting from a determined point in a graph database. According to the invention, the to-be-queried mode graph is decomposed according to the hierarchical structure, graph traversal query is carried out by taking the graph layer as a unit, the exploration depth can be remarkably reduced, and the parallel exploration performance is improved. Concepts of a center mode set and an edge mode set are provided and used for controlling the exploration process, an exploration task is converted from a sub-graph as the center to a point as the center, and an algorithm can be achieved on a universal distributed graph computing platform. According to the matching result refining method for merging the exploration results of the multiple source points, repeated exploration is carried out by specifying the multiple auxiliary source points, constraint on the matching results is enhanced by utilizing layer differences brought by different visual angles, and the matching precision is improved.

Description

technical field [0001] The invention relates to the field of distributed computing in the field of big data, and more specifically, relates to a graph pattern fuzzy matching method of a labeled directed graph based on a distributed graph computing framework. Background technique [0002] With the development of the Internet, the social and economic activities of human beings relying on the Internet have become more and more common, which has objectively caused a sharp increase in the size of data. Graphs can be used to model social and economic activities with associations. Finding complex association patterns from graphs has become a common method for analyzing entity associations, but it also consumes a lot of computing resources. In the context of increasing graph size, it is extremely important to reduce the computing resources required for graph pattern matching. [0003] Taking the enterprise trade network as an example, the transaction entity is used as a node, and t...

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): G06F16/901G06F16/903
CPCG06F16/9024G06F16/903
Inventor 黄文杰高杨陈伟王新根黄滔
Owner ZHEJIANG BANGSUN TECH CO LTD
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