CN110443457B

CN110443457B - Data processing method and device

Info

Publication number: CN110443457B
Application number: CN201910602425.2A
Authority: CN
Inventors: 李启睿
Original assignee: Advanced New Technologies Co Ltd
Current assignee: Advanced New Technologies Co Ltd; Advantageous New Technologies Co Ltd
Priority date: 2019-07-05
Filing date: 2019-07-05
Publication date: 2023-05-16
Anticipated expiration: 2039-07-05
Also published as: CN110443457A

Abstract

The embodiment of the specification provides a data processing method and device, wherein the method comprises the following steps: acquiring information related to the equity of at least one enterprise; the share right related information comprises the share information of the enterprise and the share information held by each share; generating a corresponding share right relation network diagram of the enterprise based on the share information of the enterprise and the share information held by each share; determining path information from a root node to each child node in a mode that a target node with zero degree in the equity relation network diagram sends a message to the next layer of child nodes adjacent to the target node, and analyzing stock holding information of each stakeholder based on the path information; the target node comprises a root node with zero initial incoming degree and a child node with zero incoming degree updated after receiving the message.

Description

Data processing method and device

Technical Field

The present disclosure relates to the field of data processing technologies, and in particular, to a data processing method and apparatus.

Background

With the rapid development of economy, the financial market is also rapidly developed, but with the development of the financial market, potential safety hazards are also brought. Therefore, the financial market needs to be monitored and managed to maintain the stable development of the financial market. Generally, when monitoring a financial market, the financial market can be monitored by identifying illegal financial risks, business risks, compliance risks and the like of related financial enterprises.

In general, the equity relationship of the enterprise characterizes the association relationship or control relationship between the enterprise and the enterprise, and between the enterprise and the natural person, so that the equity relationship of the enterprise is deeply analyzed, and the equity relationship has great significance for identifying financial risks and realizing monitoring of financial markets. However, the equity relationship of the enterprise is complicated, and therefore, a reliable scheme is needed to be proposed to realize the analysis of the equity relationship of the enterprise.

Disclosure of Invention

The purpose of the embodiment of the specification is to provide a data processing method and device, after acquiring the related information of the share right of an enterprise, a share right relation network diagram of the enterprise is constructed, a root node in the constructed share right relation network diagram represents the enterprise, a child node represents the share owner, a connecting line between the root node and the child node represents the share-holding path information of the share owner, the path information from the root node to each child node in the share right relation network diagram is determined by sending a message to the next adjacent child node through a target node with zero degree in the share right relation network diagram, and the path information is the share-holding path information of each share owner, namely, the share-holding information of each share owner is analyzed based on the path information; in the embodiment of the specification, the analysis of the stakeholder information is realized by determining the path information from the root node to the child node, and when the path information from the root node to the child node is determined, the message is sent to the adjacent child node at the next layer through the target node with zero incoming degree, so that each node is prevented from sending the message to the child node at the next layer, the quantity of the sent messages is reduced, the time consumption for determining the path information is reduced, and the processing efficiency is improved.

In order to solve the above technical problems, the embodiments of the present specification are implemented as follows:

the embodiment of the specification provides a data processing method, which comprises the following steps:

acquiring information related to the equity of at least one enterprise; the share right related information comprises the share information of the enterprise and the share information held by each share;

generating a corresponding share right relation network diagram of the enterprise based on the share information of the enterprise and the share information held by each share; the method comprises the steps that a root node in the equity relation network diagram represents the enterprise, a child node represents the stakeholder, and a connecting line between the root node and the child node represents the stranding path information of the stakeholder;

determining path information from the root node to each child node in a mode that a target node with zero degree in the equity relation network diagram sends a message to a next layer of child nodes adjacent to the target node, and analyzing stock holding information of each stakeholder based on the path information; the target node comprises a root node with zero initial incoming degree and a child node with zero incoming degree updated after receiving the message.

The embodiment of the specification also provides a data processing device, including:

The acquisition module is used for acquiring the information related to the share right of at least one enterprise; the share right related information comprises the share information of the enterprise and the share information held by each share;

the generation module is used for generating a share right relation network diagram corresponding to the enterprise based on the share information of the enterprise and the share information held by each share; the method comprises the steps that a root node in the equity relation network diagram represents the enterprise, a child node represents the stakeholder, and a connecting line between the root node and the child node represents the stranding path information of the stakeholder;

the first determining module is used for determining path information from the root node to each child node in a mode that a target node with zero degree in the equity relation network diagram sends a message to a next layer of child nodes adjacent to the target node; the target node comprises a root node with zero initial incoming degree and a child node with zero incoming degree update after receiving the message;

and the analysis module is used for analyzing the stock holding information of each stakeholder based on the path information.

a processor; and

a memory arranged to store computer executable instructions that, when executed, cause the processor to:

The present description also provides a storage medium for storing computer-executable instructions that, when executed, implement the following:

After acquiring the information related to the equity of the enterprise, the technical scheme in this embodiment constructs a equity relation network diagram of the enterprise, a root node in the constructed equity relation network diagram represents the enterprise, a child node represents the equity, a connection line between the root node and the child node represents the equity holding path information of the equity, and the path information from the root node to each child node in the equity relation network diagram is determined by sending a message to the next adjacent child node by a target node with zero degree in the equity relation network diagram, wherein the path information is the equity holding path information of each equity, namely, the equity holding path information of each equity is analyzed based on the path information; in the embodiment of the specification, the analysis of the stakeholder information is realized by determining the path information from the root node to the child node, and when the path information from the root node to the child node is determined, the message is sent to the adjacent child node at the next layer through the target node with zero incoming degree, so that each node is prevented from sending the message to the child node at the next layer, the quantity of the sent messages is reduced, the time consumption for determining the path information is reduced, and the processing efficiency is improved.

Drawings

In order to more clearly illustrate the embodiments of the present description or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings may be obtained according to these drawings without inventive effort for a person of ordinary skill in the art.

FIG. 1 is one of the flow charts of the data processing method provided in the embodiments of the present disclosure;

FIG. 2 is a schematic diagram of a constructed rights relation network diagram of enterprise A in the data processing method according to the embodiment of the present disclosure;

FIG. 3 is a second flowchart of a data processing method according to an embodiment of the present disclosure;

FIG. 4 is a flowchart of a method for determining path information from a root node to a leaf node in a equity relationship network diagram in a data processing method according to an embodiment of the present disclosure;

FIG. 5 is a third flowchart of a data processing method according to an embodiment of the present disclosure;

FIG. 6 is a fourth flowchart of a method of data processing method according to an embodiment of the present disclosure;

FIG. 7 is a schematic diagram of the module components of a data processing apparatus according to an embodiment of the present disclosure;

Fig. 8 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present disclosure.

Detailed Description

