Specific embodiment
In order to make those skilled in the art better understand the technical solutions in the application, below in conjunction with this specification
Attached drawing in embodiment is clearly and completely described the technical solution in this specification embodiment, it is clear that described
Embodiment is merely a part but not all of the embodiments of the present application.Based on the embodiment in the application, this field
Those of ordinary skill's every other embodiment obtained without creative efforts, all should belong to the application
The range of protection.
The thought of this specification embodiment is, constructs the equity relational network figure of enterprise, and pass through the equity network of personal connections
The node that in-degree is zero in network figure determines in the equity relational network figure to the mode that its next node layer sends message from root section
Point is analyzed to the routing information between each child node based on equity information of the routing information to enterprise;I.e. in this explanation
In book embodiment, the equity problem analysis of enterprise conversion is determined in equity relational network figure from root node to child node
The problem of path, also, in-degree be zero node successively to next node layer send message by way of, it is possible to reduce send
The quantity of message, to realize the routing information quickly and easily determined from root node to each child node.Based on this, this explanation
Book embodiment provides a kind of data processing method, device, equipment and storage medium, following to be introduced in detail one by one.
One of the method flow diagram of data processing method that Fig. 1 provides for this specification embodiment, method shown in FIG. 1,
Including at least following steps:
Step 102, the equity relevant information of at least one enterprise is obtained;Wherein, equity relevant information includes the stock of enterprise
The share information that Eastcom's breath and each shareholder are held.
In above-mentioned steps 102, the equity relevant information obtained in advance from mechanisms such as industrial and commercial system websites can be stored
It on data storing platform, is such as stored in distributed file system, when executing the method that this specification embodiment provides, then
The equity relevant information of at least one enterprise is obtained from distributed file system.
In the specific implementation, the equity relevant information of one or more enterprise can be obtained based on practical application scene.
If then can only obtain the equity relevant information of the enterprise for example, needing to analyze the equity relationship of some enterprise, if
It is to need to analyze the equity relationship of multiple enterprises, then can obtains the equity relevant information of multiple enterprises, this theory simultaneously
Bright book embodiment is defined not to this.
Wherein, the equity relevant information arrived mentioned in above-mentioned steps 102 includes at least the shareholder of each enterprise, and every
The share that a shareholder is held.The mentioned shareholder arrived can be enterprise, or natural person, the shareholder include direct shareholder
With indirect shareholder.For ease of understanding, following to be illustrated citing.
For example, in a specific embodiment, if the equity information to enterprise A is analyzed, then needing to obtain enterprise
The equity relevant information of industry A, the equity relevant information of acquired enterprise A include that the shareholder of enterprise A and each shareholder are held
Some number of shares.Wherein, the shareholder of acquired enterprise A includes the direct shareholder for directly holding the share of enterprise A, and indirectly
The indirect shareholder for holding the share of enterprise A, for indirect shareholder, the share held can be certain for the enterprise A that it is held
The quantity of the share of a directly or indirectly enterprise shareholder.Equity relevant information such as acquired enterprise A is as follows: enterprise
The direct shareholder of A has enterprise B and enterprise C, and enterprise B holds 40% share of enterprise A, and enterprise C holds 60% stock of enterprise A
Part, the shareholder of enterprise B has natural person D and E, and D holds 20% share of enterprise B, and E holds 80% share of enterprise B, enterprise
The shareholder of industry C has natural person F, G and D, and D holds 15% share of enterprise C, and F holds 50% share of enterprise C, and G holds enterprise
35% share of industry C.Then B, C, D, E, F and G are the shareholder of enterprise A, and B and C is the direct shareholder of enterprise A, D, E, F and
G is the indirect shareholder of enterprise A.
In the specific implementation, the method that this specification embodiment provides can be applied to pregel system, i.e. this programme
Executing subject is pregel system, specifically, can be the data processing equipment being mounted in pregel system.A kind of specific
In embodiment, the equity relevant information of enterprise can be obtained from industrial and commercial system website in advance, and related to acquired equity
Information formats, and is such as converted to the form of adjacency list, and the equity relevant information after format is converted is stored in distribution
In formula file system, in Hadoop distributed file system (Hadoop Distributed File System, HDFS).
Data processing equipment can obtain the equity relevant information of enterprise according to the setting period from distributed file system,
The equity relevant information of enterprise can be obtained from distributed file system after receiving operational order.
Step 104, the share information that shareholder's information based on enterprise and each shareholder are held generates stock corresponding to enterprise
Weigh relational network figure;Wherein, root node in the equity relational network figure indicates enterprise, and child node indicates shareholder, root node with
Line between child node indicates the share-holding routing information of shareholder.
Wherein, equity relational network figure generated in above-mentioned steps 104 is equity relational network arborescence, shareholder's net
It include root node and child node in network relationship arborescence, root node indicates enterprise, and child node indicates the shareholder of enterprise.
For ease of understanding, following to be described with reference to the figures.
Continue to use the example above, based on the example above equity relational network figure generated as shown in Fig. 2, shown in Fig. 2
In equity relational network figure, A is root node, and B, C, D, E, F and G are child node, and A represents enterprise A, and B, C, D, E, F and G are equal
Indicate the shareholder of enterprise A, wherein B and C indicates that the direct shareholder of enterprise A, D, E, F and G indicate the indirect shareholder of enterprise A;A with
B, the line between C, D, E, F and G then indicates that B, C, D, E, F and G are directed to the share-holding routing information of enterprise A.
Step 106, the destination node for being zero by in-degree in equity relational network figure is to its adjacent next level of child nodes
The mode for sending message is determined from root node to the routing information of each child node, and based on the routing information to the share-holding of each shareholder
Information is analyzed;Wherein, above-mentioned destination node include initial in-degree be zero root node and receive message after in-degree be updated to
Zero child node.
It wherein, from root node to the routing information of each child node include from root node to each child node institute determined by above-mentioned
The node path of experience, the share-holding information of shareholder corresponding to each child node.
It in the specific implementation, can be by the routing information after determining from root node to the routing information of each child node
Output to distributed file system is stored.
So-called in-degree refers to that certain in digraph puts the sum of the number of terminal as side in figure, the i.e. in-degree etc. of certain node
In the number of the directed edge using the node as terminal.
For example, the number using node A as the directed edge of terminal is zero by taking Fig. 2 as an example, and therefore, the initial in-degree of node A
It is 0, and so on, it can be deduced that the initial in-degree of node B is 1, the initial in-degree of node C is 1, the initial in-degree of node E is
1, the initial in-degree of node D is 2, and the initial in-degree of node F is 1, the initial in-degree of node G is 1.
In general, after some node receives the message that a upper node layer is sent, according to the instruction of the message execute into
The operation that degree updates then continues to execute if the in-degree of the node is updated to zero, and a node layer in the presence of the node to next
Level of child nodes sends the operation of message, until in-degree after some node updates is zero, and there is no until next node layer,
The routing information from root node to each child node is determined with this.
It should be noted that destination node is sent to disappearing for adjacent next level of child nodes in this specification embodiment
It is carried in breath from root node to the node path the child node each child node experienced and the node, it is experienced each
The share information that shareholder corresponding to node is held, and the operation instruction of the in-degree to the child node for receiving the message.For example,
By taking above-mentioned Fig. 2 as an example, the initial in-degree of child node B is 1, node A be sent in the message of child node B carry node path A,
The share information for the enterprise A that B, child node B are held, and the operation that instruction subtracts 1 to the in-degree of child node B, child node B are connecing
After the message for receiving root node A transmission, the operation that in-degree subtracts 1 is executed, the in-degree of child node B is 0 after update, due to child node B
In the presence of level of child nodes an E and D message is therefore sent to child node E and child node D by child node B, child node B need to
Child node E sends two message, and two transmitted message are respectively as follows: message 1, the section experienced from root node A to child node E
Path A, B, E are put, shareholder corresponding to child node B holds the share information of enterprise A, and shareholder corresponding to child node E holds enterprise
The share information of industry B executes the operation for subtracting 1 to the in-degree of child node E;Message 2, the section experienced from child node B to child node E
Path B, E are put, shareholder corresponding to child node E holds the share information of enterprise B, executes the behaviour for subtracting 0 to the in-degree of child node E
Make.
It should be noted that each destination node is sent out to its adjacent next level of child nodes in this specification embodiment
The quantity for the message sent is equal with the destination node number of plies locating in equity relational network figure, if destination node is first layer
Root node, then each child node into its adjacent next level of child nodes sends a message, if destination node is place
The child node of the second layer in equity relational network figure, then each child node into its adjacent next level of child nodes is sent out respectively
Send two message.
It should be noted that the child node in equity relational network figure includes intermediate child node and leaf node;So-called leaf
Child node is then the last layer child node in equity relational network figure;In general, shareholder corresponding to leaf node is nature
People, shareholder corresponding to intermediate child node are enterprise or company etc..
Correspondingly, in a specific embodiment, in above-mentioned steps 106, being by in-degree in equity relational network figure
Zero destination node is determined to the mode that its adjacent next level of child nodes sends message from root node to the path of each child node
Information specifically includes:
The destination node for being zero by in-degree in equity relational network figure sends message to its adjacent next level of child nodes
Mode determine from root node to the routing information of each leaf node.
For example, being directed to equity relational network figure shown in Fig. 2, child node D, child node E, child node F and child node G are
The last layer child node in the equity cyberrelationship figure, therefore, child node D, child node E, child node F and child node G are should
The leaf node of equity relational network figure.
Fig. 3 is the two of the method flow diagram for the data processing method that this specification embodiment provides, and method shown in Fig. 3 is extremely
Include the following steps: less
Step 302, the equity relevant information of at least one enterprise is obtained;Wherein, which includes enterprise
The share information that shareholder's information and each shareholder are held.
Step 304, the share information that shareholder's information based on enterprise and each shareholder are held generates stock corresponding to enterprise
Weigh relational network figure;Wherein, root node in the equity relational network figure indicates enterprise, and child node indicates shareholder, root node with
Line between child node indicates the share-holding routing information of shareholder.
Step 306, the destination node for being zero by in-degree in equity relational network figure is to its adjacent next level of child nodes
The mode for sending message is determined from root node to the routing information of each leaf node;Wherein, destination node includes that initial in-degree is
In-degree is updated to zero child node after zero root node and reception message;Leaf node is last in equity relational network figure
Level of child nodes.
Step 308, it is analyzed based on share-holding information of the above-mentioned routing information to each shareholder.
Routing information in this specification embodiment, in determining equity relational network figure from root node to child node
When, it is only necessary to determine the routing information from root node to leaf node can reduce determined routing information in this way,
So as to reduce the output of routing information, time-consuming can be both reduced, memory can also be saved.
In this specification embodiment, the destination node for being zero above by in-degree in equity relational network figure is adjacent to its
Next level of child nodes send message mode determine from root node to the routing information of each leaf node, specifically include following step
Rapid one, step 2 and step 3;
Step 1: determine equity relational network figure in in-degree be zero and in the presence of a level of child nodes destination node;
Step 2: sending message to its adjacent next level of child nodes by destination node;Wherein, it is carried in the message
From root node to the node path message sink child node each child node experienced and message sink child node, undergone
Each child node and message sink child node corresponding to the share information held of shareholder and message sink child node is entered
The operation instruction of degree;
Step 3: indicating that update message receives the in-degree of child node according to aforesaid operations, and according to updated each height
The in-degree of node determines the leaf node in equity relational network figure, and based on the son experienced from root node to leaf node
Nodal information determines the routing information from root node to leaf node.
Wherein, above-mentioned node path can be understood as each child node experienced and be undergone between message sink child node
Nodal information.
Specifically, in the specific implementation, aforesaid operations instruction, which is used to indicate, subtracts the in-degree execution of message sink child node
Go 0 or 1 operation;Correspondingly, receiving the in-degree of child node, packet according to operation instruction update message in above-mentioned steps three
It includes:
0 or 1 operation is subtracted to the initial in-degree execution of message sink child node.
In the specific implementation, every child node receives a message, then is connect according to the instruction of the message to message sink
The in-degree of node executes the operation for subtracting 1 or subtracting 0.Under normal circumstances, if node path entrained in the message is from root section
Point arrives the node path of message sink child node, then the message can indicate to execute the operation that in-degree subtracts 1 to message recipient node.For
It is easy to understand, it is following to be illustrated citing.
Continue to continue to use Fig. 2, for child node D, the initial in-degree of child node D is 2, and child node B is sent to disappearing for child node D
Breath includes two message, and two transmitted message are respectively as follows: message 1, the node road experienced from root node A to child node D
Diameter A, B, D, shareholder corresponding to child node B hold the share information of enterprise A, and shareholder corresponding to child node D holds enterprise B
Share information executes the operation for subtracting 1 to the in-degree of child node D;Message 2, the node road experienced from child node B to child node D
Diameter B, D, shareholder corresponding to child node E hold the share information of enterprise B, execute the operation for subtracting 0 to the in-degree of child node E;When
After child node D receives the message of child node B transmission, the operation for subtracting 1 and subtracting 0 is executed to the in-degree of child node D respectively, after update
The in-degree of obtained child node D be 1, the message that child node C is sent to child node D is also two message, be respectively as follows: message 1, from
Shareholder corresponding to root node A to child node D node path A, C, D experienced, child node C holds the share information of enterprise A,
Shareholder corresponding to child node D holds the share information of enterprise C, executes the operation for subtracting 1 to the in-degree of child node D;Message 2, from
Shareholder corresponding to child node C to child node D node path C, D experienced, child node D holds the share information of enterprise C, holds
The operation that row subtracts 0 to the in-degree of child node D, after child node D receives the message of child node C transmission, respectively to child node D's
In-degree executes the operation for subtracting 1 and subtracting 0, and the in-degree of the child node D obtained after update is 0.
Specifically, according to the in-degree of updated each child node, determining equity relational network figure in above-mentioned steps three
Leaf node, comprising:
Whether the in-degree for judging updated child node is zero;If the in-degree of updated child node is zero, and the sub- section
Next level of child nodes is not present in point, it is determined that the child node is leaf node.
In the data processing method that this specification embodiment provides for ease of understanding, determine from root node to each leaf node
Routing information detailed process, it is following to be illustrated by taking Fig. 2 as an example.
For equity relational network figure shown in Fig. 2, the initial in-degree of node A is zero, hence, it can be determined that egress A
For root node, remaining node is child node, and next level of child nodes of root node A has child node B and child node C, passes through root section
Point A sends message to child node B and child node C respectively, and root node A, which is sent to, to be carried root node A in the message of child node B and arrive
The node path of child node B, the share information for the A enterprise that shareholder corresponding to child node B holds, and child node B is entered
Degree executes the operation instruction for subtracting 1, and the node path of root node A to child node C, son are carried in the message for being sent to child node C
The share information for the enterprise A that shareholder corresponding to node C holds and the operation instruction for subtracting 1 to the in-degree execution of child node C, son
The initial in-degree of node B and child node C is 1, after the message that child node B receives root node A transmission, is executed child node
The operation that the in-degree of B subtracts 1, the in-degree of updated child node are 0, due to a level of child nodes in the presence of child node B, In
After child node B receives the message of root node A transmission, continue next level of child nodes (child node E and the child node to child node B
D message) is sent, child node B needs to send two message to child node E, and two transmitted message are respectively as follows: message 1, from root
Shareholder corresponding to node A to child node E node path A, B, E experienced, child node B holds the share information of enterprise A, son
Shareholder corresponding to node E holds the share information of enterprise B, executes the operation for subtracting 1 to the in-degree of child node E;Message 2, from son
Shareholder corresponding to node B to child node E node path B, E experienced, child node E holds the share information of enterprise B, executes
The operation for subtracting 0 to the in-degree of child node E.The initial in-degree of child node E is 1, after the message for receiving child node B transmission, is held
It is about to the operation that the in-degree of child node E subtracts 1, the in-degree of updated child node E is zero, since next layer is not present in child node E
Therefore child node E is determined as the leaf node of the equity relational network figure by child node.
Child node B be sent to child node D message include two message, two transmitted message be respectively as follows: message 1,
Node path A, B, D experienced from root node A to child node D, shareholder corresponding to child node B hold the share letter of enterprise A
It ceases, shareholder corresponding to child node D holds the share information of enterprise B, executes the operation for subtracting 1 to the in-degree of child node D;Message 2,
Node path B, D experienced from child node B to child node D, shareholder corresponding to child node E hold the share information of enterprise B,
The operation for subtracting 0 to the in-degree of child node E is executed, the initial in-degree of child node D is 2, in the message for receiving child node B transmission
Afterwards, execute by the initial in-degree of child node D subtract 1 and 0 operation, the in-degree of updated child node D is 1, more due to child node D
In-degree after new is not zero, and therefore, temporarily saves the message that child node B received by child node D is sent.
In addition, the operation that the in-degree of child node C is subtracted 1 is executed after the message that child node C receives root node A transmission,
The in-degree of updated child node C is zero, due to level of child nodes D, F and G in the presence of child node C, pass through child node C
Message is sent to child node D, child node F and child node G respectively, is receiving sub- section in child node D, byte point F and child node G
After the message that point C is sent, the operation for updating the in-degree of child node D, child node E and child node G is executed, updated in-degree is
Zero, and since next level of child nodes is not present in child node D, child node F and child node G, child node D, child node F and
Child node G is the leaf node of the equity relational network figure.
Due in above-mentioned message process, carrying each node in the message of transmitting to next level of child nodes
The share-holding information of shareholder corresponding to node path and each node, hence, it can be determined that going out from root node A to leaf node E
Routing information be node path be A, B, E, shareholder corresponding to node B holds 40% share of enterprise A, corresponding to node E
Shareholder holds the share of enterprise B 80%;Routing information from root node A to leaf node B be node path be A, B, D and A, C,
Shareholder corresponding to D, node B holds 40% share of enterprise A, and shareholder corresponding to node D holds the share of enterprise B 20%, section
Shareholder corresponding to point C holds the share of enterprise A60%, and shareholder corresponding to node D holds 15% share of enterprise C;From root section
The routing information of point A to leaf node F are that node path is A, C, F, and shareholder corresponding to node C holds the share of enterprise A60%,
Shareholder corresponding to node F holds 50% share of enterprise C;It is node path from root node A to the routing information of leaf node G
For A, C, G, shareholder corresponding to node C holds the share of enterprise A60%, and shareholder corresponding to node G holds 35% stock of enterprise C
Part.
Fig. 4 is to determine in data processing method provided by this specification embodiment from root node to each leaf node
The method flow diagram of routing information, method shown in Fig. 4, specifically comprises the following steps:
Step 402, the initial in-degree for determining each node in equity relational network figure makees the node that initial in-degree is zero
For the root node of equity relational network figure.
Step 404, message is sent to next level of child nodes of the root node by root node.
Step 406, it after the message that child node receives root node transmission, is received according to the instruction update message of the message
The in-degree of child node.
Step 408, whether the in-degree of message sink child node is zero after detection updates;If so, 410 are thened follow the steps, it is no
Then follow the steps 416.
Step 410, detection message sink child node whether there is next level of child nodes;If it exists, 412 are thened follow the steps;
Otherwise, step 414 is executed.
Step 412, message is sent to next level of child nodes of the message sink child node by message sink child node.
Step 414, the leaf node which being determined as in equity relational network figure.
Step 416, message received by the message sink child node is saved.
Step 418, it based on from root node to each leaf node child node information experienced, determines from root node to each leaf
The routing information of child node.
In this specification embodiment, by in-degree be zero and in the presence of a level of child nodes destination node under adjacent
The mode that one level of child nodes sends message determines from root node to the routing information of each leaf node, avoid each node to
Its adjacent next level of child nodes sends message, reduces the quantity for sending message, reduces occupied memory headroom, and
Time-consuming can also be reduced, is improved efficiency.
Fig. 5 is the three of the method flow diagram for the data processing method that this specification embodiment provides, and method shown in fig. 5 is extremely
Include the following steps: less
Step 502, the equity relevant information of at least one enterprise is obtained;Wherein, which includes enterprise
The share information that shareholder's information and each shareholder are held.
Step 504, the share information that shareholder's information based on enterprise and each shareholder are held generates stock corresponding to enterprise
Weigh relational network figure.
Wherein, the root node in above-mentioned equity relational network figure indicates enterprise, and child node indicates shareholder, and root node and son save
Line between point indicates the share-holding routing information of shareholder.
Step 506, determine in-degree in above-mentioned equity relational network figure be zero and in the presence of a level of child nodes destination node.
Step 508, message is sent to next level of child nodes of destination node by destination node, and according to the finger of the message
Show that update message receives the in-degree of child node.
Step 510, whether the in-degree for detecting updated message sink child node is zero;If so, 512 are thened follow the steps,
Otherwise, step 518 is executed.
Step 512, detection message sink child node whether there is next level of child nodes;If it exists, 514 are thened follow the steps,
Otherwise, step 516 is executed.
Step 514, message is sent to next level of child nodes of the message sink child node by message sink child node.
Step 516, the leaf node which being determined as in equity relational network figure.
Step 518, message received by the message sink child node is saved.
Step 520, it based on from root node to each leaf node child node information experienced, determines from root node to each leaf
The routing information of child node.
Step 522, it is analyzed based on share-holding information of the above-mentioned routing information to each shareholder.
In the specific implementation, it in above-mentioned steps 106, is analyzed, is had based on share-holding information of the routing information to each shareholder
Body comprises the following processes:
The share for the enterprise that shareholder corresponding to each leaf node is held is calculated based on above-mentioned routing information, and is based on
The share for the enterprise that shareholder corresponding to each leaf node is held determines the greatest benefit shareholder of enterprise;
And/or
For the road strength information from root node to each leaf node, which is split, is obtained from root section
Point arrives the sub-path information between each child node;Based on sub-path information, the share for the enterprise that each shareholder is held is calculated.
In this specification embodiment, the share-holding information of each shareholder is analyzed, each enterprise of analysis is can be and arrives most
Big beneficiary is also possible to analyze the benefited situation of each shareholder of enterprise, or simultaneously to the greatest benefit people of enterprise and each stock
The benefited situation in east is analyzed.
In the specific implementation, identified right comprising each child node into the routing information of each leaf node from root node
The share-holding information of the shareholder answered, a kind of possible form are as shown in table 1.
Table 1
By above-mentioned table 1, it can be concluded that, the share for the enterprise A that shareholder corresponding to leaf node E holds is 0.32, leaf
The share 0.08+0.09=0.17 for the enterprise A that shareholder corresponding to node D holds, successively calculates stock corresponding to child node F
The share for the enterprise A that east is held is 0.3, and the share for the enterprise A that shareholder corresponding to child node G holds is 0.21.By comparing
It can be concluded that the share for the enterprise A that shareholder corresponding to leaf node E holds is most, shareholder corresponding to leaf node E is
The greatest benefit people of enterprise A.
Continuation is illustrated how to calculate shareholder corresponding to each node and hold by taking the path A, B, E in above-mentioned table 1 as an example
Some shares.The path A, B, E is split, subpath A, B and A, B, E are obtained, son can be calculated by subpath A, B
The share for the enterprise A that shareholder corresponding to node B holds is 0.4, the share for the enterprise A that shareholder corresponding to child node E holds
It is 0.32.
Certainly, it in the case where equity relational network figure is fairly simple, can also directly export from root node to each height
The routing information of node, this way it is not necessary to routing information is split can calculate each node (including intermediate node and
Leaf node) corresponding to shareholder benefited situation.
In addition, in the specific implementation, it is possible that the case where circulation share-holding, as A share-holding B, B share-holding C, C share-holding D, D are held
Stock A, it is this, belong to circulation share-holding, for circulation share-holding the case where, if followed by way of above-mentioned transmission message when meeting
When the node of ring share-holding, it can stop continuing to next node layer sending message and therefore in this specification embodiment, pass through meter
The mode of strong continune component is calculated, the benefited situation of each shareholder in circulation share-holding is calculated.
Therefore, this specification is the method that embodiment provides, further includes:
It determines the strong connection component in equity relational network figure, and calculates the enterprise that each shareholder is held in strong connection component
The quantity of the accumulated stock of industry.
In addition, in the specific implementation, when constructing equity relational network figure, if directly using enterprise or the volume of shareholder
Number each node of mark, it is longer due to numbering, then it will lead to and occupy biggish memory space.Therefore, in this specification embodiment
In, in order to reduce space occupied by equity relational network figure, number corresponding to enterprise and shareholder can be carried out at coding
Reason obtains its corresponding ident value such as Hash processing, therefore, in this specification embodiment, in above-mentioned steps 104, based on enterprise
The share information for the enterprise that shareholder's information of industry and each shareholder are held generates equity relational network figure corresponding to enterprise, specifically
Include:
Determine the identification information of enterprise, and, determine the identification information of shareholder's information;Using the identification information of enterprise as stock
The root node for weighing relational network figure is based on each stock using the identification information of shareholder's information as the child node of equity relational network figure
Each node and child node, child node and child node are attached by the share information that east is held, and obtain equity relational network figure.
The method that this specification embodiment provides for ease of understanding, following artificial examples of greatest benefit by analyze enterprise A
The method for introducing the offer of this specification embodiment, Fig. 6 are the method flow for the data processing method that this specification embodiment provides
The four of figure, method shown in fig. 6 include at least following steps:
Step 602, the equity relevant information of enterprise A is obtained;Wherein, which includes shareholder's letter of enterprise A
The share information that breath and each shareholder are held.
Wherein, above-mentioned shareholder's information includes the direct shareholder's information and indirect shareholder's information of enterprise A.
Step 604, the shareholder to enterprise A and enterprise A are encoded, and obtain mark corresponding to each shareholder and enterprise
Information.
Step 606, using the mark of enterprise A as root node, the mark of each shareholder is held as child node according to each shareholder
Root node and each child node, each child node and child node are attached by some share information, obtain the equity network of personal connections of enterprise A
Network figure.
Step 608, determine in-degree in above-mentioned equity relational network figure be zero and in the presence of a level of child nodes destination node.
Step 610, message is sent to next level of child nodes of destination node by destination node, and according to the finger of the message
Show that update message receives the in-degree of child node.
Step 612, whether the in-degree for detecting updated message sink child node is zero;If so, 614 are thened follow the steps,
Otherwise, step 620 is executed.
Step 614, detection message sink child node whether there is next level of child nodes;If it exists, 616 are thened follow the steps,
Otherwise, step 618 is executed.
Step 616, message is sent to next level of child nodes of the message sink child node by message sink child node.
Step 618, the leaf node which being determined as in equity relational network figure.
Step 620, message received by the message sink child node is saved.
Step 622, it based on from root node to each leaf node child node information experienced, determines from root node to each leaf
The routing information of child node.
Wherein, shareholder corresponding to each child node experienced from root node to leaf node is included in above-mentioned routing information
Share-holding information.
Step 624, according to above-mentioned routing information calculate each leaf node corresponding to the share of enterprise A held of shareholder,
And the greatest benefit shareholder of enterprise A is determined based on the share for the enterprise A that shareholder corresponding to each leaf node holds.
The data processing method that this specification embodiment provides, after getting the equity relevant information of enterprise, building enterprise
The equity relational network figure of industry, the root node in constructed equity relational network figure indicate enterprise, and child node indicates shareholder, and
Line between root node and child node then indicates the share-holding routing information of shareholder, is by in-degree in the equity relational network figure
Zero destination node determines in the equity relational network figure to the mode that adjacent next level of child nodes sends message from root node
To the routing information of each child node, which is then the share-holding routing information of each shareholder, i.e., to be based on the path
Information analyzes the share-holding information of each shareholder;In this specification embodiment, by determining root node to child node path
The mode of information realizes the analysis to shareholder's share-holding information, also, when determining the routing information from root node to child node,
Message is sent to adjacent next level of child nodes by the destination node that in-degree is zero, avoids each node to its next layer
Child node sends message, reduces the quantity of transmitted message, while decreasing the time-consuming of determining routing information, improves place
Manage efficiency.
Corresponding to the method that this specification embodiment provides, it is based on identical thinking, this specification embodiment additionally provides
A kind of data processing equipment, for executing data processing method provided by this specification embodiment, Fig. 7 is this specification implementation
The module composition schematic diagram for the data processing equipment that example provides, device shown in Fig. 7, comprising:
Module 702 is obtained, for obtaining the equity relevant information of at least one enterprise;Wherein, equity relevant information includes
The share information that shareholder's information of enterprise and each shareholder are held;
Generation module 704, for based on enterprise shareholder's information and the share information held of each shareholder generate institute, enterprise
Corresponding equity relational network figure;Wherein, the root node in equity relational network figure indicates enterprise, and child node indicates shareholder, root
Line between node and child node indicates the share-holding routing information of shareholder;
First determining module 706, for be zero by in-degree in equity relational network figure destination node it is adjacent to its
The mode that next level of child nodes sends message is determined from root node to the routing information of each child node;Wherein, destination node includes
In-degree after root node and reception message that initial in-degree is zero is updated to zero child node;
Analysis module 708, for being analyzed based on share-holding information of the routing information to each shareholder.
Optionally, child node includes intermediate child node and leaf node;Leaf node be equity relational network figure in most
Latter level of child nodes;
First determining module 706, comprising:
First determination unit, for be zero by in-degree in equity relational network figure destination node to adjacent next layer
The mode that child node sends message is determined from root node to the routing information of each leaf node.
Optionally, above-mentioned first determination unit, comprising:
First determines subelement, for determine in-degree in equity relational network figure be zero and in the presence of a level of child nodes mesh
Mark node;
Transmission sub-unit, for sending message to its adjacent next level of child nodes by destination node;Wherein, in message
It carries from root node to the node path message sink child node each child node experienced and message sink child node,
Share information that shareholder corresponding to each child node and message sink child node experienced is held and to message sink section
The operation instruction of the in-degree of point;
Subelement is updated, for receiving the in-degree of child node according to operation instruction update message;
Second determines that subelement determines equity relational network figure for the in-degree according to updated each child node
Leaf node;
Third determines subelement, for determining from root based on the child node information experienced from root node to leaf node
Routing information of the node to leaf node.
Optionally, aforesaid operations instruction, which is used to indicate, executes the behaviour for subtracting 0 or 1 to the in-degree of message sink child node
Make;
Above-mentioned update subelement, is specifically used for:
0 or 1 operation is subtracted to the initial in-degree execution of message sink child node.
Optionally, it above-mentioned second determines subelement, is specifically used for:
Whether the in-degree for judging updated child node is zero;If the in-degree of updated child node is zero, and child node
There is no next level of child nodes, it is determined that child node is leaf node.
Optionally, above-mentioned analysis module 708, comprising:
First analytical unit, for calculating the enterprise that shareholder corresponding to each leaf node is held based on routing information
Share, and the share of the enterprise held based on shareholder corresponding to each leaf node determines the greatest benefit stock of enterprise
East;
And/or
Second analytical unit, for, to the routing information of each leaf node, being carried out to routing information for from root node
It splits, obtains from root node to the sub-path information each child node;Based on sub-path information, calculates each shareholder and held
The share of some enterprises.
Optionally, the device that this specification embodiment provides, comprising:
Second determining module, for determining the strong connection component in equity relational network figure;
Computing module, the quantity of the accumulated stock for calculating the enterprise that each shareholder is held in strong connection component.
Optionally, above-mentioned generation module 704, comprising:
Second determination unit, for determining the identification information of enterprise, and, determine the identification information of shareholder's information;
Generation unit, for using the identification information of enterprise as the root node of equity relational network figure, by shareholder's information
Child node of the identification information as equity relational network figure is saved root node and son based on the share information that each shareholder is held
Point, child node and child node are attached, and obtain equity relational network figure.
The data processing equipment of this specification embodiment can also carry out the method that data processing equipment executes in Fig. 1-Fig. 6,
And data processing equipment is realized in Fig. 1-embodiment illustrated in fig. 6 function, details are not described herein.
The data processing equipment that this specification embodiment provides, after getting the equity relevant information of enterprise, building enterprise
The equity relational network figure of industry, the root node in constructed equity relational network figure indicate enterprise, and child node indicates shareholder, and
Line between root node and child node then indicates the share-holding routing information of shareholder, is by in-degree in the equity relational network figure
Zero destination node determines in the equity relational network figure to the mode that adjacent next level of child nodes sends message from root node
To the routing information of each child node, which is then the share-holding routing information of each shareholder, i.e., to be based on the path
Information analyzes the share-holding information of each shareholder;In this specification embodiment, by determining root node to child node path
The mode of information realizes the analysis to shareholder's share-holding information, also, when determining the routing information from root node to child node,
Message is sent to adjacent next level of child nodes by the destination node that in-degree is zero, avoids each node to its next layer
Child node sends message, reduces the quantity of transmitted message, while decreasing the time-consuming of determining routing information, improves place
Manage efficiency.
Further, based on above-mentioned Fig. 1 to method shown in fig. 6, this specification embodiment is additionally provided at a kind of data
Equipment is managed, as shown in Figure 8.
Data processing equipment can generate bigger difference because configuration or performance are different, may include one or one with
On processor 801 and memory 802, can store one or more storage application programs or number in memory 802
According to.Wherein, memory 802 can be of short duration storage or persistent storage.The application program for being stored in memory 802 may include one
A or more than one module (diagram is not shown), each module may include can to the series of computation machine in data processing equipment
Execute instruction information.Further, processor 801 can be set to communicate with memory 802, hold on data processing equipment
Series of computation machine executable instruction information in line storage 802.Data processing equipment can also include one or one with
Upper power supply 803, one or more wired or wireless network interfaces 804, one or more input/output interfaces 805,
One or more keyboards 806 etc..
In a specific embodiment, data processing equipment includes memory and one or more journey
Sequence, perhaps more than one program is stored in memory and one or more than one program may include one for one of them
Or more than one module, and each module may include to the series of computation machine executable instruction letter in data processing equipment
Breath, and be configured to be executed this by one or more than one processor or more than one program include for carry out with
Lower computer executable instructions information:
Obtain the equity relevant information of at least one enterprise;Wherein, equity relevant information include enterprise shareholder's information and
The share information that each shareholder is held;
The share information that shareholder's information and each shareholder based on enterprise are held generates equity network of personal connections corresponding to enterprise
Network figure;Wherein, the root node in equity relational network figure indicates enterprise, and child node indicates shareholder, between root node and child node
Line indicate shareholder share-holding routing information;
The destination node for being zero by in-degree in equity relational network figure sends message to its adjacent next level of child nodes
Mode determine from root node to the routing information of each child node, and divided based on share-holding information of the routing information to each shareholder
Analysis;Wherein, destination node include initial in-degree be zero root node and receive message after in-degree be updated to zero child node.
Optionally, when executed, child node includes intermediate child node and leaf node to computer executable instructions information;
Leaf node is the last layer child node in equity relational network figure;
The destination node for being zero by in-degree in equity relational network figure sends message to its adjacent next level of child nodes
Mode determine from root node to the routing information of each child node, comprising:
The destination node for being zero by in-degree in equity relational network figure sends message to its adjacent next level of child nodes
Mode determine from root node to the routing information of each leaf node.
Optionally, computer executable instructions information is zero by in-degree in equity relational network figure when executed
Destination node determines to the mode that adjacent next level of child nodes sends message from root node to the routing information of each leaf node,
Include:
Determine in-degree in equity relational network figure be zero and in the presence of a level of child nodes destination node;
Message is sent to its adjacent next level of child nodes by destination node;Wherein, it is carried in message from root node
Node path between message sink child node each child node experienced and message sink child node, each sub- section experienced
The operation of share information and the in-degree to message sink child node that shareholder corresponding to point and message sink child node is held
Instruction;
The in-degree of child node is received according to operation instruction update message, and according to the in-degree of updated each child node,
Determine the leaf node in equity relational network figure, and based on the child node information experienced from root node to leaf node, really
The fixed routing information from root node to leaf node.
Optionally, when executed, operation instruction is used to indicate to message sink section computer executable instructions information
The in-degree execution of point subtracts 0 or 1 operation;
The in-degree of child node is received according to operation instruction update message, comprising:
0 or 1 operation is subtracted to the initial in-degree execution of message sink child node.
Optionally, computer executable instructions information when executed, according to the in-degree of updated each child node, really
Determine the leaf node of equity relational network figure, comprising:
Whether the in-degree for judging updated child node is zero;
If the in-degree of updated child node is zero, and next level of child nodes is not present in child node, it is determined that child node is
Leaf node.
Optionally, computer executable instructions information when executed, based on routing information to the share-holding information of each shareholder
It is analyzed, comprising:
The share for the enterprise that shareholder corresponding to each leaf node is held is calculated based on routing information, and based on each
The share for the enterprise that shareholder corresponding to leaf node is held determines the greatest benefit shareholder of enterprise;
And/or
For from root node, to the routing information of each leaf node, routing information is split, is obtained from root node
Sub-path information between each child node;Based on sub-path information, the share for the enterprise that each shareholder is held is calculated.
Optionally, computer executable instructions information when executed, can also carry out following steps:
It determines the strong connection component in equity relational network figure, and calculates the enterprise that each shareholder is held in strong connection component
The quantity of the accumulated stock of industry.
Optionally, computer executable instructions information when executed, held by shareholder's information and each shareholder based on enterprise
Some share information generates equity relational network figure corresponding to enterprise, comprising:
Determine the identification information of enterprise, and, determine the identification information of shareholder's information;
Using the identification information of enterprise as the root node of equity relational network figure, using the identification information of shareholder's information as stock
The child node for weighing relational network figure is saved root node and child node, child node and son based on the share information that each shareholder is held
Point is attached, and obtains equity relational network figure.
The data processing equipment that this specification embodiment provides, after getting the equity relevant information of enterprise, building enterprise
The equity relational network figure of industry, the root node in constructed equity relational network figure indicate enterprise, and child node indicates shareholder, and
Line between root node and child node then indicates the share-holding routing information of shareholder, is by in-degree in the equity relational network figure
Zero destination node determines in the equity relational network figure to the mode that adjacent next level of child nodes sends message from root node
To the routing information of each child node, which is then the share-holding routing information of each shareholder, i.e., to be based on the path
Information analyzes the share-holding information of each shareholder;In this specification embodiment, by determining root node to child node path
The mode of information realizes the analysis to shareholder's share-holding information, also, when determining the routing information from root node to child node,
Message is sent to adjacent next level of child nodes by the destination node that in-degree is zero, avoids each node to its next layer
Child node sends message, reduces the quantity of transmitted message, while decreasing the time-consuming of determining routing information, improves place
Manage efficiency.
Further, based on above-mentioned Fig. 1 to method shown in fig. 6, this specification embodiment additionally provides a kind of storage Jie
Matter, for storing computer executable instructions information, in a kind of specific embodiment, the storage medium can for USB flash disk, CD,
Hard disk etc., the computer executable instructions information of storage medium storage are able to achieve following below scheme when being executed by processor:
Obtain the equity relevant information of at least one enterprise;Wherein, equity relevant information include enterprise shareholder's information and
The share information that each shareholder is held;
The share information that shareholder's information and each shareholder based on enterprise are held generates equity network of personal connections corresponding to enterprise
Network figure;Wherein, the root node in equity relational network figure indicates enterprise, and child node indicates shareholder, between root node and child node
Line indicate shareholder share-holding routing information;
The destination node for being zero by in-degree in equity relational network figure sends message to its adjacent next level of child nodes
Mode determine from root node to the routing information of each child node, and divided based on share-holding information of the routing information to each shareholder
Analysis;Wherein, destination node include initial in-degree be zero root node and receive message after in-degree be updated to zero child node.
Optionally, the computer executable instructions information of storage medium storage is when being executed by processor, child node packet
Include intermediate child node and leaf node;Leaf node is the last layer child node in equity relational network figure;
The destination node for being zero by in-degree in equity relational network figure sends message to its adjacent next level of child nodes
Mode determine from root node to the routing information of each child node, comprising:
The destination node for being zero by in-degree in equity relational network figure sends message to its adjacent next level of child nodes
Mode determine from root node to the routing information of each leaf node.
Optionally, the computer executable instructions information of storage medium storage passes through equity when being executed by processor
The destination node that in-degree is zero in relational network figure is determined to the mode that adjacent next level of child nodes sends message from root node
To the routing information of each leaf node, comprising:
Determine in-degree in equity relational network figure be zero and in the presence of a level of child nodes destination node;
Message is sent to its adjacent next level of child nodes by destination node;Wherein, it is carried in message from root node
Node path between message sink child node each child node experienced and message sink child node, each sub- section experienced
The operation of share information and the in-degree to message sink child node that shareholder corresponding to point and message sink child node is held
Instruction;
The in-degree of child node is received according to operation instruction update message, and according to the in-degree of updated each child node,
Determine the leaf node in equity relational network figure, and based on the child node information experienced from root node to leaf node, really
The fixed routing information from root node to leaf node.
Optionally, the computer executable instructions information of storage medium storage is when being executed by processor, operation instruction
It is used to indicate and executes the operation for subtracting 0 or 1 to the in-degree of message sink child node;
The in-degree of child node is received according to operation instruction update message, comprising:
0 or 1 operation is subtracted to the initial in-degree execution of message sink child node.
Optionally, the computer executable instructions information of storage medium storage is when being executed by processor, according to update
The in-degree of each child node afterwards, determines the leaf node of equity relational network figure, comprising:
Whether the in-degree for judging updated child node is zero;
If the in-degree of updated child node is zero, and next level of child nodes is not present in child node, it is determined that child node is
Leaf node.
Optionally, the computer executable instructions information of storage medium storage is based on path when being executed by processor
Information analyzes the share-holding information of each shareholder, comprising:
The share for the enterprise that shareholder corresponding to each leaf node is held is calculated based on routing information, and based on each
The share for the enterprise that shareholder corresponding to leaf node is held determines the greatest benefit shareholder of enterprise;
And/or
For from root node, to the routing information of each leaf node, routing information is split, is obtained from root node
Sub-path information between each child node;Based on sub-path information, the share for the enterprise that each shareholder is held is calculated.
Optionally, the computer executable instructions information of storage medium storage can also be held when being executed by processor
Row following steps:
It determines the strong connection component in equity relational network figure, and calculates the enterprise that each shareholder is held in strong connection component
The quantity of the accumulated stock of industry.
Optionally, the computer executable instructions information of storage medium storage is based on enterprise when being executed by processor
Shareholder's information and the share information held of each shareholder generate equity relational network figure corresponding to enterprise, comprising:
Determine the identification information of enterprise, and, determine the identification information of shareholder's information;
Using the identification information of enterprise as the root node of equity relational network figure, using the identification information of shareholder's information as stock
The child node for weighing relational network figure is saved root node and child node, child node and son based on the share information that each shareholder is held
Point is attached, and obtains equity relational network figure.
The computer executable instructions information for the storage medium storage that this specification embodiment provides is being executed by processor
When, after getting the equity relevant information of enterprise, construct the equity relational network figure of enterprise, constructed equity relational network
Root node in figure indicates enterprise, and child node indicates shareholder, and the line between root node and child node then indicates holding for shareholder
Stock routing information, the destination node for being zero by in-degree in the equity relational network figure disappear to adjacent next level of child nodes transmission
The mode of breath determines in the equity relational network figure that the routing information is then each from root node to the routing information of each child node
The share-holding routing information of a shareholder, i.e., to be analyzed based on share-holding information of the routing information to each shareholder;In this explanation
In book embodiment, the analysis to shareholder's share-holding information is realized by way of determining root node to child node routing information, and
And when determining routing information from root node to child node, the destination node for being zero by in-degree is to adjacent next straton
Node sends message, avoids each node to its next level of child nodes and sends message, reduces the quantity of transmitted message,
The time-consuming of determining routing information is decreased simultaneously, improves treatment effeciency.
In the 1990s, the improvement of a technology can be distinguished clearly be on hardware improvement (for example,
Improvement to circuit structures such as diode, transistor, switches) or software on improvement (improvement for method flow).So
And with the development of technology, the improvement of current many method flows can be considered as directly improving for hardware circuit.
Designer nearly all obtains corresponding hardware circuit by the way that improved method flow to be programmed into hardware circuit.Cause
This, it cannot be said that the improvement of a method flow cannot be realized with hardware entities module.For example, programmable logic device
(Programmable Logic Device, PLD) (such as field programmable gate array (Field Programmable Gate
Array, FPGA)) it is exactly such a integrated circuit, logic function determines device programming by user.By designer
Voluntarily programming comes a digital display circuit " integrated " on a piece of PLD, designs and makes without asking chip maker
Dedicated IC chip.Moreover, nowadays, substitution manually makes IC chip, this programming is also used instead mostly " is patrolled
Volume compiler (logic compiler) " software realizes that software compiler used is similar when it writes with program development,
And the source code before compiling also write by handy specific programming language, this is referred to as hardware description language
(Hardware Description Language, HDL), and HDL is also not only a kind of, but there are many kind, 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 is most generally used at present
Integrated Circuit Hardware Description Language) and Verilog.Those skilled in the art also answer
This understands, it is only necessary to method flow slightly programming in logic and is programmed into integrated circuit with above-mentioned several hardware description languages,
The hardware circuit for realizing the logical method process can be readily available.
Controller can be implemented in any suitable manner, for example, controller can take such as microprocessor or processing
The computer for the computer readable program code (such as software or firmware) that device and storage can be executed by (micro-) processor can
Read medium, logic gate, switch, specific integrated circuit (Application Specific Integrated Circuit,
ASIC), the form of programmable logic controller (PLC) and insertion microcontroller, the example of controller includes but is not limited to following microcontroller
Device: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicone Labs C8051F320 are deposited
Memory controller is also implemented as a part of the control logic of memory.It is also known in the art that in addition to
Pure computer readable program code mode is realized other than controller, can be made completely by the way that method and step is carried out programming in logic
Controller is obtained to come in fact in the form of logic gate, switch, specific integrated circuit, programmable logic controller (PLC) and insertion microcontroller etc.
Existing identical function.Therefore this controller is considered a kind of hardware component, and to including for realizing various in it
The device of function can also be considered as the structure in hardware component.Or even, it can will be regarded for realizing the device of various functions
For either the software module of implementation method can be the structure in hardware component again.
System, device, module or the unit that above-described embodiment illustrates can specifically realize by computer chip or entity,
Or it is realized by the product with certain function.It is a kind of typically to realize that equipment is computer.Specifically, computer for example may be used
Think personal computer, laptop computer, cellular phone, camera phone, smart phone, personal digital assistant, media play
It is any in device, navigation equipment, electronic mail equipment, game console, tablet computer, wearable device or these equipment
The combination of equipment.
For convenience of description, it is divided into various units when description apparatus above with function to describe respectively.Certainly, implementing this
The function of each unit can be realized in the same or multiple software and or hardware when application.
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application is reference according to the method for this specification embodiment, the stream of equipment (system) and computer program product
Journey figure and/or block diagram describe.It should be understood that can be by computer program instructions information realization flowchart and/or the block diagram
The combination of process and/or box in each flow and/or block and flowchart and/or the block diagram.It can provide these calculating
Machine program instruction information is to general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices
Processor is to generate a machine, so that the instruction executed by computer or the processor of other programmable data processing devices
Information generates specifies for realizing in one or more flows of the flowchart and/or one or more blocks of the block diagram
Function device.
These computer program instructions information, which may also be stored in, is able to guide computer or other programmable data processing devices
In computer-readable memory operate in a specific manner, so that command information stored in the computer readable memory produces
Raw includes the manufacture of command information device, the command information device realize in one or more flows of the flowchart and/or
The function of being specified in one or more blocks of the block diagram.
These computer program instructions information also can be loaded onto a computer or other programmable data processing device, so that
Series of operation steps are executed on a computer or other programmable device to generate computer implemented processing, thus calculating
The command information that is executed on machine or other programmable devices provide for realizing in one or more flows of the flowchart and/or
The step of function of being specified in one or more blocks of the block diagram.
In a typical configuration, calculating equipment includes one or more processors (CPU), input/output interface, net
Network interface and memory.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/or
The forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM).Memory is computer-readable medium
Example.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer-readable instruction information, data structure, the module of program or other numbers
According to.The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory
(SRAM), dynamic random access memory (DRAM), other kinds of random access memory (RAM), read-only memory
(ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory techniques, CD-ROM are read-only
Memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, tape magnetic disk storage or
Other magnetic storage devices or any other non-transmission medium, can be used for storage can be accessed by a computing device information.According to
Herein defines, and computer-readable medium does not include temporary computer readable media (transitory media), such as modulation
Data-signal and carrier wave.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including described want
There is also other identical elements in the process, method of element, commodity or equipment.
It will be understood by those skilled in the art that embodiments herein can provide as method, system or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.It is deposited moreover, the application can be used to can be used in the computer that one or more wherein includes computer usable program code
The shape for the computer program product implemented on storage media (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
The application can computer executable instructions information it is general up and down described in the text, such as
Program module.Generally, program module include routines performing specific tasks or implementing specific abstract data types, it is program, right
As, component, data structure etc..The application can also be practiced in a distributed computing environment, in these distributed computing environment
In, by executing task by the connected remote processing devices of communication network.In a distributed computing environment, program module
It can be located in the local and remote computer storage media including storage equipment.
All the embodiments in this specification are described in a progressive manner, same and similar portion between each embodiment
Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for system reality
For applying example, since it is substantially similar to the method embodiment, so being described relatively simple, related place is referring to embodiment of the method
Part explanation.
The above description is only an example of the present application, is not intended to limit this application.For those skilled in the art
For, various changes and changes are possible in this application.All any modifications made within the spirit and principles of the present application are equal
Replacement, improvement etc., should be included within the scope of the claims of this application.