Graph pattern reverse real-time matching method based on event driving

An event-driven, matching method technology, applied in the field of graph retrieval, can solve matching problems and achieve the effect of low matching delay, effective balance between performance and accuracy

Pending Publication Date: 2020-10-02
ZHEJIANG BANGSUN TECH CO LTD
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The purpose of the present invention is to propose a reverse real-time matching method based on an event-driven graph pattern to solve the problem of event-driven sub-graph matching in real-time scenarios

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 reverse real-time matching method based on event driving
  • Graph pattern reverse real-time matching method based on event driving
  • Graph pattern reverse real-time matching method based on event driving

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0063] The specific embodiments of the present invention will be described in further detail below in conjunction with the accompanying drawings.

[0064] The present invention provides an event-driven graph mode reverse real-time matching method, which includes the following steps:

[0065] (1) Definition of graph mode:

[0066] The graph mode is used to describe the spatial connection relationship and attribute constraints of vertices and edges in the graph in reverse order, specifically, including a matching step list and a matching context;

[0067] The matching context is used to store the intermediate results of the matching process, and supports the matching conditions of non-adjacent vertices or edges; figure 1 Defines the basic graph schema "friends of friends". Using the context, the name attributes of the two vertices are required to be inconsistent, so as to avoid the matching result of "a friend of a friend is myself".

[0068] The matching step list includes m...

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 reverse real-time matching method based on event driving. The method comprises the steps of defining a graph pattern, establishing a reverse matching frameworkand adopting a reverse matching method, wherein the graph mode is used for describing a spatial connection relationship between vertexes and edges in the graph and attribute constraints of the spatialconnection relationship in a reverse sequence, and comprises a matching step chain table and a matching context, and reverse real-time matching of the graph mode is realized according to a reverse matching architecture, so that the problem of event-driven sub-graph matching in a real-time scene is solved. According to the method, fixed vertex sub-graph matching can be completed at the second level, effective balance of performance and accuracy is achieved, concurrent matching of a large number of graph modes is supported, the method can be used for enhancing an existing graph calculation engine, and real-time graph matching, query analysis and other scenes in the fields of finance, e-commerce, logistics, public security and the like are supported.

Description

technical field [0001] The invention relates to the field of graph retrieval, in particular to an event-driven graph pattern reverse real-time matching method. Background technique [0002] A graph consists of a series of vertices (Vertex) and edges (Edge) and their attributes, which can express complex relationships between entities very naturally. On social platforms, graphs can be used to express multi-level friend relationships, so as to discover multi-level relationships such as "friends of friends of friends of friends". In the field of public security, graphs can discover criminal gangs by describing the connections between criminals. Specifically, a graph schema defines a graph topology that includes a series of vertices and edges, as well as specific attribute constraints between these vertices and edges. The graph pattern matching refers to finding a subgraph that matches a given graph pattern in the graph data, so that the subgraph satisfies the topology structu...

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/9035
CPCG06F16/9024G06F16/9035G06F18/22
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