In order to make the technical solutions in the present application better understood by those skilled in the art, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, shall fall within the scope of the present application.

The method comprises the steps of constructing a stock right relation network diagram of an enterprise, determining path information from a root node to each child node in the stock right relation network diagram in a mode that a node with zero degree in the stock right relation network diagram sends a message to a node at the next layer, and analyzing the stock right information of the enterprise based on the path information; in the embodiment of the specification, the problem of the analysis of the rights of the enterprise is converted into the problem of determining the path from the root node to the child nodes in the rights relation network diagram, and the number of messages sent can be reduced by sending the messages to the next layer node layer by the node with zero degree, so that the path information from the root node to each child node can be rapidly and conveniently determined. Based on this, the embodiments of the present disclosure provide a data processing method, apparatus, device, and storage medium, which will be described in detail below.

Fig. 1 is one of the method flowcharts of the data processing method provided in the embodiment of the present disclosure, and the method shown in fig. 1 at least includes the following steps:

step 102, acquiring information related to the share rights of at least one enterprise; the share right related information comprises the share information of the enterprise and the share information held by each share.

In the step 102, the information about the equity right obtained in advance from an institution such as an industrial and commercial system website may be stored on a data storage platform, for example, in a distributed file system, and when the method provided in the embodiment of the present specification is executed, the information about the equity right of at least one enterprise is obtained from the distributed file system.

In specific implementation, the information related to the equity of one or more enterprises can be obtained based on the actual application scene. For example, if the analysis of the equity relation of a certain enterprise is required, only the equity related information of the enterprise may be obtained, and if the analysis of the equity relation of a plurality of enterprises is required, the equity related information of a plurality of enterprises may be obtained at the same time, which is not limited in the embodiment of the present disclosure.

The information about the equity of the above-mentioned step 102 includes at least stakeholders of the respective enterprises, and the share held by each stakeholder. The stakeholders mentioned may be businesses or natural persons, including direct stakeholders and indirect stakeholders. For ease of understanding, the following examples are presented.

For example, in one embodiment, if the rights information of the enterprise a is analyzed, rights related information of the enterprise a needs to be acquired, where the acquired rights related information of the enterprise a includes the stakeholders of the enterprise a and the number of shares held by each stakeholder. The obtained stakeholders of the enterprise a include a direct stakeholder directly holding the stakeholder of the enterprise a and an indirect stakeholder indirectly holding the stakeholder of the enterprise a, and for the indirect stakeholder, the held stakeholder may be the number of the stakeholders of a certain direct or indirect enterprise of the enterprise a held by the indirect stakeholder. The acquired information about the equity of the enterprise a is as follows: the direct stakeholders of enterprise a have enterprise B and enterprise C, enterprise B holds 40% of the shares of enterprise a, enterprise C holds 60% of the shares of enterprise a, the stakeholders of enterprise B have natural persons D and E, and D holds 20% of the shares of enterprise B, E holds 80% of the shares of enterprise B, the stakeholders of enterprise C have natural persons F, G and D, D holds 15% of the shares of enterprise C, F holds 50% of the shares of enterprise C, and G holds 35% of the shares of enterprise C. B, C, D, E, F and G are both stakeholders for enterprise a and B and C are direct stakeholders for enterprise a, D, E, F and G are indirect stakeholders for enterprise a.

In specific implementation, the method provided in the embodiment of the present disclosure may be applied to a pregel system, that is, the execution subject of the present solution is a pregel system, and specifically, may be a data processing apparatus installed on the pregel system. In a specific embodiment, the information about the rights of the enterprise may be obtained from the website of the industrial and commercial system in advance, and the obtained information about the rights of the enterprise may be converted into a format, for example, into a form of an adjacency list, and the information about the rights after the format conversion may be stored in a distributed file system, for example, a Hadoop distributed file system (Hadoop Distributed File System, HDFS).

The data processing device can acquire the information related to the equity of the enterprise from the distributed file system according to a set period, and can acquire the information related to the equity of the enterprise from the distributed file system after receiving the operation instruction.

Step 104, generating a corresponding share right relation network diagram of the enterprise based on the stockholder information of the enterprise and the share information held by each stockholder; the root node in the equity relation network diagram represents an enterprise, the child nodes represent stakeholders, and the connecting lines between the root node and the child nodes represent the information of the share-holding paths of the stakeholders.

The equity relationship network graph generated in step 104 is an equity relationship network tree graph, where the equity relationship tree graph includes a root node and a child node, the root node represents an enterprise, and the child node represents an equity of the enterprise.

For ease of understanding, the following description will be given with reference to the drawings.

Continuing with the above example, the equity relationship network graph generated based on the above example is shown in fig. 2, in the equity relationship network graph shown in fig. 2, a is a root node, B, C, D, E, F and G are child nodes, and a represents enterprise a, B, C, D, E, F and G each represent a stakeholder of enterprise a, where B and C represent direct stakeholders of enterprise a, and D, E, F and G represent indirect stakeholders of enterprise a; the connection between A and B, C, D, E, F and G represents B, C, D, E, F and G leg path information for enterprise A.

Step 106, determining path information from the root node to each child node in a mode that a target node with zero degree in the equity relation network diagram sends a message to the next layer of child nodes adjacent to the target node, and analyzing the stock holding information of each stakeholder based on the path information; the target node comprises a root node with zero initial incoming degree and a child node with zero incoming degree updated after receiving the message.

The determined path information from the root node to each sub-node comprises node paths which are undergone by the root node to each sub-node, and stock holding information of stakeholders corresponding to each sub-node.

In a specific implementation, after determining the path information from the root node to each child node, the path information may be output to a distributed file system for storage.

By degree of importation is meant the sum of the number of times a point in the directed graph is taken as the end point of an edge in the graph, i.e. the degree of importation of a node is equal to the number of directed edges ending with that node.

For example, taking fig. 2 as an example, the number of directed edges taking the node a as the end point is zero, so that the initial ingress of the node a is 0, and by this, it can be obtained that the initial ingress of the node B is 1, the initial ingress of the node C is 1, the initial ingress of the node E is 1, the initial ingress of the node D is 2, the initial ingress of the node F is 1, and the initial ingress of the node G is 1.

Generally, after a certain node receives a message sent by a node at a previous layer, an operation of updating the ingress is performed according to an instruction of the message, if the ingress of the node is updated to be zero and the node at the next layer exists, the operation of sending the message to the child node at the next layer is continuously performed until the ingress of the node updated at the certain node is zero and the node at the next layer does not exist, so that path information from the root node to each child node is determined.

