CN110888941B - Processing method and processing system for link relation event in business scene - Google Patents

Processing method and processing system for link relation event in business scene Download PDF

Info

Publication number
CN110888941B
CN110888941B CN201911009931.7A CN201911009931A CN110888941B CN 110888941 B CN110888941 B CN 110888941B CN 201911009931 A CN201911009931 A CN 201911009931A CN 110888941 B CN110888941 B CN 110888941B
Authority
CN
China
Prior art keywords
node
operator
association
information
processing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201911009931.7A
Other languages
Chinese (zh)
Other versions
CN110888941A (en
Inventor
何海军
王红森
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beike Technology Co Ltd
Original Assignee
Beike Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beike Technology Co Ltd filed Critical Beike Technology Co Ltd
Priority to CN201911009931.7A priority Critical patent/CN110888941B/en
Publication of CN110888941A publication Critical patent/CN110888941A/en
Application granted granted Critical
Publication of CN110888941B publication Critical patent/CN110888941B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases
    • G06F16/288Entity relationship models
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • G06F16/367Ontology
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0639Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06398Performance of employee with respect to a job function
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention relates to the field of computer software and discloses a processing method and a processing system for a connection relation event in a service scene. The processing method comprises the following steps: determining a current node, in which the characteristic information of the concerned node in the association is consistent with the characteristic information of the processed node, based on the association information between the preconfigured nodes; based on the preconfigured association information between the nodes and the processing information of the processed nodes about association events, processing the object corresponding to the current node when the association events occur; and constructing and broadcasting a broadcasting message body about the current node according to the processing information about the relationship event of the current node, wherein the broadcasting message body comprises: characteristic information of the current node and processing information of the current node about the association relation event. The invention can realize decoupling between different nodes in the association relationship, thereby greatly improving the processing efficiency of the event with the association relationship.

Description

Processing method and processing system for link relation event in business scene
Technical Field
The invention relates to the field of computer software, in particular to a processing method and a processing system for a connection relation event in a business scene.
Background
Events with associative relationships specifically mean that once event a is triggered, event B is triggered, while B is triggered, event C is triggered, event E is triggered, event D is triggered, and so on. For the processing of such complex business events, there is no mature and efficient solution in the industry, and conventional software programming development methods often have the following problems:
(1) The code has higher complexity and repeatability, if the associated route is too long, the development business code is extremely complex, and if/else is too much;
(2) Too high code coupling, if the associated route is changed, the code development cost is too high;
(3) Poor maintainability, excessive code maintenance cost, and the need to redeploy release code for each change makes it difficult to quickly support modification.
Disclosure of Invention
The invention aims to provide a processing method and a processing system for a relationship event in a business scene, which can realize decoupling between different nodes in the relationship, thereby greatly improving the processing efficiency of the event with the relationship.
In order to achieve the above object, in one aspect, the present invention provides a method for processing a join-relationship event in a service scenario, where the join-relationship is between nodes forming a unidirectional loop-free structure; any two nodes with a relationship include a first node and a second node, and under the condition that the first node is processed, the first node with the second node also processed is a concerned node of the second node, and the processing method includes: determining a current node, in which characteristic information of the concerned node in the association is consistent with characteristic information of a processed node, based on association information between preconfigured nodes; executing processing on an object corresponding to the current node when the association event occurs based on association information between preconfigured nodes and processing information of the processed node about the association event; and constructing and broadcasting a broadcast message body about the current node according to the processing information about the associative event of the current node, wherein the broadcast message body comprises: and the characteristic information of the current node and the processing information of the current node about the association relation event.
Preferably, the associative information includes: the relationship event includes a relationship between a plurality of nodes and a relationship coefficient between any node and a node of interest of the any node.
Preferably, the executing processing on the object corresponding to the current node when the association event occurs includes: invoking identification information corresponding to the current node when the association event occurs; and executing corresponding processing on an object corresponding to the invoked identification information of the current node according to the processing information of the current node about the associative event.
Preferably, the association relationship is an association relationship among a first operator located node, a second operator located node and a third operator located node which form a unidirectional loop-free structure, the feature information includes post information of the first operator, the second operator or the third operator, and in the case that an object corresponding to the first operator located node has been adjusted to a preset parameter and a broadcast message body related to the node has been broadcast, the broadcast message body correspondingly includes: the post information of the first operator adjusted with the preset parameters and the preset parameters are used for determining that the current node, in which the post information of the concerned node in the association is consistent with the post information of the first operator, is the node where the second operator or the third operator is located, based on the association information between the preconfigured nodes; based on the preset parameters of the preset association relation information between the nodes and the adjusted object corresponding to the node where the first operator is located, adjusting the corresponding parameters of the object corresponding to the node where the second operator or the third operator is located when the association relation event occurs; and constructing and broadcasting a broadcast message body related to the node where the second operator or the third operator is located according to the adjusted parameters of the object corresponding to the node where the second operator or the third operator is located.
Preferably, the associative information includes the following: the concerned node of the node where the second operator is located is the node where the first operator is located, and the association coefficient between the node where the first operator is located and the node where the second operator is located is the first association coefficient; the concerned node of the node where the third operator is located is the node where the first operator is located and the node where the second operator is located, the association coefficient between the node where the third operator is located and the node where the first operator is located is the second association coefficient, and the association coefficient between the node where the third operator is located and the node where the second operator is located is the third association coefficient.
Preferably, the adjusting the corresponding parameter of the object corresponding to the node where the second operator or the third operator is located when the associative event occurs includes: determining a first parameter to be adjusted of a node where a second operator is located or a second parameter to be adjusted of a node where a third operator is located based on the preset parameter, where an object corresponding to the node where the first operator is located, is adjusted, and the first connecting coefficient or the second connecting coefficient; and adjusting the first parameter of the object corresponding to the node where the second operator is located when the associative event occurs or the second parameter of the object corresponding to the node where the third operator is located when the associative event occurs.
Preferably, under the condition that the object corresponding to the node where the second operator is located is adjusted to the first parameter, correspondingly, determining that the current node where the position information of the concerned node in the association is consistent with the position information of the second operator is the node where the third operator is located; determining a third parameter to be adjusted of a node where a third operator is located based on the first parameter and the third connecting coefficient, wherein the first parameter and the third connecting coefficient are adjusted of an object corresponding to the node where the second operator is located; adjusting a third parameter of an object corresponding to a node where a third operator is located when the association event occurs; and constructing and broadcasting a broadcast message body related to the node where the third operator is located according to the third parameter of which the object corresponding to the node where the third operator is located is adjusted.
A second aspect of the present invention provides a processing system for events having a relationship between nodes forming a unidirectional loop-free structure; any two nodes with a relationship include a first node and a second node, and the first node with the second node also processed is a node of interest of the second node under the condition that the first node is processed, the processing system includes: determining means for determining a current node in which feature information of the node of interest in the relationship is identical to feature information of a node to be processed, based on relationship information between preconfigured nodes; processing means for executing processing on an object corresponding to the current node when the associative event occurs, based on associative information between preconfigured nodes and processing information of the processed node about the associative event; and broadcasting means for constructing and broadcasting a broadcast message body regarding the current node according to the processing information regarding the associative event of the current node, wherein the broadcast message body includes: and the characteristic information of the current node and the processing information of the current node about the association relation event.
The specific details and benefits of the processing system for the join-relationship event in the service scenario provided in the present invention can be referred to the above description of the processing method for the join-relationship event in the service scenario, and will not be repeated herein.
A third aspect of the present invention provides a machine-readable storage medium having stored thereon instructions for causing a machine to perform the above-described processing method for a join relationship event within a business scenario.
A fourth aspect of the present invention provides an electronic device, including: a processor; and a memory for storing executable instructions of the processor, wherein the processor is used for reading the executable instructions from the memory and executing the executable instructions to realize the processing method for the connection relation event in the business scene.
Through the technical scheme, the node, of which the characteristic information is matched with the characteristic information of the node to be processed, of the concerned node is creatively determined to be the current node, then the object corresponding to the current node is processed based on the association relation information among the nodes and the processing information of the node to be processed when the event occurs, and then the corresponding broadcast message body is constructed and broadcast based on the processing information of the current node so as to execute the next round of processing process. In the process of executing the processing on the current node, the association relation information between the current node and the processed node is attributed to the processing information of the current node, so that the characteristic information of the current node is not required to be considered when the processing is executed, the processing is directly executed according to the determined processing information, the decoupling between different nodes in the association relation is realized, and the processing efficiency of the association relation event is greatly improved.
Additional features and advantages of the invention will be set forth in the detailed description which follows.
Drawings
The accompanying drawings are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification, illustrate the invention and together with the description serve to explain, without limitation, the invention. In the drawings:
FIG. 1 is a schematic illustration of a relationship event of a unidirectional acyclic graph formed by a plurality of nodes provided by an embodiment of the present invention;
FIG. 2 is a flow chart of a method for processing events with associative relationships according to an embodiment of the present invention;
FIG. 3 is a flowchart of a method for processing a join-relationship event in a business scenario according to an embodiment of the present invention;
FIG. 4 illustrates a linking relationship event for a unidirectional loop-free structure formed by broker nodes, business district manager nodes, and store group leader nodes in accordance with an embodiment of the present invention
FIG. 5 is a flow chart of a process for withholding the relationship event of FIG. 4 provided by an embodiment of the present invention; and
FIG. 6 is a block diagram of a processing system for events with interrelationships provided by an embodiment of the present invention.
Description of the reference numerals
10. Determination device 20 processing device
30 broadcasting device
Detailed Description
The following describes specific embodiments of the present invention in detail with reference to the drawings. It should be understood that the detailed description and specific examples, while indicating and illustrating the invention, are not intended to limit the invention.
Before describing the embodiments of the present invention, the general idea of the present invention of handling events within a complex business scenario, such as a join-and-drop business scenario, is presented. The process of performing a process for a associative event may be referred to as an associative process.
A complete joint process may be abstracted into a complex directed acyclic graph, as shown in fig. 1, where any two nodes with a joint relationship include a first node (e.g., node a) and a second node (e.g., node B), where the first node is processed, the first node with the second node also processed is a node of interest to the second node (node B is node a). Wherein each circle represents a node, i.e. an abstract single process: processing the last node (i.e., the processed node); and broadcasting a broadcast message body to each node to inform the next node to be processed (i.e., the current node), the broadcast message body may include: characteristic information (e.g., post information) of the processed node and processing information (e.g., buckled parameters) performed on the processed node. Each arrow represents a node at the arrow tail (node B) focusing on a node at the arrow (node a), i.e., the node of interest of node B is node a. That is, there is a relationship between node B and node a, and node B is also subjected to the relationship when node a is out of order and needs to be processed. Each node in the directed acyclic graph is not concerned with the overall processing state of the associated process, only with the processing state of its concerned node. Specifically, only if the feature information of the processed node in the broadcast message body is the same as the feature information of the concerned node of a certain node, the single processing process of the node is triggered, and then the loop is continued until the complete traversal of the directed acyclic graph in fig. 1 is completed.
In addition, associative relationship information between a plurality of nodes involved in the unidirectional acyclic graph in fig. 1 may be configured in a database. Wherein the associative relationship information includes: a relationship between a plurality of nodes, and a relationship coefficient between any node and a node of interest of the any node. The farther the relationship between two nodes having a relationship, the smaller the relationship coefficient between the two nodes.
Therefore, the invention can greatly simplify the development code quantity and reduce the complexity of the codes, and if the associated flow is changed, only the characteristic information of the concerned node configured by each node is changed without changing the codes, and the codes are not required to be packed and released on line, thereby realizing the decoupling between different associated nodes and greatly improving the development and maintenance efficiency.
Fig. 2 is a flowchart of a processing method for a join event in a service scenario according to an embodiment of the present invention, where the join is between nodes forming a unidirectional loop-free structure. As shown in fig. 2, the processing method may include the steps of: step S201, determining a current node, in which the characteristic information of the concerned node in the association is consistent with the characteristic information of the processed node, based on the association information between the preconfigured nodes; step S202, based on the preconfigured association relation information among the nodes and the processing information of the processed node about the association relation event, processing is performed on the object corresponding to the current node when the association relation event occurs; and step S203, constructing and broadcasting a broadcast message body about the current node according to the processing information about the association relation event of the current node. Wherein the broadcast message body may include: and the characteristic information of the current node and the processing information of the current node about the association relation event.
Specifically, in step S201, based on the preconfigured association relationship information between the nodes, it is determined whether the feature information of the concerned node of each node in the association relationship is consistent with the feature information of the processed node, if the feature information of the concerned node of one or more nodes is consistent with the feature information of the processed node, the one or more nodes are determined to be the current node, and step S202 is executed to process the current node.
Before performing the step S202, the processing method may further include: and calling the preconfigured association relation information between the current node and the processed node.
Accordingly, for the step S202, the performing processing on the object corresponding to the current node when the association event occurs may include: invoking identification information corresponding to the current node when the association event occurs; and performing corresponding processing on an object corresponding to the invoked identification information of the current node based on the association information between the preconfigured nodes and the processing information of the processed node about the association event.
Wherein the performing of the corresponding processing on the object corresponding to the invoked identification information of the current node may include: determining processing information of a current node about the relationship event based on the relationship information between nodes and the processing information of the processed node about the relationship event; and executing corresponding processing on the object corresponding to the identification information of the current node according to the processing information of the current node about the association relation event. Specifically, under the condition that the association relation event is an association adjustment processing event, multiplying the adjusted parameter of the processed node by an association coefficient between the current node and the processed node to obtain the parameter to be adjusted of the current node; and then, according to the parameters to be adjusted of the current node, adjusting the current node.
For the step S203, after the parameters corresponding to the current node are adjusted, the feature information of the current node and the processing information of the current node about the association event are packaged in a broadcast message body, and the broadcast message body formed by the packaging is broadcast, where all nodes can receive the broadcast, so that when the feature information of the concerned node of a certain node matches the feature information of the current node (i.e. the processed node of the current processing procedure) of the previous processing procedure in the broadcast message body, the next processing procedure can be entered.
And under the condition that the association relation is the association relation among the first operator node, the second operator node and the third operator node which form the unidirectional loop-free structure, the feature information comprises the post information of the first operator, the second operator or the third operator. In the case that the object corresponding to the node where the first operator is located has been adjusted by a preset parameter and a broadcast message body about the node has been broadcast, the broadcast message body may correspondingly include: and the post information of the first operator, which is regulated to the preset parameter, and the preset parameter. The first operator, the second operator and the third operator can respectively correspond to a broker, a business manager and a store group organization.
Specifically, as shown in fig. 3, the processing method for the association relation event in the service scenario may include the following steps: step S301, determining that a current node, in which the post information of a concerned node in the association is consistent with the post information of a first operator, is a node where a second operator or a third operator is located, based on association information between preconfigured nodes; step S302, based on the preset parameters of the preset association relation information between the nodes and the adjusted object corresponding to the node where the first operator is located, adjusting the corresponding parameters of the object corresponding to the node where the second operator or the third operator is located when the association relation event occurs; and step S303, constructing and broadcasting a broadcast message body related to the node where the second operator or the third operator is located according to the adjusted parameters of the object corresponding to the node where the second operator or the third operator is located. Wherein the broadcast message body may include: the post information of the second operator or the third operator and the parameters adjusted by the second operator or the third operator.
Wherein the associative information may include the following: the concerned node of the node where the second operator is located is the node where the first operator is located, and the association coefficient between the node where the first operator is located and the node where the second operator is located is the first association coefficient; the concerned node of the node where the third operator is located is the node where the first operator is located and the node where the second operator is located, the association coefficient between the node where the third operator is located and the node where the first operator is located is the second association coefficient, and the association coefficient between the node where the third operator is located and the node where the second operator is located is the third association coefficient.
For the step S302, the adjusting the corresponding parameter of the object corresponding to the node where the second operator or the third operator is located when the associative event occurs may include: determining a first parameter to be adjusted of a node where a second operator is located or a second parameter to be adjusted of a node where a third operator is located based on the preset parameter, where an object corresponding to the node where the first operator is located, is adjusted, and the first connecting coefficient or the second connecting coefficient; and adjusting the first parameter of the object corresponding to the node where the second operator is located when the associative event occurs or the second parameter of the object corresponding to the node where the third operator is located when the associative event occurs.
Specifically, the determining the first parameter to be adjusted at the node where the second operator is located or the second parameter to be adjusted at the node where the third operator is located may include: taking the product of the preset parameter and the first connecting coefficient as a first parameter to be adjusted of a node where a second operator is located; and taking the product of the preset parameter and the second association coefficient as a second parameter to be adjusted of the node where the third operator is located.
Under the condition that an object corresponding to a node where a second operator is located is adjusted to the first parameter, correspondingly, determining that a current node where the position information of the concerned node in the association is consistent with the position information of the second operator is a node where a third operator is located; determining a third parameter to be adjusted of a node where a third operator is located based on the first parameter and the third connecting coefficient, wherein the first parameter and the third connecting coefficient are adjusted of an object corresponding to the node where the second operator is located; adjusting a third parameter of an object corresponding to a node where a third operator is located when the association event occurs; and constructing and broadcasting a broadcast message body related to the node where the third operator is located according to the third parameter of which the object corresponding to the node where the third operator is located is adjusted. Wherein the determining the third parameter to be adjusted for the node where the third operator is located may include: and taking the product of the first parameter and the third association coefficient as a third parameter to be adjusted of the node where the third operator is located. Wherein, the processing operation for adjusting the preset parameter can comprise: deducting the preset score or adjusting the preset stock quantity, and correspondingly, the parameter can be the score or the stock quantity.
The deduction process will be explained and explained by taking a linking relation event of a unidirectional loop-free structure formed by a node where a broker is located (simply referred to as a broker node), a node where a business manager is located (simply referred to as a business manager node) and a node where a store group leader is located (simply referred to as a store group leader node) as shown in fig. 4 as an example. The post information of the broker node, the business manager node, and the store group leader node is simply referred to as "broker", "business manager", and "store group leader", respectively.
The deduction process for the associative event includes the following steps, as shown in fig. 5.
In step S501, in case of a violation by the "broker", the score to be deducted by the broker node is determined.
Wherein the score to be subtracted by the broker node may be "1". The broker node acts as the processed node in step S502.
Step S502, calling the identification information corresponding to the processed node when the illegal action occurs, and deducting the object corresponding to the identification information according to the determined score to be deducted.
For example, the identification information may be an identification card number or employee identification number, etc. capable of unique identification.
Step S503, constructing and broadcasting a broadcast message body about the processed node.
In step S504, each node receives the broadcast message body.
Step S505, judging whether the position information of the concerned node in each node is consistent with the position information of the processed node in the broadcast message body, if so, executing step S506; otherwise, the associated line is ended.
Step S506, determining that the node with the post information of the concerned node consistent with the post information of the processed node is the current node.
Step S507, calling the association relation information between the current node and the processed node, determining the score to be deducted from the current node, and executing step S502 in a circulating way.
Because the processing information of the current node acquired in step S507 includes the association information between the current node and the processed node, the deduction process performed on the current node by step S502 and step S503 is irrelevant to the characteristic information of the node, that is, a single stateless deduction process is implemented.
In the case where the broker node is the processed node, the specific contents of steps S502 to S507 are as follows.
Calling the identification information corresponding to the broker node when the illegal action occurs, and deducting the broker corresponding to the identification information according to the determined score to be deducted ('1');
Packaging a 'broker' and a score '1' deducted from a broker node in a broadcast message body, and broadcasting the broadcast message body;
the broker node, the business manager node and the store group leader node receive the broadcast message body;
judging whether the post information of concerned nodes of the broker node, the business district manager node and the store group leader node is a 'broker';
under the condition that the post information of concerned nodes of the business manager node and the store group leader node is determined to be a 'broker', determining the business manager node and the store group leader node as current nodes; and
the relationship information between the business manager node and the store group leader node and the broker node is invoked, and the score to be subtracted by the business manager node (e.g., if the relationship coefficient between the business manager node and the broker node is 1/12, the score to be subtracted is 1/12× "1" = "1/12") and the score to be subtracted by the store group leader node (e.g., if the relationship coefficient between the store group leader node and the broker node is 1/24, the score to be subtracted is 1/24× "1" = "1/24").
Then, the next round of buckling process is entered: in the case where the business district manager node is a processed node, the specific contents of steps S502 to S507 are as follows. The process is similar to the case where the node of the store group leader is the processed node, and the description thereof is omitted.
Invoking identification information corresponding to a business manager node when the illegal action occurs, and deducting business manager corresponding to the identification information according to the determined score to be deducted (1/12);
packaging the business manager and the point deducted from the business manager node (1/12) in a broadcast message body, and broadcasting the broadcast message body;
the broker node, the business manager node and the store group leader node receive the broadcast message body;
judging whether the post information of concerned nodes of the broker node, the business district manager node and the store group leader node is 'business district manager';
under the condition that the post information of the concerned node of the store group leader node is determined to be a 'business manager', the store group leader node is determined to be a current node; and
the association information between the store group leader node and the broker node is invoked and the score to be subtracted for the store group leader node is determined (e.g., if the association coefficient between the store group leader node and the business manager node is 1/12, then the score to be subtracted is 1/12× "1/12" = "1/144").
Then, the next round of buckling process is entered: if the group owner node is the processed node, it is determined in step S505 that the post information of the concerned node where no node exists matches the "group owner", and the flow ends.
In summary, the present invention creatively determines that a node, in which feature information of a concerned node matches feature information of a processed node, is a current node, then performs processing on an object corresponding to the current node when an event occurs based on association relationship information between nodes and processing information of the processed node, and then constructs and broadcasts a corresponding broadcast message body based on the processing information of the current node to perform a next round of processing. In the process of executing the processing on the current node, the association relation information between the current node and the processed node is attributed to the processing information of the current node, so that the characteristic information of the current node is not required to be considered when the processing is executed, the processing is directly executed according to the determined processing information, the decoupling between different nodes in the association relation is realized, and the processing efficiency of the association relation event is greatly improved.
Accordingly, as shown in fig. 6, the embodiment of the present invention further provides a block diagram of a processing system for events with associative relations. The relationship may be between nodes forming a unidirectional loop-free structure; any two nodes with a relationship include a first node and a second node, and the first node with the second node also processed is a node of interest of the second node under the condition that the first node is processed. The processing system may include: determining means 10 for determining, based on association relation information between preconfigured nodes, a current node in which feature information of the node of interest in the association relation coincides with feature information of a node to be processed; processing means 20 for executing processing on an object corresponding to the current node at the time of occurrence of a relationship event based on relationship information between preconfigured nodes and processing information on the relationship event of the processed node; and broadcasting means 30 for constructing and broadcasting a broadcast message body regarding the current node according to the processing information regarding the associative event of the current node. Wherein the broadcast message body includes: and the characteristic information of the current node and the processing information of the current node about the association relation event.
Preferably, the associative information includes: the relationship event includes a relationship between a plurality of nodes and a relationship coefficient between any node and a node of interest of the any node.
Preferably, the processing device comprises: the calling module is used for calling the identification information corresponding to the current node when the association event occurs; and a processing module, configured to execute corresponding processing on an object corresponding to the invoked identification information of the current node according to the processing information of the current node about the association event.
Preferably, the association relationship is an association relationship among a first operator located node, a second operator located node and a third operator located node which form a unidirectional loop-free structure, the feature information includes post information of the first operator, the second operator or the third operator, and in the case that an object corresponding to the first operator located node has been adjusted to a preset parameter and a broadcast message body related to the node has been broadcast, the broadcast message body correspondingly includes: the determining device is used for determining that a current node, in which the post information of the concerned node in the association is consistent with the post information of the first operator, is a node where a second operator or a third operator is located, based on the association information between the preconfigured nodes; the processing device is used for adjusting corresponding parameters of the object corresponding to the node where the second operator or the third operator is located when the association event occurs based on association information between preconfigured nodes and the preset parameters of the object corresponding to the first operator; and the broadcasting device is used for constructing and broadcasting a broadcasting message body related to the node where the second operator or the third operator is located according to the adjusted parameters of the object corresponding to the node where the second operator or the third operator is located.
Preferably, the associative information includes the following: the concerned node of the node where the second operator is located is the node where the first operator is located, and the association coefficient between the node where the first operator is located and the node where the second operator is located is the first association coefficient; the concerned node of the node where the third operator is located is the node where the first operator is located and the node where the second operator is located, the association coefficient between the node where the third operator is located and the node where the first operator is located is the second association coefficient, and the association coefficient between the node where the third operator is located and the node where the second operator is located is the third association coefficient.
Preferably, the processing device comprises: the first determining module is used for determining a first parameter to be adjusted of a node where a second operator is located or a second parameter to be adjusted of a node where a third operator is located based on the preset parameter, where an object corresponding to the node where the first operator is located, is adjusted, and the first connecting coefficient or the second connecting coefficient; and the first adjusting module is used for adjusting the first parameter of the object corresponding to the node where the second operator is located when the associative event occurs or the second parameter of the object corresponding to the node where the third operator is located when the associative event occurs.
Preferably, in the case that the object corresponding to the node where the second operator is located has been adjusted to the first parameter, the determining device is correspondingly configured to determine that the current node where the post information of the concerned node in the association corresponds to the post information of the second operator is the node where the third operator is located, where the processing device includes: the second determining module is used for determining a third parameter to be adjusted of the node where the third operator is located based on the first parameter and the third connecting coefficient, which are adjusted of the object corresponding to the node where the second operator is located; and the second adjusting module is used for adjusting a third parameter of an object corresponding to the node where the third operator is located when the association event occurs, and the broadcasting device is used for constructing and broadcasting a broadcasting message body related to the node where the third operator is located according to the third parameter of the object adjusted corresponding to the node where the third operator is located.
The specific details and benefits of the processing system for the join-relationship event in the service scenario provided in the present invention can be referred to the above description of the processing method for the join-relationship event in the service scenario, and will not be repeated herein.
Accordingly, the present invention also provides a machine-readable storage medium having stored thereon instructions for causing a machine to perform the above-described processing method for a join relationship event within a business scenario.
The machine-readable storage medium includes, but is not limited to, phase-change Memory (abbreviation for phase-change random access Memory, phase Change Random Access Memory, PRAM, also known as RCM/PCRAM), 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 (Flash Memory) or other Memory technology, compact disc read only Memory (CD-ROM), digital Versatile Disc (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices, and the like.
Correspondingly, the invention also provides electronic equipment, which comprises: a processor; and a memory for storing executable instructions of the processor, wherein the processor is used for reading the executable instructions from the memory and executing the executable instructions to realize the processing method for the connection relation event in the business scene.
It will be appreciated that each device, module, unit, etc. of the processing system for a carryover event within a business scenario may be stored in the memory as an instruction unit, and the processor executes the instruction unit stored in the memory to implement the corresponding function. The processor comprises a kernel, and the kernel calls a corresponding instruction unit in the memory. The kernel can be provided with one or more than one, and the processing method for the connection relation event in the business scene is executed by adjusting kernel parameters according to any embodiment of the invention.
The memory may include forms of non-persistent memory, random Access Memory (RAM), and/or non-volatile memory in a machine-readable storage medium, such as read-only memory (ROM) or flash memory (flash RAM), including at least one memory chip.
The preferred embodiments of the present invention have been described in detail above with reference to the accompanying drawings, but the present invention is not limited to the specific details of the above embodiments, and various simple modifications can be made to the technical solution of the present invention within the scope of the technical concept of the present invention, and all the simple modifications belong to the protection scope of the present invention.
In addition, the specific features described in the above embodiments may be combined in any suitable manner without contradiction. The various possible combinations of the invention are not described in detail in order to avoid unnecessary repetition.
Moreover, any combination of the various embodiments of the invention can be made without departing from the spirit of the invention, which should also be considered as disclosed herein.

Claims (16)

1. A processing method for a interlinked relation event in a service scene is characterized in that the interlinked relation is the interlinked relation among nodes forming a unidirectional loop-free structure, wherein the nodes are nodes where operators are located; any two nodes with a relationship include a first node and a second node, and under the condition that the first node is processed, the first node with the second node also processed is a concerned node of the second node, and the processing method includes:
determining a current node with the feature information of the concerned node in the association consistent with the feature information of the processed node based on the association information between the preconfigured nodes, wherein the feature information is the post information of an operator;
Executing processing on an object corresponding to the current node when the association event occurs based on association information between preconfigured nodes and processing information of the processed node about the association event; and
constructing and broadcasting a broadcast message body about the current node according to the processing information about the relationship event of the current node, wherein the broadcast message body comprises: and the characteristic information of the current node and the processing information of the current node about the association relation event.
2. The method for processing a join event in a business scenario according to claim 1, wherein the join information comprises: the relationship event includes a relationship between a plurality of nodes and a relationship coefficient between any node and a node of interest of the any node.
3. The method for processing a join event in a traffic scenario according to claim 1, wherein the performing processing on the object corresponding to the current node when the join event occurs comprises:
invoking identification information corresponding to the current node when the association event occurs; and
Based on the association information between the preconfigured nodes and the processing information of the processed nodes about the association event, corresponding processing is performed on the object corresponding to the invoked identification information of the current node.
4. The method for processing a join-relationship event in a traffic scenario according to claim 1, wherein the join-relationship is a join-relationship among a first operator node, a second operator node, and a third operator node that form a unidirectional loop-free structure, the feature information includes position information of the first operator, the second operator, or the third operator,
in the case that the object corresponding to the node where the first operator is located has been adjusted by a preset parameter and a broadcast message body about the node has been broadcast, the broadcast message body correspondingly includes: the post information of the first operator adjusted with the preset parameter and the preset parameter,
based on the preconfigured association relation information between the nodes, determining that the current node in which the post information of the concerned node in the association relation is consistent with the post information of the first operator is the node where the second operator or the third operator is located;
Based on the preset parameters of the preset association relation information between the nodes and the adjusted object corresponding to the node where the first operator is located, adjusting the corresponding parameters of the object corresponding to the node where the second operator or the third operator is located when the association relation event occurs; and
and constructing and broadcasting a broadcast message body related to the node where the second operator or the third operator is located according to the adjusted parameters of the object corresponding to the node where the second operator or the third operator is located.
5. The method for processing a join event within a business scenario of claim 4, wherein the join information comprises: the concerned node of the node where the second operator is located is the node where the first operator is located, and the association coefficient between the node where the first operator is located and the node where the second operator is located is the first association coefficient; the concerned node of the node where the third operator is located is the node where the first operator is located and the node where the second operator is located, the association coefficient between the node where the third operator is located and the node where the first operator is located is the second association coefficient, and the association coefficient between the node where the third operator is located and the node where the second operator is located is the third association coefficient.
6. The method for processing a associative event in a traffic scenario according to claim 5, wherein the adjusting the corresponding score of the object corresponding to the node where the second operator or the third operator is located when the associative event occurs comprises:
determining a first score to be adjusted of a node where a second operator is located or a second score to be adjusted of a node where a third operator is located based on the preset parameter, where the object corresponding to the node where the first operator is located, is adjusted, and the first connecting coefficient or the second connecting coefficient; and
and adjusting the first parameter of the object corresponding to the node where the second operator is located when the association event occurs or the second parameter of the object corresponding to the node where the third operator is located when the association event occurs.
7. The method for processing a join event in a traffic scenario according to claim 6, wherein, in case the object corresponding to the node where the second operator is located has been adjusted by the first parameter,
correspondingly, determining that the current node of which the post information of the concerned node in the association is consistent with the post information of the second operator is the node where the third operator is located;
Determining a third parameter to be adjusted of a node where a third operator is located based on the first parameter and the third connecting coefficient, wherein the first parameter and the third connecting coefficient are adjusted of an object corresponding to the node where the second operator is located;
adjusting a third parameter of an object corresponding to a node where a third operator is located when the association event occurs; and
and constructing and broadcasting a broadcast message body related to the node where the third operator is located according to the third parameter of which the object corresponding to the node where the third operator is located is adjusted.
8. The processing system for the association relation event in the service scene is characterized in that the association relation is between nodes forming a unidirectional loop-free structure, wherein the nodes are nodes where operators are located; any two nodes with a relationship include a first node and a second node, and the first node with the second node also processed is a node of interest of the second node under the condition that the first node is processed, the processing system includes:
determining means for determining, based on association relation information between preconfigured nodes, a current node in which feature information of the node of interest in the association relation is identical to feature information of a node to be processed, wherein the feature information is position information of an operator;
Processing means for executing processing on an object corresponding to the current node when the associative event occurs, based on associative information between preconfigured nodes and processing information of the processed node about the associative event; and
a broadcasting device, configured to construct and broadcast a broadcast message body related to the current node according to the processing information related to the associative event of the current node, where the broadcast message body includes: and the characteristic information of the current node and the processing information of the current node about the association relation event.
9. The system for processing a join event within a business scenario of claim 8, wherein the join information comprises: the relationship event includes a relationship between a plurality of nodes and a relationship coefficient between any node and a node of interest of the any node.
10. The processing system for a carryover event within a business scenario of claim 8, wherein the processing means comprises:
the calling module is used for calling the identification information corresponding to the current node when the association event occurs; and
And the processing module is used for executing corresponding processing on the object corresponding to the invoked identification information of the current node based on the association relation information among the preconfigured nodes and the processing information of the processed node about the association relation event.
11. The system for processing a join relationship event in a traffic scenario according to claim 8, wherein the join relationship is a join relationship among a first operator node, a second operator node, and a third operator node that form a unidirectional loop-free structure, the feature information includes position information of the first operator, the second operator, or the third operator,
in the case that the object corresponding to the node where the first operator is located has been adjusted by a preset parameter and a broadcast message body about the node has been broadcast, the broadcast message body correspondingly includes: the post information of the first operator adjusted with the preset parameter and the preset parameter,
the determining device is used for determining that the current node, in which the position information of the concerned node in the association is consistent with the position information of the first operator, is the node where the second operator or the third operator is located, based on the association information between the preconfigured nodes;
The processing device is used for adjusting corresponding parameters of the object corresponding to the node where the second operator or the third operator is located when the association event occurs based on association information between preconfigured nodes and the preset parameters of the object corresponding to the first operator; and
the broadcasting device is used for constructing and broadcasting a broadcasting message body related to the node where the second operator or the third operator is located according to the adjusted parameters of the object corresponding to the node where the second operator or the third operator is located.
12. The processing system for a join event within a business scenario of claim 11, wherein the join information comprises: the concerned node of the node where the second operator is located is the node where the first operator is located, and the association coefficient between the node where the first operator is located and the node where the second operator is located is the first association coefficient; the concerned node of the node where the third operator is located is the node where the first operator is located and the node where the second operator is located, the association coefficient between the node where the third operator is located and the node where the first operator is located is the second association coefficient, and the association coefficient between the node where the third operator is located and the node where the second operator is located is the third association coefficient.
13. The processing system for a carryover event within a business scenario of claim 12, wherein the processing means comprises:
the first determining module is used for determining a first parameter to be adjusted of a node where a second operator is located or a second parameter to be adjusted of a node where a third operator is located based on the preset parameter, where an object corresponding to the node where the first operator is located, is adjusted, and the first connecting coefficient or the second connecting coefficient; and
the first adjusting module is used for adjusting the first parameter of the object corresponding to the node where the second operator is located when the association event occurs or the second parameter of the object corresponding to the node where the third operator is located when the association event occurs.
14. The system for processing a join event in a business scenario according to claim 13 wherein, in the event that the object corresponding to the node at which the second operator is located has been adjusted by the first parameter,
correspondingly, the determining device is used for determining that the current node of which the post information of the concerned node in the association is consistent with the post information of the second operator is the node where the third operator is located,
The processing device comprises:
the second determining module is used for determining a third parameter to be adjusted of the node where the third operator is located based on the first parameter and the third connecting coefficient, which are adjusted of the object corresponding to the node where the second operator is located; and
a second adjusting module for adjusting a third parameter of the object corresponding to the node where the third operator is located when the association event occurs,
the broadcasting device is used for constructing and broadcasting a broadcasting message body related to the node where the third operator is located according to the third parameter subtracted by the object corresponding to the node where the third operator is located.
15. A machine-readable storage medium having stored thereon instructions for causing a machine to perform the method of processing a join relationship event for use in a business scenario of any of the preceding claims 1-7.
16. An electronic device, the electronic device comprising:
a processor; and
a memory for storing executable instructions of the processor,
the processor is configured to read the executable instructions from the memory and execute the executable instructions to implement the processing method for a join relationship event within a business scenario according to any one of the preceding claims 1-7.
CN201911009931.7A 2019-10-23 2019-10-23 Processing method and processing system for link relation event in business scene Active CN110888941B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911009931.7A CN110888941B (en) 2019-10-23 2019-10-23 Processing method and processing system for link relation event in business scene

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911009931.7A CN110888941B (en) 2019-10-23 2019-10-23 Processing method and processing system for link relation event in business scene

Publications (2)

Publication Number Publication Date
CN110888941A CN110888941A (en) 2020-03-17
CN110888941B true CN110888941B (en) 2023-08-11

Family

ID=69746396

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911009931.7A Active CN110888941B (en) 2019-10-23 2019-10-23 Processing method and processing system for link relation event in business scene

Country Status (1)

Country Link
CN (1) CN110888941B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103458021A (en) * 2013-08-29 2013-12-18 中国科学院软件研究所 Event-driven state-oriented self-adaptive sensor organizational method
CN103678471A (en) * 2012-09-24 2014-03-26 国际商业机器公司 Method and device for partitioning search space for distributed crawling
CN109272385A (en) * 2018-09-14 2019-01-25 阿里巴巴集团控股有限公司 It is a kind of based on block chain copyright issue agency deposit card method and system
CN109615379A (en) * 2018-10-24 2019-04-12 阿里巴巴集团控股有限公司 One kind refusing to pay processing system generation method and device

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9749410B2 (en) * 2014-11-18 2017-08-29 Cisco Technology, Inc. Using bit index explicit replication (BIER) in low-power and lossy networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103678471A (en) * 2012-09-24 2014-03-26 国际商业机器公司 Method and device for partitioning search space for distributed crawling
CN103458021A (en) * 2013-08-29 2013-12-18 中国科学院软件研究所 Event-driven state-oriented self-adaptive sensor organizational method
CN109272385A (en) * 2018-09-14 2019-01-25 阿里巴巴集团控股有限公司 It is a kind of based on block chain copyright issue agency deposit card method and system
CN109615379A (en) * 2018-10-24 2019-04-12 阿里巴巴集团控股有限公司 One kind refusing to pay processing system generation method and device

Also Published As

Publication number Publication date
CN110888941A (en) 2020-03-17

Similar Documents

Publication Publication Date Title
CN111369358B (en) Block chain consensus method and device and electronic equipment
CN108985742B (en) Transaction processing method and device and block chain system
CN111079101B (en) Method and device for obtaining evidence of infringement based on block chain, electronic equipment and storage medium
CN110222936B (en) Root cause positioning method and system of business scene and electronic equipment
CN111181784B (en) Network port state management method, state machine engine device, equipment and medium
CN111383106B (en) Credit processing method, device, equipment and system
CN110569063B (en) Sub-application APP generation method and generation device
CN111061735B (en) Capacity expansion method and device based on single-chain blockchain
CN112037061A (en) Processing method and device for transactions in block chain, electronic equipment and storage medium
CN108256870B (en) Method and device for generating description information, updating and processing data based on topological structure
TWI686703B (en) Method and device for data storage and business processing
CN110851207B (en) State transition management method and device, electronic equipment and storage medium
CN113222667A (en) Equity sharing processing method and device
CN113301009B (en) Sequential message processing method and device
CN110888941B (en) Processing method and processing system for link relation event in business scene
CN109428682A (en) A kind of Message Processing confirmation method and device
CN111709748B (en) Transaction execution method and device with business attribute and electronic equipment
CN111756803A (en) Server-side pushing method, equipment and medium based on block chain technology
CN114827156B (en) Message scheduling method, device, equipment and storage medium
CN113703996B (en) Access control method, equipment and medium based on user and YANG model grouping
CN110442501B (en) Method and device for simulating business abnormality and electronic equipment
CN117650982A (en) Method, equipment and medium for implementing complex gateway based on BPMN
CN112131509B (en) Multi-entry page multiplexing method, device, computer equipment and readable storage medium
CN114584631A (en) Message processing method and device, electronic equipment and storage medium
CN108038092A (en) A kind of conversion method, intelligent terminal and the storage device of APN data formats

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant