Supercharge Your Innovation With Domain-Expert AI Agents!

Graph simulation matching method for large-scale time sequence graph

A technology for simulating matching and sequence diagrams, applied in the database field, can solve problems such as inability to process sequence diagrams, and achieve the effect of short running time

Pending Publication Date: 2019-05-14
BEIJING INSTITUTE OF TECHNOLOGYGY
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, since the vertices and edges in the sequence diagram have time constraints, the time factor needs to be considered in the calculation, and the obtained results must meet the prerequisite of accessibility. Therefore, the current traditional graph simulation method cannot deal with the sequence diagram. Graph simulation matching on graph is a problem to be solved

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 simulation matching method for large-scale time sequence graph
  • Graph simulation matching method for large-scale time sequence graph
  • Graph simulation matching method for large-scale time sequence graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0055] A graph simulation matching method for large-scale sequence graphs, comprising the following steps:

[0056] Step 1: According to the obtained existing sequence diagram data, convert the sequence diagram data into a graph storage.

[0057] Step 2: On the timing diagram G=(V,E,L) according to the query graph Q=(V q ,E q , L q ,f e ) for graph simulation matching query. details as follows:

[0058] Step 2.1: Initialization.

[0059] First, the node v∈V in the query graph is q Store it in the pattern, then set the queue to be empty, assign the root to be empty, and the target to be empty.

[0060] Step 2.2: Perform steps 2.3-2.5 for a total of pattern.size cycles from i from 0 to pattern.size-1.

[0061] Step 2.3: Assign pattern[i] to root, V q .next is assigned to target, and root is put into the queue.

[0062] Step 2.4: If the queue is not empty, execute step 2.5 in a loop.

[0063] Step 2.5: Take out the vertex u from the queue, and judge all neighbor nodes ...

Embodiment 2

[0070] Combine below figure 1 Describes timing diagrams and related concepts. Such as figure 1 Shown is a timing graph G. The label on the edge between the vertices and the vertices in the figure represents the departure time and elapsed time of the node. For example, the time label on the edge between the vertices A1 and B1 is (1,1), representing The vertex A1 departs from time 1 and arrives at B1 through time 1. figure 2 Shown is the query graph Q, the label on the edge between the vertices in the query graph represents the number of boundaries, that is to say, according to the results found in the sequence graph of the query graph, the number of edges between two points in the query graph The number cannot exceed this boundary number, figure 2 The number of borders on the edge between vertex A and vertex C is 2. image 3 based query graph figure 2 in the sequence diagram figure 1 The results obtained from the timing boundary simulation above.

[0071] This specifi...

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 relates to a graph simulation matching method for a large-scale time sequence graph, and the method comprises the following steps: S1, carrying out the processing of obtained time sequence graph data, and enabling the data to be converted into a graph mode for storage; S2, performing graph simulation matching query on the time sequence graph G = (V, E, L) according to a query graph Q= (Vq, Eq, Lq, fe); and obtaining a final simulation matching query result. According to the method, graph simulation matching in the time sequence graph is realized, the deficiency of graph simulation matching research on the time sequence graph at present is made up, and meanwhile, compared with a method for converting the time sequence graph into a static graph and then carrying out graph simulation, the operation time used by the method is shorter.

Description

technical field [0001] The invention relates to a graph simulation matching method for large-scale sequence graphs, belonging to the technical field of databases. Background technique [0002] With the emergence of network applications such as new social networks, location-based service provision, and intelligent transportation systems, the data generated by these applications has strong timeliness characteristics compared with the data generated by traditional applications. Called the timing diagram (Temporal Graph). A sequence diagram is a graph structure that changes over time. A timing diagram is essentially a diagram with time-varying labels, that is, the labels on the edges in the diagram have a certain time attribute. The edges in the timing diagram do not exist continuously, and may only exist in certain specific time periods. . Sequence diagrams are widely used, as long as there are dynamic logic diagrams, they can be researched through timing diagram modeling. ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/901G06F16/903
Inventor 袁野王国仁刘萌王一舒马玉亮
Owner BEIJING INSTITUTE OF TECHNOLOGYGY
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com