In the embodiment of the present disclosure, the message sent by the target node to the next adjacent child node carries the node path between each child node and the node, which is undergone by the target node from the root node to the child node, the share information held by the stakeholder corresponding to each node, and the operation indication of the ingress degree of the child node receiving the message. For example, taking the above fig. 2 as an example, the initial ingress degree of the child node B is 1, the node path A, B is carried in the message sent by the node a to the child node B, the share information of the enterprise a held by the child node B, and the operation of indicating the ingress degree of the child node B to decrease by 1 are carried out by the child node B after receiving the message sent by the root node a, the ingress degree of the child node B after updating is 0, and since the child node B has the next layer of child nodes E and D, the child node B needs to send two messages to the child node E by sending the message to the child node E by the child node B, where the sent two messages are respectively: message 1, a node path A, B, E from a root node A to a child node E, wherein the stakeholder corresponding to the child node B holds the share information of the enterprise A, and the stakeholder corresponding to the child node E holds the share information of the enterprise B, and executes the operation of subtracting 1 from the income degree of the child node E; message 2, node path B, E from child node B to child node E, where the stakeholder corresponding to child node E holds the share information of enterprise B, and performs the operation of subtracting 0 from the ingress of child node E.

It should be noted that, in the embodiment of the present disclosure, the number of messages sent by each target node to its adjacent next-layer child node is equal to the number of layers where the target node is located in the share right relation network diagram, if the target node is the root node of the first layer, a message is sent to each child node in its adjacent next-layer child node, and if the target node is a child node in the second layer in the share right relation network diagram, two messages are sent to each child node in its adjacent next-layer child node respectively.

It should be noted that, the child nodes in the equity relation network graph include intermediate child nodes and leaf nodes; the leaf node is the last layer of child node in the equity relation network diagram; in general, the stakeholder corresponding to the leaf node is a natural person, and the stakeholder corresponding to the intermediate child node is an enterprise or a company, etc.

Accordingly, in a specific embodiment, in the step 106, the determining the path information from the root node to each child node by sending the message to the next child node adjacent to the target node with zero degree in the share-right relationship network graph specifically includes:

and determining the path information from the root node to each leaf node by sending a message to the next adjacent child node by the target node with zero degree in the share right relation network diagram.

For example, for the equity relationship network diagram shown in fig. 2, the child node D, the child node E, the child node F, and the child node G are all the last layer of child nodes in the equity relationship network diagram, and therefore, the child node D, the child node E, the child node F, and the child node G are leaf nodes of the equity relationship network diagram.

Fig. 3 is a second flowchart of a data processing method according to an embodiment of the present disclosure, where the method shown in fig. 3 at least includes the following steps:

step 302, acquiring information related to the share rights of at least one enterprise; the share right related information comprises the share information of the enterprise and the share information held by each share.

Step 304, generating a corresponding share right relation network diagram of the enterprise based on the stockholder information of the enterprise and the share information held by each stockholder; the root node in the equity relation network diagram represents an enterprise, the child nodes represent stakeholders, and the connecting lines between the root node and the child nodes represent the information of the share-holding paths of the stakeholders.

Step 306, determining path information from the root node to each leaf node by sending a message to the next layer of adjacent child nodes by the target node with zero degree in the equity relation network diagram; the target node comprises a root node with zero initial incoming degree and a child node with zero incoming degree updated after receiving the message; the leaf node is the child node of the last layer in the equity relation network diagram.

Step 308, analyzing the share holding information of each stakeholder based on the path information.

In the embodiment of the specification, when the path information from the root node to the child node in the equity relation network diagram is determined, only the path information from the root node to the leaf node is required to be determined, so that the determined path information can be reduced, the output of the path information can be reduced, the time consumption can be reduced, and the memory can be saved.

In the embodiment of the present disclosure, the method for determining path information from a root node to each leaf node by sending a message to its adjacent next-layer child node by using the target node with zero degree in the equity relationship network graph specifically includes the following steps one, two and three;

step one, determining a target node with zero degree and a next layer of child nodes in the equity relation network diagram;

step two, sending a message to the next layer of sub-nodes adjacent to the target node through the target node; the message carries the node path from the root node to each sub-node and the message receiving sub-node, which are experienced by the message receiving sub-node, the share information held by the stakeholder corresponding to each sub-node and the message receiving sub-node and the operation indication of the degree of entry of the message receiving sub-node;

And thirdly, receiving the incidence degree of the child nodes according to the operation indication update message, determining the leaf nodes in the equity relation network graph according to the incidence degree of each updated child node, and determining the path information from the root node to the leaf nodes based on the child node information from the root node to the leaf nodes.

The node path may be understood as node information experienced between each sub-node to the message receiving sub-node.

Specifically, in a specific implementation, the operation instruction is used for indicating to execute an operation of subtracting 0 or 1 from the incoming degree of the message receiving child node; correspondingly, in the third step, updating the ingress of the message receiving child node according to the operation instruction includes:

an operation of subtracting 0 or 1 is performed on the initial degree of entry of the message receiving child node.

In the implementation, every time a child node receives a message, an operation of subtracting 1 or subtracting 0 is performed on the incoming degree of the message receiving node according to the indication of the message. In general, if the node path carried in the message is a node path from the root node to the message receiving child node, the message indicates to perform the operation of subtracting 1 from the message receiving node. For ease of understanding, the following examples are presented.

Continuing with fig. 2, for the child node D, the initial ingress of the child node D is 2, and the message sent by the child node B to the child node D includes two messages, where the two messages sent are respectively: message 1, a node path A, B, D from a root node A to a child node D, wherein the stakeholder corresponding to the child node B holds the share information of the enterprise A, and the stakeholder corresponding to the child node D holds the share information of the enterprise B, and the operation of subtracting 1 from the income degree of the child node D is executed; message 2, node path B, D from child node B to child node D, where the stockholder corresponding to child node E holds the share information of enterprise B, and performs the operation of subtracting 0 from the ingress of child node E; after receiving the message sent by the child node B, the child node D performs operations of subtracting 1 and subtracting 0 on the ingress of the child node D, the ingress of the child node D obtained after updating is 1, and the message sent by the child node C to the child node D is two messages, which are respectively: message 1, a node path A, C, D from a root node A to a child node D, wherein the stakeholder corresponding to the child node C holds the share information of the enterprise A, and the stakeholder corresponding to the child node D holds the share information of the enterprise C, and executes the operation of subtracting 1 from the income degree of the child node D; and 2, carrying out the operation of subtracting 0 from the income degree of the child node D by the stakeholder corresponding to the child node D by the information 2 from the child node C to the node path C, D which the child node D experiences, and respectively executing the operation of subtracting 1 from the income degree of the child node D after the child node D receives the information sent by the child node C, wherein the income degree of the child node D obtained after updating is 0.

Specifically, in the third step, according to the updated ingress degree of each child node, a leaf node of the equity relationship network diagram is determined, including:

judging whether the degree of entering the updated child node is zero or not; if the ingress of the updated child node is zero and the child node does not exist in the next layer of child nodes, determining the child node as a leaf node.

In order to facilitate understanding of the specific procedure of determining path information from the root node to each leaf node in the data processing method provided in the embodiment of the present specification, the following will be described by taking fig. 2 as an example.

For the share relationship network diagram shown in fig. 2, the initial ingress degree of the node a is zero, so that it can be determined that the node a is a root node, the rest nodes are all sub-nodes, the next layer of sub-nodes of the root node a has sub-nodes B and C, the messages are respectively sent to the sub-nodes B and C through the root node a, the messages sent to the sub-nodes B by the root node a carry the node path from the root node a to the sub-nodes B, the share information of the enterprise a held by the corresponding stakeholders of the sub-nodes B, and the ingress degree of the sub-nodes B execute the operation instruction of subtracting 1, the ingress degree of the sub-nodes B is subtracted 1 after the sub-nodes B receive the messages sent by the root node a, the updated ingress degree of the sub-nodes B is 0, and the sub-nodes B need to be sent to the next layer of sub-nodes B, and the sub-nodes need to be sent to the sub-nodes D after the sub-nodes B are received respectively, the node B is sent to the next layer of the sub-nodes B: message 1, a node path A, B, E from a root node A to a child node E, wherein the stakeholder corresponding to the child node B holds the share information of the enterprise A, and the stakeholder corresponding to the child node E holds the share information of the enterprise B, and executes the operation of subtracting 1 from the income degree of the child node E; message 2, node path B, E from child node B to child node E, where the stakeholder corresponding to child node E holds the share information of enterprise B, and performs the operation of subtracting 0 from the ingress of child node E. The initial ingress of the sub node E is 1, after receiving the message sent by the sub node B, the operation of subtracting 1 from the ingress of the sub node E is performed, the ingress of the updated sub node E is zero, and the sub node E is determined to be a leaf node of the equity relation network diagram because the sub node E does not exist in the next layer of sub nodes.

The message sent by the child node B to the child node D includes two messages, where the two messages sent are: message 1, a node path A, B, D from a root node A to a child node D, wherein the stakeholder corresponding to the child node B holds the share information of the enterprise A, and the stakeholder corresponding to the child node D holds the share information of the enterprise B, and the operation of subtracting 1 from the income degree of the child node D is executed; the message 2, the node path B, D from the child node B to the child node D, the stockholder corresponding to the child node E holds the share information of the enterprise B, performs the operation of subtracting 0 from the ingress of the child node E, the initial ingress of the child node D is 2, performs the operation of subtracting 1 and 0 from the initial ingress of the child node D after receiving the message sent by the child node B, and temporarily saves the message sent by the child node B and received by the child node D because the ingress of the child node D after updating is not zero.

In addition, after the child node C receives the message sent by the root node a, an operation of subtracting 1 from the ingress of the child node C is performed, the ingress of the updated child node C is zero, and since the child node C has the next layer of child nodes D, F and G, the message is sent to the child node D, the child node F and the child node G by the child node C, respectively, after the child node D, the child node F and the child node G receive the message sent by the child node C, an operation of updating the ingress of the child node D, the child node E and the child node G is performed, and the ingress after updating is zero, and since the child node D, the child node F and the child node G do not have the next layer of child nodes, the child node D, the child node F and the child node G are leaf nodes of the stock relationship network diagram.

In the message transmission process, the transmitted message carries the node path from each node to the next layer of child nodes and the stock holding information of the stakeholders corresponding to each node, so that the path information from the root node A to the leaf node E can be determined as the node path A, B, E, 40% of the shares of the enterprise A are held by the stakeholders corresponding to the node B, and 80% of the shares of the enterprise B are held by the stakeholders corresponding to the node E; the path information from the root node A to the leaf node B is A, B, D and A, C, D, 40% of the shares of the enterprise A are held by the stakeholder corresponding to the node B, 20% of the shares of the enterprise B are held by the stakeholder corresponding to the node D, 60% of the shares of the enterprise A are held by the stakeholder corresponding to the node C, and 15% of the shares of the enterprise C are held by the stakeholder corresponding to the node D; the path information from the root node A to the leaf node F is that the node path is A, C, F, 60% of shares of the enterprise A are held by stakeholders corresponding to the node C, and 50% of shares of the enterprise C are held by stakeholders corresponding to the node F; the path information from the root node A to the leaf node G is that the node path is A, C, G, 60% of shares of the enterprise A are held by the stakeholder corresponding to the node C, and 35% of shares of the enterprise C are held by the stakeholder corresponding to the node G.

Fig. 4 is a flowchart of a method for determining path information from a root node to each leaf node in the data processing method according to the embodiment of the present disclosure, where the method shown in fig. 4 specifically includes the following steps:

and step 402, determining the initial degree of each node in the equity relation network diagram, and taking the node with the initial degree of zero as the root node of the equity relation network diagram.

Step 404, sending, by the root node, a message to a child node of a next layer of the root node.

Step 406, after the child node receives the message sent by the root node, updating the incoming degree of the message receiving child node according to the indication of the message.

Step 408, detecting whether the degree of ingress of the updated message receiving child node is zero; if yes, go to step 410, otherwise go to step 416.

Step 410, detecting whether the message receiving child node has a child node of the next layer; if so, go to step 412; otherwise, step 414 is performed.

Step 412, the message is sent by the message receiving sub-node to the next layer of sub-nodes of the message receiving sub-node.

The message receiving child node is determined to be a leaf node in the equity relationship network graph, step 414.

Step 416, save the message received by the message receiving child node.

Step 418 determines path information from the root node to each leaf node based on child node information experienced from the root node to each leaf node.

In the embodiment of the specification, the path information from the root node to each leaf node is determined by sending the message to the adjacent next-layer child node by the target node with zero incoming degree and the next-layer child node, so that each node is prevented from sending the message to the adjacent next-layer child node, the number of messages sent is reduced, the occupied memory space is reduced, time consumption is reduced, and efficiency is improved.

Fig. 5 is a third flowchart of a method of data processing according to an embodiment of the present disclosure, where the method shown in fig. 5 at least includes the following steps:

step 502, acquiring information related to the share rights of at least one enterprise; the share right related information comprises the share information of the enterprise and the share information held by each share.

And step 504, generating a corresponding share right relation network diagram of the enterprise based on the stakeholder information of the enterprise and the share information held by each stakeholder.

The root node in the equity relation network diagram represents an enterprise, the child nodes represent stakeholders, and the connecting lines between the root node and the child nodes represent the information of the share-holding paths of the stakeholders.

Step 506, determining the target node with zero degree and the next layer of sub-node in the equity relation network diagram.

Step 508, the message is sent to the next layer of child nodes of the target node through the target node, and the degree of ingress of the message receiving child nodes is updated according to the indication of the message.

