Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Data maintenance method and system stored in dynamic directed graph form

A data maintenance and directed graph technology, applied in the field of data maintenance, can solve the problems of accelerating the algorithm convergence speed, not choosing a pruning strategy, and the efficiency needs to be further improved, so as to achieve the effect of reducing computing expenses and achieving good performance.

Pending Publication Date: 2022-08-02
SUN YAT SEN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Try to avoid processing those strongly connected branches that are not affected, so as to speed up the convergence of the algorithm. However, there is no pruning strategy and asynchronous iteration method in this algorithm, and the efficiency of this algorithm needs to be further improved

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
  • Data maintenance method and system stored in dynamic directed graph form
  • Data maintenance method and system stored in dynamic directed graph form
  • Data maintenance method and system stored in dynamic directed graph form

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0049] This embodiment provides a data maintenance method saved in the form of a dynamic directed graph, such as figure 1 shown, including the following steps:

[0050] S1: Real-time acquisition of data saved in the form of a dynamic directed graph. In a dynamic directed graph, vertices represent objects and edges represent relationships between objects;

[0051] S2: Initialize the dynamic directed graph, obtain each strongly connected branch, and mark the label of each strongly connected branch, and obtain the vertex set and edge set contained in each strongly connected branch;

[0052] S3: When the data changes, the corresponding dynamic directed graph is represented as a newly added or deleted edge. Determine the labels of the strongly connected branches corresponding to the newly added edge set and the deleted edge set, process the update respectively, and get the updated The dynamic directed graph of

[0053]In many real-world networks, such as social networks, Wikipedi...

Embodiment 2

[0058] On the basis of Embodiment 1, this embodiment provides a method for processing a newly added edge set and a deleted edge set.

[0059] For the newly added edge set, choose the method of redundancy detection and asynchronous iteration to deal with the newly added edge set, such as figure 2 shown, specifically:

[0060] S301: For each newly added edge in the newly added edge set, use the redundant detection method to detect the newly added edge that does not affect the original strongly connected branch, and directly increase the number of edges of the original strongly connected branch by 1;

[0061] S302: For the newly added edge that affects the original strongly connected branch, recalculate the strongly connected branch, and use the asynchronous iteration method to reduce the original dynamic directed graph into a directed acyclic graph;

[0062] S303: Process the directed acyclic graph obtained after reduction, and cut out the single group in the directed acyclic ...

Embodiment 3

[0088] This embodiment provides a data maintenance system saved in the form of a dynamic directed graph, such as Figure 4 shown, including:

[0089] A data acquisition module, which is used for real-time acquisition of data saved in the form of a dynamic directed graph, in which the vertices represent data individuals, and thus represent the connection between data individuals;

[0090] An initialization module, which is used to initialize the dynamic directed graph, obtain each strongly connected branch, and mark the label of each strongly connected branch, and obtain the vertex set and edge contained in each strongly connected branch gather;

[0091] The processing and updating module is used for selecting the methods of redundancy detection and asynchronous iteration to process the newly added edge set and the deleted edge set respectively, and obtain the updated dynamic directed graph.

[0092] The same or similar reference numbers correspond to the same or similar part...

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 data maintenance method and system stored in a dynamic directed graph form, and the method comprises the following steps: S1, data stored in the dynamic directed graph form is obtained in real time, and in the dynamic directed graph, vertexes represent objects, and edges represent the relation between the objects; s2, initializing the dynamic directed graph to obtain each strongly connected branch, marking a label of each strongly connected branch, and obtaining a vertex set and an edge set contained in each strongly connected branch; and S3, when the data changes, showing the corresponding dynamic directed graph as newly added edges or deleted edges, judging the labels of the strongly connected branches corresponding to the newly added edge set and the deleted edge set, and respectively processing and updating to obtain the updated dynamic directed graph. According to the method, aiming at the edge increasing situation and the edge deleting situation, the strong connection branches are not detected again for the total data every time, and the calculation expenditure is greatly reduced through redundancy detection.

Description

technical field [0001] The invention relates to the field of data maintenance, and more particularly, to a data maintenance method and system saved in the form of a dynamic directed graph. Background technique [0002] The biggest feature of current data is the large amount and dynamic random change. For the research of some data such as social network flow data, the data structure of graph is usually used to store, the vertices of the graph represent objects, and the edges represent the relationship between them. Relationships, using the connected branch structure of graphs to maintain and calculate dynamic relationships in real-world graphs. For example, in real-world graphs such as social network graphs, communication network graphs, and route planning graphs, they contain hundreds of millions of objects. and relationship. Random factors such as the sending and receiving of messages, the change of routes, etc., will change the relationship between these network graph data...

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/23G06F16/22
CPCG06F16/23G06F16/2228
Inventor 姚正安黄凤张婧纯陶文哲
Owner SUN YAT SEN UNIV
Features
  • Generate Ideas
  • 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