CN113127698A - Data flow direction key path storage method based on directed graph - Google Patents
Data flow direction key path storage method based on directed graph Download PDFInfo
- Publication number
- CN113127698A CN113127698A CN202110417825.3A CN202110417825A CN113127698A CN 113127698 A CN113127698 A CN 113127698A CN 202110417825 A CN202110417825 A CN 202110417825A CN 113127698 A CN113127698 A CN 113127698A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- directed graph
- arc
- flow direction
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000012550 audit Methods 0.000 abstract description 4
- 238000012502 risk assessment Methods 0.000 abstract description 2
- 238000011161 development Methods 0.000 description 5
- 238000013523 data management Methods 0.000 description 4
- 238000011156 evaluation Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000005065 mining Methods 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the field of privacy calculation risk assessment, in particular to a data flow direction key path storage method based on a directed graph, which aims at the existing security audit problems of privacy security assessment, data tracing and the like which are inconvenient to carry out in the data exchange sharing process, and provides the following scheme, wherein the scheme comprises a node system, a data center, an application system and specific applications, and the method comprises the following steps: s1: connecting the node system, the data center, the application system and the specific application by using a directed arrow to form a directed graph; s2: representing the flow direction of the data by using a directed graph; s3: each node can be a data generation node or a data flow point, and a graph is stored by using a cross linked list.
Description
Technical Field
The invention relates to the technical field of privacy computation risk assessment, in particular to a data flow direction key path storage method based on a directed graph.
Background
On a global scale, the trend is toward developing big data technology, applying big data to promote economic development, improving social governance, and improving government service and supervision capabilities.
Firstly, a plurality of successful big data applications exist, but the current big data applications are still in the primary stage in terms of effect and depth, and deep-level applications for predicting the future and guiding practice according to big data analysis become development key points.
Secondly, a big data management system is far from being formed, especially, obvious contradictions exist between privacy protection, data security and data sharing utilization efficiency, the big data management system becomes an important short board for restricting the big data development, all circles have realized the important significance of constructing the big data management system, relevant research and practice will continuously strengthen the increasingly prominent status along with the big data as strategic resources, and people more and more strongly realize that one of the short boards for restricting the big data development is: a data management system is far from being formed, and if the data asset position is not established, consensus is not achieved, multiple challenges are faced in data right determination, circulation and control; data barriers exist widely, and the sharing and opening of data are hindered; law and regulation development lags, so that security and privacy risks exist in big data application; and so on. Such factors limit the mining and transformation of the value contained in the data resources.
The contradiction between privacy, safety and shared utilization is particularly obvious. On one hand, the requirement for data sharing to be open is very urgent. The important progress of the artificial intelligence application in recent years mainly comes from the analysis and mining of massive and high-quality data resources. For a single organization, it is often difficult to aggregate enough high quality data by self accumulation. In addition, the power of big data application is derived from comprehensive fusion and depth analysis of multi-source data in many cases, so that an all-around view for observing and recognizing objects from different angles is obtained. Data of a single system and organization usually only contain one-sided and local information of an object, so that a data set with complete information can be established only through sharing and opening and data cross-domain circulation. In the process, corresponding recording is required to be carried out on the data flow direction, and an auditable data record is formed.
Disclosure of Invention
The invention aims to solve the defects that privacy security evaluation, data source tracing and other security audits are inconvenient to carry out in the data exchange sharing process in the prior art, and provides a data flow direction critical path storage method based on a directed graph.
In order to achieve the purpose, the invention adopts the following technical scheme:
a data flow direction key path storage method based on a directed graph comprises a node system, a data center, an application system and specific applications, and comprises the following steps:
s1: connecting the node system, the data center, the application system and the specific application by using a directed arrow to form a directed graph;
s2: representing the flow direction of the data by using a directed graph;
s3: each node can be a generation node of data or a point through which the data flows, and a graph is stored by using a cross linked list.
Preferably, the directed graph vertex structure is: data, first in and first out, wherein the Data represents a Data set list owned by a vertex and specific Data information, the first in represents pointing to a first arc node taking the vertex as an arc head, and the first out represents pointing to a first arc node taking the vertex as an arc tail.
Preferably, to represent all vertices in the directed graph, an array of vertices is used to store each node.
Preferably, in the cross linked list storage structure, each arc in the directed graph has an arc node corresponding to it.
Compared with the prior art, the invention has the beneficial effects that:
the invention utilizes the data structure to store the system in the data stream transfer process and the data stored in the system, thereby facilitating the safety audit of privacy safety evaluation, data tracing and the like in the data exchange sharing process.
Drawings
Fig. 1 is a schematic structural diagram of a data flow direction critical path storage method based on a directed graph according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
Referring to fig. 1, a method for storing a data flow to a critical path based on a directed graph includes the following steps:
s1: connecting the node system, the data center, the application system and specific applications (web pages, collected apps and the like) by using directed arrows to form a directed graph;
s2: representing the flow direction of the data by using a directed graph;
s3: each node can be a generation node of data or a point through which the data flows, and a graph is stored by using a cross linked list.
In the present invention, the vertex structure is:
| Data | FirstIn | FirstOut |
wherein data represents the data set list owned by the vertex and the specific data information (including the data set name, the owned fields, whether the data is generated for the vertex, etc.), and firstIn represents pointing to the first arc node with the vertex as the arc head. And firstOut indicates the first arc node pointing to the arc tail of the vertex. To represent all the vertices in the directed graph, a vertex array is used to store each node, as shown below.
| xList[0] | Data | FirstIn | FirstOut | First vertex |
| xList[1] | Data | FirstIn | FirstOut | Second vertex |
| … | … | … | … | |
| xList[n] | Data | FirstIn | FirstOut | The nth vertex |
In addition, in the cross linked list storage structure, each arc in the directed graph has an arc node corresponding to it, and the specific arc node structure is as follows:
| tailVex | headVex | hLink | tLink | Info |
where tailVex represents the position of the arc tail vertex of the arc in the vertex array xList, and headVex represents the position of the arc head vertex of the arc in the vertex array. hLink represents the next arc with the same pointing arc head, and tLink represents the next arc with the same pointing arc tail.
The system in the data stream transfer process and the data stored in the system are stored by using the data structure, so that privacy security evaluation, data tracing and other security audits in the data exchange sharing process are facilitated.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered to be within the technical scope of the present invention, and the technical solutions and the inventive concepts thereof according to the present invention should be equivalent or changed within the scope of the present invention.
Claims (4)
1. A data flow direction key path storage method based on a directed graph comprises a node system, a data center, an application system and specific applications, and is characterized in that the storage method comprises the following steps:
s1: connecting the node system, the data center, the application system and the specific application by using a directed arrow to form a directed graph;
s2: representing the flow direction of the data by using a directed graph;
s3: each node can be a generation node of data or a point through which the data flows, and a graph is stored by using a cross linked list.
2. The method for storing the data flow direction critical path based on the directed graph according to claim 1, wherein the structure of the vertex of the directed graph is as follows: data, first in and first out, wherein the Data represents a Data set list owned by a vertex and specific Data information, the first in represents pointing to a first arc node taking the vertex as an arc head, and the first out represents pointing to a first arc node taking the vertex as an arc tail.
3. The method according to claim 1, wherein for representing all vertices in the directed graph, a vertex array is used to store each node.
4. The method according to claim 1, wherein each arc in the digraph has an arc node corresponding to the arc node in the cross-linked list storage structure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110417825.3A CN113127698A (en) | 2021-04-19 | 2021-04-19 | Data flow direction key path storage method based on directed graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110417825.3A CN113127698A (en) | 2021-04-19 | 2021-04-19 | Data flow direction key path storage method based on directed graph |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113127698A true CN113127698A (en) | 2021-07-16 |
Family
ID=76777628
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110417825.3A Pending CN113127698A (en) | 2021-04-19 | 2021-04-19 | Data flow direction key path storage method based on directed graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113127698A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104218673A (en) * | 2014-08-06 | 2014-12-17 | 国网上海市电力公司 | Automatic intelligent power grid partitioning method |
| CN106161080A (en) * | 2016-02-15 | 2016-11-23 | 上海卫星工程研究所 | A kind of SpaceFiber/SpaceWire network model describes method |
| EP3470992A1 (en) * | 2017-10-12 | 2019-04-17 | Adtran, Inc. | Efficient storage and utilization of a hierarchical data set |
| CN109784657A (en) * | 2018-12-18 | 2019-05-21 | 东软集团股份有限公司 | Operation flow method for building up, device, storage medium and electronic equipment |
| CN110046157A (en) * | 2018-12-20 | 2019-07-23 | 阿里巴巴集团控股有限公司 | Method and device based on cross doublylinked list storage digraph |
| CN110058932A (en) * | 2019-04-19 | 2019-07-26 | 中国科学院深圳先进技术研究院 | A kind of storage method and storage system calculated for data flow driven |
| CN110968429A (en) * | 2019-12-20 | 2020-04-07 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for loop detection in directed graph |
| EP3734460A1 (en) * | 2019-04-30 | 2020-11-04 | Hewlett-Packard Enterprise Development LP | Probabilistic software testing via dynamic graphs |
-
2021
- 2021-04-19 CN CN202110417825.3A patent/CN113127698A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104218673A (en) * | 2014-08-06 | 2014-12-17 | 国网上海市电力公司 | Automatic intelligent power grid partitioning method |
| CN106161080A (en) * | 2016-02-15 | 2016-11-23 | 上海卫星工程研究所 | A kind of SpaceFiber/SpaceWire network model describes method |
| EP3470992A1 (en) * | 2017-10-12 | 2019-04-17 | Adtran, Inc. | Efficient storage and utilization of a hierarchical data set |
| CN109784657A (en) * | 2018-12-18 | 2019-05-21 | 东软集团股份有限公司 | Operation flow method for building up, device, storage medium and electronic equipment |
| CN110046157A (en) * | 2018-12-20 | 2019-07-23 | 阿里巴巴集团控股有限公司 | Method and device based on cross doublylinked list storage digraph |
| CN110058932A (en) * | 2019-04-19 | 2019-07-26 | 中国科学院深圳先进技术研究院 | A kind of storage method and storage system calculated for data flow driven |
| EP3734460A1 (en) * | 2019-04-30 | 2020-11-04 | Hewlett-Packard Enterprise Development LP | Probabilistic software testing via dynamic graphs |
| CN110968429A (en) * | 2019-12-20 | 2020-04-07 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for loop detection in directed graph |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Oudani et al. | Green Blockchain based IoT for secured supply chain of hazardous materials | |
| Zhang et al. | A knowledge sharing framework for green supply chain management based on blockchain and edge computing | |
| Naqvi et al. | Seeking a balance between population diversity and premature convergence for real-coded genetic algorithms with crossover operator | |
| CN113344450B (en) | Low-voltage station area subscriber identification method, system, terminal equipment and storage medium | |
| CN113127698A (en) | Data flow direction key path storage method based on directed graph | |
| CN115935235A (en) | Big data decision analysis method and flow based on data middlebox | |
| Zhu | A hybrid indicator many‐objective optimization algorithm for the selection and delivery of disaster relief materials problem | |
| Deep et al. | Performance Prediction and Analytics of Fuzzy, Reliability and Queuing Models | |
| Wei et al. | A Cross‐Regional Scheduling Strategy of Waste Collection and Transportation Based on an Improved Hierarchical Agglomerative Clustering Algorithm | |
| Valeriy et al. | Model of evaluating smart city projects by groups of investors using a multifactorial approach | |
| Zhou | Information construction of construction project management based on internet of things blockchain | |
| Ren et al. | A hierarchical clustering based method to evaluate reuse of rare earth tailings under cloud computing environment | |
| Wang et al. | Data privacy protection method of internet of things based on blockchain technology | |
| Kou et al. | Optimized design of patrol path for offshore wind farms based on genetic algorithm and particle swarm optimization with traveling salesman problem | |
| Liu et al. | Mobile Edge Computing Application in Enterprise Human Resource Management Platform Based on Task Scheduling Algorithm | |
| Ranjan et al. | 10 Role of Cyber-Security in Smart Energy Management Systems | |
| Uzuner Sahin et al. | A genetic algorithm for the redundancy allocation problem with repairable components | |
| Zhao et al. | Cloud Storage for Management System | |
| Zhang et al. | Smart Campus Economy One‐Card Management Mode Based on the Integration of Big Data and Cloud Computing | |
| Wan | Digital web archive collection framework based on intelligent management information system and optimization | |
| Chi et al. | A compatible carbon efficiency information service framework based on the industrial internet identification | |
| Shang et al. | Design and implementation of power data traceability system based on blockchain | |
| Chang et al. | A structural approach to identify the position and role of the litigation relation network of smartphone companies | |
| Mohammed et al. | Enhancing e-governance in the ministry of electricity in Iraq using artificial intelligence | |
| Song | Multi-module Accounting Sharing Model from the Perspective of Regional Network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210716 |
|
| RJ01 | Rejection of invention patent application after publication |