Step 510, detecting whether the degree of ingress of the updated message receiving child node is zero; if yes, go to step 512, otherwise, go to step 518.

Step 512, detecting whether the message receiving child node has a child node of the next layer; if so, step 514 is performed, otherwise, step 516 is performed.

Step 514, the message is sent to the next layer of sub-nodes of the message receiving sub-node by the message receiving sub-node.

The message receiving child node is determined to be a leaf node in the equity relationship network graph, step 516.

Step 518, save the message received by the message receiving child node.

Step 520, determining path information from the root node to each leaf node based on child node information experienced from the root node to each leaf node.

And 522, analyzing the stock holding information of each stakeholder based on the path information.

In a specific implementation, in the step 106, the information of holding the stock of each stakeholder is analyzed based on the path information, which specifically includes the following steps:

The method comprises the steps of calculating the shares of an enterprise held by stakeholders corresponding to each leaf node based on the path information, and determining the maximum benefit stakeholders of the enterprise based on the shares of the enterprise held by stakeholders corresponding to each leaf node;

and/or the number of the groups of groups,

splitting the path information aiming at the path information from the root node to each leaf node to obtain sub-path information from the root node to each sub-node; based on the sub-path information, the shares of the enterprise held by each stakeholder are calculated.

In the embodiment of the specification, the analysis of the information of each stakeholder can be the analysis of the maximum beneficiary reached by each enterprise, or the analysis of the beneficiary of each stakeholder of an enterprise, or the analysis of the maximum beneficiary of an enterprise and the beneficiary of each stakeholder at the same time.

In implementation, the determined path information from the root node to each leaf node includes the stakeholder information corresponding to each child node, and one possible form is shown in table 1.

TABLE 1

As can be seen from the above table 1, the share of the enterprise a held by the stakeholder corresponding to the leaf node E is 0.32, the share of the enterprise a held by the stakeholder corresponding to the leaf node D is 0.08+0.09=0.17, the share of the enterprise a held by the stakeholder corresponding to the child node F is 0.3, and the share of the enterprise a held by the stakeholder corresponding to the child node G is 0.21. By comparison, the result can be that the stakeholder corresponding to the leaf node E has the largest share of the enterprise A, and the stakeholder corresponding to the leaf node E is the largest beneficiary of the enterprise A.

Continuing with the path A, B, E in table 1, it is described how to calculate the shares held by stakeholders corresponding to each node. Splitting the A, B, E path to obtain sub-paths A, B and A, B, E, and calculating that the share of the enterprise a held by the stakeholder corresponding to the sub-node B is 0.4 and the share of the enterprise a held by the stakeholder corresponding to the sub-node E is 0.32 through the sub-path A, B.

Of course, under the condition that the equity relation network diagram is simpler, the path information from the root node to each child node can be directly output, so that the benefit condition of stakeholders corresponding to each node (including intermediate nodes and leaf nodes) can be calculated without splitting the path information.

In addition, in the implementation, a situation of cyclic strand holding may occur, such as a strand holding B, B strand holding C, C strand holding D, and D strand holding a, which belongs to cyclic strand holding, and if in the case of cyclic strand holding, if a node of the cyclic strand holding is encountered in the manner of sending a message, the message is stopped from being sent to a node of a next layer continuously, so in the embodiment of the present specification, the benefit of each stockholder in the cyclic strand holding is calculated by calculating a strong communication component.

Accordingly, the present specification provides a method according to an embodiment, further comprising:

and determining the strong communication component in the share right relation network diagram, and calculating the number of accumulated shares of the enterprise held by each stakeholder in the strong communication component.

In addition, in the implementation, when the equity relation network diagram is constructed, if the numbers of the enterprises or stakeholders are directly used for identifying each node, the numbers are longer, so that a larger storage space is occupied. Therefore, in the embodiment of the present disclosure, in order to reduce the space occupied by the equity relationship network diagram, encoding processing, such as hashing processing, may be performed on numbers corresponding to the enterprises and stakeholders to obtain corresponding identification values, so in the embodiment of the present disclosure, in the step 104, the generating the equity relationship network diagram corresponding to the enterprises based on the stakeholder information of the enterprises and the share information of the enterprises held by each stakeholder specifically includes:

determining the identification information of the enterprise and determining the identification information of the stakeholder information; and taking the identification information of the enterprise as a root node of the equity relation network diagram, taking the identification information of the equity information as a child node of the equity relation network diagram, and connecting each node with the child node and the child node based on the equity information held by each equity to obtain the equity relation network diagram.

In order to facilitate understanding of the method provided in the embodiments of the present disclosure, the method provided in the embodiments of the present disclosure will be described below by taking an example of analyzing the maximum benefit of the enterprise a, and fig. 6 is a flowchart of a method of the data processing method provided in the embodiments of the present disclosure, where the method shown in fig. 6 at least includes the following steps:

step 602, acquiring information related to the share right of enterprise A; the share right related information comprises the share information of the enterprise A and the share information held by each share.

Wherein, the stakeholder information includes direct stakeholder information and indirect stakeholder information of the enterprise A.

And step 604, coding the stakeholders of the enterprise A and the enterprise A to obtain the identification information corresponding to each stakeholder and the enterprise.

And step 606, taking the identification of the enterprise A as a root node, taking the identification of each stakeholder as a child node, and connecting the root node with each child node and each child node with the child node according to the share information held by each stakeholder to obtain a share right relation network diagram of the enterprise A.

Step 608, determining the target node with zero degree and the next layer of sub-node in the equity relation network diagram.

Step 610, send a message to the next layer of child nodes of the target node through the target node, and update the ingress of the message receiving child nodes according to the indication of the message.

Step 612, detecting whether the degree of ingress of the updated message receiving child node is zero; if yes, go to step 614, otherwise, go to step 620.

Step 614, detecting whether the message receiving child node has a child node of the next layer; if so, step 616 is performed, otherwise, step 618 is performed.

Step 616, the message is sent by the message receiving sub-node to the next layer of sub-nodes of the message receiving sub-node.

The message receiving child node is determined as a leaf node in the equity relationship network graph, step 618.

Step 620, save the message received by the message receiving child node.

Step 622, determining path information from the root node to each leaf node based on the child node information experienced from the root node to each leaf node.

The path information comprises the stock holding information of stakeholders corresponding to all child nodes experienced from the root node to the leaf node.

Step 624, calculating the share of the enterprise a held by the stakeholder corresponding to each leaf node according to the path information, and determining the most beneficial stakeholder of the enterprise a based on the share of the enterprise a held by the stakeholder corresponding to each leaf node.

After acquiring the information related to the equity of the enterprise, the data processing method provided by the embodiment of the specification constructs an equity relation network diagram of the enterprise, a root node in the constructed equity relation network diagram represents the enterprise, a child node represents the equity, a connecting line between the root node and the child node represents the equity holding path information of the equity, the path information from the root node to each child node in the equity relation network diagram is determined by sending a message to the adjacent next-layer child node through a target node with zero degree in the equity relation network diagram, and the path information is the equity holding path information of each equity, namely, the equity holding path information of each equity is analyzed based on the path information; in the embodiment of the specification, the analysis of the stakeholder information is realized by determining the path information from the root node to the child node, and when the path information from the root node to the child node is determined, the message is sent to the adjacent child node at the next layer through the target node with zero incoming degree, so that each node is prevented from sending the message to the child node at the next layer, the quantity of the sent messages is reduced, the time consumption for determining the path information is reduced, and the processing efficiency is improved.

Corresponding to the method provided in the embodiments of the present disclosure, based on the same concept, the embodiments of the present disclosure further provide a data processing apparatus configured to execute the data processing method provided in the embodiments of the present disclosure, and fig. 7 is a schematic block diagram of the data processing apparatus provided in the embodiments of the present disclosure, where the apparatus shown in fig. 7 includes:

an obtaining module 702, configured to obtain information about the equity of at least one enterprise; the share right related information comprises the share information of the enterprise and the share information held by each share;

a generating module 704, configured to generate a share right relationship network diagram corresponding to the enterprise based on the stakeholder information of the enterprise and the share information held by each stakeholder; the root node in the equity relation network diagram represents an enterprise, the child nodes represent stakeholders, and the connecting lines between the root node and the child nodes represent the information of the share-holding paths of the stakeholders;

a first determining module 706, configured to determine path information from the root node to each child node by sending a message to its adjacent next-layer child node by a target node with a degree of zero in the share right relationship network diagram; the target node comprises a root node with zero initial incoming degree and a child node with zero incoming degree updated after receiving the message;

An analysis module 708 is configured to analyze the share-holding information of each stakeholder based on the path information.

Optionally, the child nodes include an intermediate child node and a leaf node; the leaf node is the child node of the last layer in the equity relation network diagram;

the first determining module 706 includes:

and the first determining unit is used for determining the path information from the root node to each leaf node in a mode that the target node with zero degree in the equity relation network diagram sends a message to the adjacent next-layer child node.

Optionally, the first determining unit includes:

the first determining subunit is used for determining a target node with zero degree and a next layer of child nodes in the equity relation network diagram;

a transmitting subunit, configured to transmit a message to a next-layer child node adjacent to the target node through the target node; the message carries the node path from the root node to each sub-node and the message receiving sub-node, which are experienced by the message receiving sub-node, the share information held by the stakeholders corresponding to the experienced sub-nodes and the message receiving sub-node, and the operation indication of the income degree of the message receiving sub-node;

an updating subunit, configured to update the degree of ingress of the message receiving child node according to the operation instruction;

The second determining subunit is used for determining leaf nodes of the equity relation network graph according to the updated degree of each child node;

and a third determination subunit configured to determine path information from the root node to the leaf node based on the child node information undergone from the root node to the leaf node.

Optionally, the operation instruction is used for indicating to execute an operation of subtracting 0 or 1 on the incoming degree of the message receiving child node;

the update subunit is specifically configured to:

the operation of subtracting 0 or 1 is performed on the initial degree of entry of the message receiving child node.

Optionally, the second determining subunit is specifically configured to:

Optionally, the analysis module 708 includes:

the first analysis unit is used for calculating the shares of the enterprise held by the stakeholders corresponding to each leaf node based on the path information, and determining the most beneficial stakeholders of the enterprise based on the shares of the enterprise held by the stakeholders corresponding to each leaf node;

and/or the number of the groups of groups,

the second analysis unit is used for splitting the path information aiming at the path information from the root node to each leaf node to obtain sub-path information from the root node to each sub-node; based on the sub-path information, the shares of the enterprise held by each stakeholder are calculated.

Optionally, an apparatus provided in an embodiment of the present disclosure includes:

the second determining module is used for determining the strong communication component in the equity relation network diagram;

and the calculation module is used for calculating the number of accumulated shares of the enterprise held by each stakeholder in the strong communication component.

Optionally, the generating module 704 includes:

a second determining unit, configured to determine identification information of an enterprise, and determine identification information of stakeholder information;

the generating unit is used for taking the identification information of the enterprise as a root node of the equity relation network diagram, taking the identification information of the equity information as a child node of the equity relation network diagram, and connecting the root node with the child node and the child node with the child node based on the equity information held by each equity to obtain the equity relation network diagram.

The data processing apparatus according to the embodiments of the present disclosure may further execute the method executed by the data processing apparatus in fig. 1 to 6, and implement the functions of the data processing apparatus in the embodiments shown in fig. 1 to 6, which are not described herein again.

After acquiring the information related to the equity of the enterprise, the data processing device provided in the embodiment of the present disclosure constructs a equity relationship network diagram of the enterprise, a root node in the constructed equity relationship network diagram represents the enterprise, a child node represents the equity, a connection line between the root node and the child node represents the equity holding path information of the equity, and the path information from the root node to each child node in the equity relationship network diagram is determined by sending a message to an adjacent next-layer child node through a target node with zero degree in the equity relationship network diagram, wherein the path information is the equity holding path information of each equity, namely, the equity holding path information of each equity is analyzed based on the path information; in the embodiment of the specification, the analysis of the stakeholder information is realized by determining the path information from the root node to the child node, and when the path information from the root node to the child node is determined, the message is sent to the adjacent child node at the next layer through the target node with zero incoming degree, so that each node is prevented from sending the message to the child node at the next layer, the quantity of the sent messages is reduced, the time consumption for determining the path information is reduced, and the processing efficiency is improved.

Further, based on the methods shown in fig. 1 to 6, the embodiment of the present disclosure further provides a data processing apparatus, as shown in fig. 8.

The data processing apparatus may vary considerably in configuration or performance and may include one or more processors 801 and memory 802, where the memory 802 may store one or more stored applications or data. Wherein the memory 802 may be transient storage or persistent storage. The application programs stored in memory 802 may include one or more modules (not shown), each of which may include a series of computer executable instruction information for a data processing apparatus. Still further, the processor 801 may be configured to communicate with a memory 802 and execute a series of computer executable instruction information in the memory 802 on a data processing device. The data processing device may also include one or more power supplies 803, one or more wired or wireless network interfaces 804, one or more input/output interfaces 805, one or more keyboards 806, and the like.

In a particular embodiment, a data processing apparatus includes a memory, and one or more programs, wherein the one or more programs are stored in the memory, and the one or more programs may include one or more modules, and each module may include a series of computer-executable instruction information for the data processing apparatus, and execution of the one or more programs by one or more processors includes instructions for:

generating a corresponding share right relation network diagram of the enterprise based on the share information of the enterprise and the share information held by each share; the root node in the equity relation network diagram represents an enterprise, the child nodes represent stakeholders, and the connecting lines between the root node and the child nodes represent the information of the share-holding paths of the stakeholders;

determining path information from a root node to each child node in a mode that a target node with zero degree in the equity relation network diagram sends a message to the next layer of child nodes adjacent to the target node, and analyzing stock holding information of each stakeholder based on the path information; the target node comprises a root node with zero initial incoming degree and a child node with zero incoming degree updated after receiving the message.

Optionally, the child nodes include intermediate child nodes and leaf nodes when the computer executable instruction information is executed; the leaf node is the child node of the last layer in the equity relation network diagram;

determining path information from a root node to each child node by sending a message to a next layer of child nodes adjacent to the target node with zero degree in the share right relation network diagram, wherein the path information comprises the following steps:

Optionally, when the computer executable instruction information is executed, determining path information from the root node to each leaf node by sending a message to an adjacent next-layer child node by a target node with zero degree in the share-right relation network graph, including:

determining a target node with zero degree of entry and a next layer of child nodes in the equity relation network diagram;

sending a message to the next layer of sub-nodes adjacent to the target node through the target node; the message carries the node path from the root node to each sub-node and the message receiving sub-node, which are experienced by the message receiving sub-node, the share information held by the stakeholders corresponding to the experienced sub-nodes and the message receiving sub-node, and the operation indication of the income degree of the message receiving sub-node;

and receiving the incidence degree of the child nodes according to the operation indication update message, determining the leaf nodes in the stock right relation network graph according to the incidence degree of each updated child node, and determining the path information from the root node to the leaf nodes based on the child node information experienced from the root node to the leaf nodes.

Optionally, the computer executable instruction information, when executed, is operative to instruct performing a minus 0 or 1 operation on the degree of ingress of the message receiving child node;

updating the degree of ingress of the message receiving child node according to the operation instruction, comprising:

Optionally, when the computer executable instruction information is executed, determining a leaf node of the equity relation network graph according to the updated ingress degree of each child node, including:

judging whether the degree of entering the updated child node is zero or not;

if the ingress of the updated child node is zero and the child node does not exist in the next layer of child nodes, determining the child node as a leaf node.

Optionally, the computer executable instruction information, when executed, analyzes the stock holding information of each stakeholder based on the path information, including:

the method comprises the steps of calculating the shares of an enterprise held by stakeholders corresponding to each leaf node based on path information, and determining the most beneficial stakeholders of the enterprise based on the shares of the enterprise held by stakeholders corresponding to each leaf node;

and/or the number of the groups of groups,

Optionally, the computer executable instruction information, when executed, may further perform the steps of:

Optionally, when the computer executable instruction information is executed, generating a share right relation network diagram corresponding to the enterprise based on the share information of the enterprise and the share information held by each share, including:

determining the identification information of the enterprise and determining the identification information of the stakeholder information;

and taking the identification information of the enterprise as a root node of the equity relation network diagram, taking the identification information of the equity information as a child node of the equity relation network diagram, and connecting the root node with the child node and the child node with the child node based on the equity information held by each equity to obtain the equity relation network diagram.

After acquiring the information related to the equity of the enterprise, the data processing equipment provided in the embodiment of the specification constructs an equity relation network diagram of the enterprise, a root node in the constructed equity relation network diagram represents the enterprise, a child node represents the equity, a connecting line between the root node and the child node represents the equity holding path information of the equity, the path information from the root node to each child node in the equity relation network diagram is determined by sending a message to an adjacent next-layer child node through a target node with zero degree in the equity relation network diagram, and the path information is the equity holding path information of each equity, namely, the equity holding path information of each equity is analyzed based on the path information; in the embodiment of the specification, the analysis of the stakeholder information is realized by determining the path information from the root node to the child node, and when the path information from the root node to the child node is determined, the message is sent to the adjacent child node at the next layer through the target node with zero incoming degree, so that each node is prevented from sending the message to the child node at the next layer, the quantity of the sent messages is reduced, the time consumption for determining the path information is reduced, and the processing efficiency is improved.

Further, based on the method shown in fig. 1 to 6, the embodiment of the present disclosure further provides a storage medium, which is used to store computer executable instruction information, and in a specific embodiment, the storage medium may be a U disc, an optical disc, a hard disk, etc., where the computer executable instruction information stored in the storage medium can implement the following flow when executed by a processor:

Optionally, the storage medium stores computer executable instruction information that, when executed by the processor, includes intermediate child nodes and leaf nodes; the leaf node is the child node of the last layer in the equity relation network diagram;

Optionally, the computer executable instruction stored in the storage medium, when executed by the processor, determines path information from the root node to each leaf node by sending a message to an adjacent next-layer child node by a target node with zero degree in the equity relationship network graph, including:

Optionally, the storage medium stores computer executable instruction information which, when executed by the processor, indicates that the operation of subtracting 0 or 1 is performed on the degree of ingress of the message receiving child node;

Optionally, the computer executable instruction information stored in the storage medium, when executed by the processor, determines a leaf node of the equity relationship network graph according to the updated ingress degree of each child node, including:

judging whether the degree of entering the updated child node is zero or not;

Optionally, the computer executable instruction information stored on the storage medium, when executed by the processor, analyzes the stock information of each stakeholder based on the path information, including:

and/or the number of the groups of groups,

In the alternative, the computer executable instruction information stored in the storage medium, when executed by the processor, may further perform the steps of:

Optionally, when the computer executable instruction information stored in the storage medium is executed by the processor, generating a share right relation network diagram corresponding to the enterprise based on the share information of the enterprise and the share information held by each share, including:

When the computer executable instruction information stored in the storage medium provided by the embodiment of the specification is executed by the processor, after the information about the share right of the enterprise is acquired, constructing a share right relation network diagram of the enterprise, wherein a root node in the constructed share right relation network diagram represents the enterprise, a child node represents a stakeholder, a connecting line between the root node and the child node represents the stay path information of the stakeholder, the path information from the root node to each child node in the share right relation network diagram is determined in a mode that a target node with zero degree in the share right relation network diagram sends a message to the next adjacent child node, and the path information is the stay path information of each stakeholder, namely, the stay information of each stakeholder is analyzed based on the path information; in the embodiment of the specification, the analysis of the stakeholder information is realized by determining the path information from the root node to the child node, and when the path information from the root node to the child node is determined, the message is sent to the adjacent child node at the next layer through the target node with zero incoming degree, so that each node is prevented from sending the message to the child node at the next layer, the quantity of the sent messages is reduced, the time consumption for determining the path information is reduced, and the processing efficiency is improved.

In the 90 s of the 20 th century, improvements to one technology could clearly be distinguished as improvements in hardware (e.g., improvements to circuit structures such as diodes, transistors, switches, etc.) or software (improvements to the process flow). However, with the development of technology, many improvements of the current method flows can be regarded as direct improvements of hardware circuit structures. Designers almost always obtain corresponding hardware circuit structures by programming improved method flows into hardware circuits. Therefore, an improvement of a method flow cannot be said to be realized by a hardware entity module. For example, a programmable logic device (Programmable Logic Device, PLD) (e.g., field programmable gate array (Field Programmable Gate Array, FPGA)) is an integrated circuit whose logic function is determined by the programming of the device by a user. A designer programs to "integrate" a digital system onto a PLD without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Moreover, nowadays, instead of manually manufacturing integrated circuit chips, such programming is mostly implemented by using "logic compiler" software, which is similar to the software compiler used in program development and writing, and the original code before the compiling is also written in a specific programming language, which is called hardware description language (Hardware Description Language, HDL), but not just one of the hdds, but a plurality of kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), lava, lola, myHDL, PALASM, RHDL (Ruby Hardware Description Language), etc., VHDL (Very-High-Speed Integrated Circuit Hardware Description Language) and Verilog are currently most commonly used. It will also be apparent to those skilled in the art that a hardware circuit implementing the logic method flow can be readily obtained by merely slightly programming the method flow into an integrated circuit using several of the hardware description languages described above.

The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer readable medium storing computer readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, application specific integrated circuits (Application Specific Integrated Circuit, ASIC), programmable logic controllers, and embedded microcontrollers, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, atmel AT91SAM, microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic of the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller in a pure computer readable program code, it is well possible to implement the same functionality by logically programming the method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers, etc. Such a controller may thus be regarded as a kind of hardware component, and means for performing various functions included therein may also be regarded as structures within the hardware component. Or even means for achieving the various functions may be regarded as either software modules implementing the methods or structures within hardware components.

The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

For convenience of description, the above devices are described as being functionally divided into various units, respectively. Of course, the functions of each element may be implemented in one or more software and/or hardware elements when implemented in the present application.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the specification. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instruction information. These computer program instruction information may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instruction information, which is executed by the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instruction information may also be stored in a computer readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instruction information stored in the computer readable memory produce an article of manufacture including instruction information means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instruction information may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instruction information which is executed on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.

Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instruction information, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The application may be described in the general context of computer-executable instruction information, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.

The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and changes may be made to the present application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. which are within the spirit and principles of the present application are intended to be included within the scope of the claims of the present application.

Claims

1. A method of data processing, the method comprising:

2. The method of claim 1, the child nodes comprising intermediate child nodes and leaf nodes; the leaf node is the last layer of child node in the equity relation network diagram;

the method for determining the path information from the root node to each sub-node by sending the message to the next adjacent sub-node by the target node with zero degree in the equity relation network graph comprises the following steps:

and determining path information from the root node to each leaf node by sending a message to the next adjacent child node by the target node with zero degree in the stock right relation network diagram.

3. The method as set forth in claim 2, wherein determining path information from the root node to each leaf node by sending a message from the target node with zero degree in the equity relationship network graph to its adjacent next-layer child node includes:

Determining a target node with zero degree and a next layer of child nodes in the equity relation network diagram;

sending a message to a next layer of child nodes adjacent to the target node through the target node; the message carries the node path between each sub-node and the message receiving sub-node, which is experienced from the root node to the message receiving sub-node, the share information held by the stakeholder corresponding to each sub-node and the message receiving sub-node, and the operation instruction of the ingress degree of the message receiving sub-node;

updating the ingress degree of the message receiving child node according to the operation instruction, determining a leaf node in the stock right relation network diagram according to the updated ingress degree of each child node, and determining path information from the root node to the leaf node based on child node information experienced from the root node to the leaf node.

4. The method of claim 3, the operation indication to indicate that an operation of subtracting 0 or 1 is performed on the degree of ingress of the message receiving child node;

the updating the ingress of the message receiving child node according to the operation instruction comprises the following steps:

and performing an operation of subtracting 0 or 1 on the initial incoming degree of the message receiving child node.

5. The method of claim 3, wherein the determining the leaf node of the equity relationship network graph according to the updated ingress degree of each child node comprises:

judging whether the updated degree of incidence of the child node is zero or not;

and if the updated degree of the child node is zero and the child node does not exist in the next layer of child nodes, determining the child node as the leaf node.

6. The method of claim 2, the analyzing the stock information of each stakeholder based on the path information, comprising:

the shares of the enterprise held by the stakeholders corresponding to each leaf node are calculated based on the path information, and the maximum benefit stakeholders of the enterprise are determined based on the shares of the enterprise held by the stakeholders corresponding to each leaf node;

and/or the number of the groups of groups,

splitting the path information aiming at the path information from the root node to each leaf node to obtain sub-path information from the root node to each sub-node; and calculating the shares of the enterprise held by each stakeholder based on the sub-path information.

7. The method of claim 1, the method further comprising:

And determining a strong communication component in the equity relation network diagram, and calculating the number of accumulated equity of the enterprise held by each stakeholder in the strong communication component.

8. The method as set forth in claim 1, wherein the generating a equity relationship network diagram corresponding to the enterprise based on equity information of the enterprise and equity information held by each equity includes:

determining the identification information of the enterprise, and determining the identification information of the stakeholder information;

9. A data processing apparatus, the apparatus comprising:

10. The apparatus of claim 9, the child nodes comprising intermediate child nodes and leaf nodes; the leaf node is the last layer of child node in the equity relation network diagram;

the first determining module includes:

11. The apparatus of claim 10, the first determining unit comprising:

a first determining subunit, configured to determine a target node in the equity relationship network graph, where the degree of entry is zero and a next-layer child node exists;

a sending subunit, configured to send a message to a next layer of subnodes adjacent to the target node through the target node; the message carries the node path between each sub-node and the message receiving sub-node, which is experienced from the root node to the message receiving sub-node, the share information held by the stakeholders corresponding to the experienced sub-nodes and the message receiving node, and the operation instruction of the ingress degree of the message receiving sub-node;

An updating subunit, configured to update the incoming degree of the message receiving child node according to the operation instruction;

the second determining subunit is used for determining leaf nodes of the equity relation network graph according to the updated degree of entry of each child node;

and a third determination subunit configured to determine path information from the root node to the leaf node based on child node information experienced from the root node to the leaf node.

12. The apparatus of claim 10, the analysis module comprising:

and/or the number of the groups of groups,

a second analysis unit, configured to split path information from the root node to each leaf node, to obtain sub-path information from the root node to each sub-node; and calculating the shares of the enterprise held by each stakeholder based on the sub-path information.

13. The apparatus of claim 9, the apparatus further comprising:

the second determining module is used for determining strong connected components in the share right relation network diagram;

14. A data processing apparatus comprising:

a processor; and

15. A storage medium storing computer-executable instructions that when executed implement the following: