Business processing method and device, electronic equipment and computer readable storage medium

Abstract

The invention provides a business processing method and device, electronic equipment and a computer readable storage medium, and can be applied to the technical fields of computer technology, big data technology, Internet of Things technology and data processing. The service processing method comprises: in response to a received service processing request, determining service information to be processed and processing end information according to a service identifier to be processed indicated by the service processing request, the service information to be processed comprising M service data identifiers and processing type identifiers respectively corresponding to the M service data identifiers, the processing end information comprises P processing end identifiers; in response to the permission of a processing end corresponding to the processing end identifier to execute processing corresponding to the processing type identifier, sending the service data identifier and the processing type identifier to the processing end corresponding to the processing end identifier; and in response to the received target business data from the processing end, processing the target business data to obtain a business processing result.

Description

Technical Field

[0001] The present disclosure relates to the fields of computer technology, big data technology, Internet of Things technology and data processing technology, and more specifically, to a business processing method and device, an electronic device, a computer-readable storage medium and a computer program product. Background Art

[0002] With the development of computer technology, ad hoc query (i.e. Ad Hoc) technology has emerged. Ad hoc query can refer to the process in which users flexibly select query conditions according to their personal needs, so that the system can generate corresponding statistical reports according to the user's selection.

[0003] Ad hoc queries can include online analytical processing (OLAP) scale query services and online transaction processing (OLTP) scale query services. OLAP can support the lake-warehouse integration solution of local tables and external tables.

[0004] In the process of implementing the concept of the present disclosure, the inventors found that there are at least the following problems in the related art: since the performance of online analytical processing at the kernel level and the usage level cannot be guaranteed, the efficiency and stability of business processing are low. Summary of the invention

[0005] In view of this, the present disclosure provides a service processing method and device, an electronic device, a computer-readable storage medium, and a computer program product.

[0006] According to one aspect of the present disclosure, a business processing method is provided, which is applied to a service end, comprising: in response to receiving a business processing request, determining to-be-processed business information and processing end information according to a to-be-processed business identifier indicated by the above-mentioned business processing request, wherein the above-mentioned to-be-processed business information includes M business data identifiers and processing type identifiers corresponding to each of the above-mentioned M business data identifiers, and the above-mentioned processing end information includes P processing end identifiers, and M and P are both positive integers; in response to the processing end corresponding to the above-mentioned processing end identifier allowing the execution of the processing corresponding to the above-mentioned processing type identifier, the above-mentioned business data identifier and the above-mentioned processing type identifier are sent to the processing end corresponding to the above-mentioned processing end identifier, so that the above-mentioned processing end determines the target business data according to the above-mentioned business data identifier; in response to receiving the target business data from the processing end, the above-mentioned target business data is processed to obtain a business processing result.

[0007] According to an embodiment of the present disclosure, the above-mentioned processing end information also includes a processing range identifier corresponding to each of the above-mentioned P processing end identifiers.

[0008] According to an embodiment of the present disclosure, the above-mentioned method also includes: for each of the above-mentioned M business data identifiers, in response to the above-mentioned processing scope identifier corresponding to the above-mentioned business data identifier indicating that the processing end corresponding to the above-mentioned processing end identifier belongs to the global processing scope, the above-mentioned processing end identifier and the above-mentioned processing type identifier are matched to obtain a matching result; when the above-mentioned matching result indicates that the above-mentioned processing end identifier and the above-mentioned processing type identifier match, it is determined that the processing end corresponding to the above-mentioned processing end identifier is permitted to execute the processing corresponding to the above-mentioned processing type identifier; when the above-mentioned matching result indicates that the above-mentioned processing end identifier and the above-mentioned processing type identifier do not match, it is determined that the processing end corresponding to the above-mentioned processing end identifier is prohibited from executing the processing corresponding to the above-mentioned processing type identifier.

[0009] According to an embodiment of the present disclosure, in response to the processing scope identifier corresponding to the business data identifier, indicating that the processing end corresponding to the processing end identifier belongs to the global processing scope, the processing end identifier and the processing type identifier are matched to obtain a matching result including: according to the processing end identifier, Q candidate processing end identifiers are matched respectively to obtain a target processing end identifier; according to the processing type identifier, S predetermined processing type identifiers corresponding to the target processing end identifier are matched respectively to obtain a processing type matching result; in a case where the processing type matching result indicates that there is a predetermined processing type identifier matching the above-mentioned processing type identifier among the above-mentioned S predetermined processing type identifiers, determining the matching result indicating that the processing end identifier and the above-mentioned processing type identifier match; in a case where the processing type matching result indicates that there is no predetermined processing type identifier matching the above-mentioned processing type identifier among the above-mentioned S predetermined processing type identifiers, determining the matching result indicating that the processing end identifier and the above-mentioned processing type identifier do not match; Q and S are both positive integers.

[0010] According to an embodiment of the present disclosure, when the candidate processing end identifier represents that the processing end belongs to the first target type, the predetermined processing type identifier corresponding to the candidate processing end identifier includes at least one of the following: counting type, association type, grouping type and extreme value type.

[0011] According to an embodiment of the present disclosure, when the above-mentioned candidate processing end identifier represents that the processing end belongs to the second target type, the predetermined processing type identifier corresponding to the above-mentioned candidate processing end identifier includes at least one of the following: counting type, summation type, mean type, association type, sorting type, grouping type and extreme value type.

[0012] According to an embodiment of the present disclosure, the above-mentioned method also includes: in response to the above-mentioned processing range identifier corresponding to the above-mentioned business data identifier indicating that the processing end corresponding to the above-mentioned processing end identifier belongs to a local processing range, obtaining initial business data according to the above-mentioned business data identifier; and processing the above-mentioned initial business data according to the processing type identifier corresponding to the above-mentioned business data identifier to obtain the second target business data corresponding to the above-mentioned business data identifier.

[0013] According to an embodiment of the present disclosure, the above-mentioned business information to be processed also includes the association relationship between the above-mentioned M business data identifiers, and the above-mentioned target business data includes the first target business data determined by the above-mentioned processing end and the second target business data determined by the above-mentioned service end.

[0014] According to an embodiment of the present disclosure, in response to receiving the target business data from the processing end, processing the target business data to obtain the business processing result includes: in response to receiving a first number of the first target business data from the processing end, processing the second number of the second target business data and the first number of the first target business data according to the association relationship to obtain the business processing result; the sum of the first number and the second number is equal to M.

[0015] According to another aspect of the present disclosure, a business processing method is provided, which is applied to a processing end, and includes: in response to receiving a business data identifier and a processing type identifier from a server, obtaining original business data according to the above business data identifier; processing the above original business data according to the above processing type identifier to obtain target business data; and sending the above target business data to the above server, so that the above server determines the business processing result according to the above target business data.

[0016] According to an embodiment of the present disclosure, the above-mentioned original business data is processed according to the above-mentioned processing type identifier to obtain the target business data, including: parsing the above-mentioned original business data to obtain an original data structure, wherein the above-mentioned original data structure includes P original data nodes and the association relationship between the above-mentioned P original data nodes, and P is a positive integer; according to the above-mentioned processing type identifier and the association relationship between the above-mentioned P original data nodes, the above-mentioned P original data nodes are processed to obtain the above-mentioned target business data.

[0017] According to an embodiment of the present disclosure, the above-mentioned original data nodes include a third number of original parent data nodes and a fourth number of original child data nodes corresponding to each of the above-mentioned third number of original parent data nodes.

[0018] According to an embodiment of the present disclosure, the above-mentioned P original data nodes are processed according to the association relationship between the above-mentioned processing type identifier and the above-mentioned P original data nodes to obtain the above-mentioned target business data, including: for each original parent data node among the above-mentioned third number of original parent data nodes, in response to the node type of the above-mentioned original parent data node being the target node type, Q child node sets are determined among the above-mentioned fourth number of original child data nodes corresponding to the above-mentioned original parent data node, wherein the above-mentioned child node set includes at least two original child data nodes with the same node type, and Q is a positive integer.

[0019] According to an embodiment of the present disclosure, for each sub-node set in the above-mentioned Q sub-node sets, at least two original sub-data nodes corresponding to the above-mentioned sub-node set are merged to obtain a target sub-node corresponding to the above-mentioned sub-node set; based on the association relationship between the above-mentioned P original data nodes and the target sub-nodes corresponding to each of the above-mentioned Q sub-node sets, the above-mentioned target business data is determined.

[0020] According to another aspect of the present disclosure, a business processing device is provided, which is applied to a service end, and includes: a first determination module, which is used to determine the to-be-processed business information and processing end information in response to receiving a business processing request, according to the to-be-processed business identifier indicated by the above-mentioned business processing request, wherein the above-mentioned to-be-processed business information includes M business data identifiers and processing type identifiers corresponding to the above-mentioned M business data identifiers respectively, and the above-mentioned processing end information includes P processing end identifiers, and M and P are both positive integers; a first sending module, which is used to send the above-mentioned business data identifier and the above-mentioned processing type identifier to the processing end corresponding to the above-mentioned processing end identifier in response to the processing end corresponding to the above-mentioned processing end identifier allowing the execution of the processing corresponding to the above-mentioned processing type identifier, so that the above-mentioned processing end determines the target business data according to the above-mentioned business data identifier; a first processing module, which is used to process the above-mentioned target business data in response to receiving the target business data from the processing end, and obtain the business processing result.

[0021] According to another aspect of the present disclosure, a business processing device is provided, which is applied to a processing end, and includes: a first acquisition module, which is used to obtain original business data in response to receiving a business data identifier and a processing type identifier from a server end according to the above business data identifier; a second processing module, which is used to process the above original business data according to the above processing type identifier to obtain target business data; and a second sending module, which is used to send the above target business data to the above server end, so that the above server end can determine the business processing result according to the above target business data.

[0022] According to another aspect of the present disclosure, an electronic device is provided, comprising: one or more processors; and a memory for storing one or more instructions, wherein when the one or more instructions are executed by the one or more processors, the one or more processors implement the method described in the present disclosure.

[0023] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which executable instructions are stored. When the executable instructions are executed by a processor, the processor implements the method described in the present disclosure.

[0024] According to another aspect of the present disclosure, a computer program product is provided. The computer program product includes computer executable instructions. When the computer executable instructions are executed, they are used to implement the method described in the present disclosure.

[0025] According to the embodiments of the present disclosure, since the pending business information and the processing end information are determined according to the pending business identifier indicated by the business processing request, the automatic determination of the relevant business information is realized, which is conducive to improving the efficiency of subsequent business processing. On this basis, when the processing end permits the execution of the processing corresponding to the processing type identifier, by sending the business data identifier and the processing type identifier to the processing end corresponding to the processing end identifier, the processing end determines the target business data according to the business data identifier, and since the business processing result is obtained by processing the target business data, the automatic processing of the business data is realized, thereby at least partially overcoming the technical problem in the related art that the efficiency and stability of business processing are low due to the inability to guarantee the performance of online analytical processing at the kernel level and the usage level, and improving the accuracy of the business processing results. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] The above and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0027] Figure 1 The system architecture to which the business processing method according to the embodiment of the present disclosure can be applied is schematically shown;

[0028] Figure 2 A flowchart of a business processing method according to an embodiment of the present disclosure is schematically shown;

[0029] Figure 3 An example schematic diagram schematically shows a business processing process according to an embodiment of the present disclosure;

[0030] Figure 4 An example schematic diagram schematically shows a business processing process according to another embodiment of the present disclosure;

[0031] Figure 5 A flowchart schematically shows a business processing method according to another embodiment of the present disclosure;

[0032] Figure 6 An example schematic diagram of a business processing process when the processing end belongs to the first target type according to an embodiment of the present disclosure is schematically shown;

[0033] Figure 7 An example schematic diagram of a business processing process when the processing end belongs to the second target type according to an embodiment of the present disclosure is schematically shown;

[0034] Figure 8 An example schematic diagram schematically shows a process of processing original business data according to a processing type identifier to obtain target business data according to an embodiment of the present disclosure;

[0035] Fig. 9 An example schematic diagram schematically shows an interactive process of a business processing method according to an embodiment of the present disclosure;

[0036] Fig.10 A block diagram of a service processing device according to an embodiment of the present disclosure is schematically shown;

[0037] Fig.11 A block diagram schematically shows a service processing device according to another embodiment of the present disclosure; and

[0038] Fig.12 A block diagram of an electronic device suitable for implementing a service processing method according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0039] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0040] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0041] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.

[0042] When using expressions such as "at least one of A, B, and C, etc.", they should generally be interpreted according to the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0043] In the embodiments of the present disclosure, the collection, updating, analysis, processing, use, transmission, provision, disclosure, storage, etc. of the data involved (for example, including but not limited to user personal information) are in compliance with the provisions of relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. In particular, necessary measures are taken for user personal information to prevent illegal access to user personal information data and maintain the security of user personal information, network security, and national security.

[0044] In the embodiments of the present disclosure, the user's authorization or consent is obtained before obtaining or collecting the user's personal information.

[0045] For example, after obtaining the original business data, we can use methods including de-identification or anonymization to desensitize your information to protect the security of your information.

[0046] For ad hoc query scenarios, OLAP engines can be used for support. OLAP engines can include at least one of the following: ClickHouse, Presto, Kylin, Doris, Impala, Doris, and StarRocks. The use of the above OLAP engines can include data warehouse-based methods and external table-based methods.

[0047] The data warehouse-based approach can refer to importing offline or real-time data into the OLAP engine through the CDC tool. For example, data can be written into the ClickHouse data warehouse through wide table processing, and ClickHouse can be used to support multi-dimensional analysis. However, since this approach violates the principle of "Single Sourth of Truth", multiple copies of data need to be synchronized.

[0048] The external table-based approach refers to querying multiple data sources such as HDFS, ES, and MYSQL by building external tables, and performing federated queries between multiple data sources. However, due to the large number of partitioned data tables in HDFS data, the query performance is several orders of magnitude lower than that of local tables, resulting in large performance fluctuations.

[0049] In summary, since the performance of online analytical processing cannot be guaranteed at the kernel level and the usage level, the efficiency and stability of business processing are low.

[0050] In order to at least partially solve the technical problems existing in the related art, the present disclosure provides a business processing method and device, an electronic device and a computer-readable storage medium, which can be applied to the fields of computer technology, big data technology, Internet of Things technology and data processing technology. The business processing method includes: in response to receiving a business processing request, according to the pending business identifier indicated by the business processing request, determining the pending business information and processing end information, wherein the pending business information includes M business data identifiers and processing type identifiers corresponding to each of the M business data identifiers, and the processing end information includes P processing end identifiers, and M and P are both positive integers; in response to the processing end corresponding to the processing end identifier allowing the execution of the processing corresponding to the processing type identifier, the business data identifier and the processing type identifier are sent to the processing end corresponding to the processing end identifier, so that the processing end determines the target business data according to the business data identifier; in response to receiving the target business data from the processing end, the target business data is processed to obtain the business processing result.

[0051] Figure 1 The system architecture to which the business processing method according to the embodiment of the present disclosure can be applied is schematically shown. It should be noted that: Figure 1 What is shown is merely an example of a system architecture to which the embodiments of the present disclosure can be applied, in order to help those skilled in the art understand the technical content of the present disclosure, but it does not mean that the embodiments of the present disclosure cannot be used in other devices, systems, environments or scenarios.

[0052] like Figure 1 As shown, the system architecture 100 according to this embodiment may include a first terminal device 101, a second terminal device 102, a third terminal device 103, a network 104 and a server 105. The network 104 is used to provide a medium for a communication link between the first terminal device 101, the second terminal device 102, the third terminal device 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0053] The user may use at least one of the first terminal device 101, the second terminal device 102, and the third terminal device 103 to interact with the server 105 through the network 104 to receive or send messages, etc. Various communication client applications may be installed on the first terminal device 101, the second terminal device 102, and the third terminal device 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0054] The first terminal device 101, the second terminal device 102, and the third terminal device 103 may be various electronic devices having display screens and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

[0055] The server 105 may be a server that provides various services, such as a background management server (only as an example) that provides support for websites browsed by users using the first terminal device 101, the second terminal device 102, and the third terminal device 103. The background management server may analyze and process the received data such as user requests, and feed back the processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

[0056] It should be noted that the service processing method provided in the embodiment of the present disclosure can generally be executed by the server 105. Accordingly, the service processing device provided in the embodiment of the present disclosure can generally be set in the server 105. The service processing method provided in the embodiment of the present disclosure can also be executed by a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105. Accordingly, the service processing device provided in the embodiment of the present disclosure can also be set in a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105.

[0057] Alternatively, the service processing method provided in the embodiment of the present disclosure may also be executed by the first terminal device 101, the second terminal device 102, or the third terminal device 103, or may also be executed by other terminal devices different from the first terminal device 101, the second terminal device 102, or the third terminal device 103. Accordingly, the service processing apparatus provided in the embodiment of the present disclosure may also be arranged in the first terminal device 101, the second terminal device 102, or the third terminal device 103, or may be arranged in other terminal devices different from the first terminal device 101, the second terminal device 102, or the third terminal device 103.

[0058] It should be understood that Figure 1The number of the first terminal device, the second terminal device or the third terminal device, the network and the server in the embodiment is only for illustration. According to the implementation requirements, there may be any number of the first terminal device, the second terminal device or the third terminal device, the network and the server.

[0059] It should be noted that the sequence numbers of the operations in the following method are only used as representations of the operations for the purpose of description, and should not be regarded as representing the execution order of the operations. Unless explicitly stated, the method does not need to be executed completely in the order shown.

[0060] Figure 2 The flowchart of the service processing method according to the embodiment of the present disclosure is schematically shown.

[0061] like Figure 2 As shown, the business processing method 200 includes operations S210 to S230.

[0062] In operation S210, in response to receiving a business processing request, the business information to be processed and the processing end information are determined according to the business identifier to be processed indicated by the business processing request, wherein the business information to be processed includes M business data identifiers and processing type identifiers corresponding to each of the M business data identifiers, and the processing end information includes P processing end identifiers, where M and P are both positive integers.

[0063] In operation S220, in response to the processing end corresponding to the processing end identifier permitting execution of the processing corresponding to the processing type identifier, the business data identifier and the processing type identifier are sent to the processing end corresponding to the processing end identifier so that the processing end determines the target business data according to the business data identifier.

[0064] In operation S230, in response to receiving the target business data from the processing end, the target business data is processed to obtain a business processing result.

[0065] According to an embodiment of the present disclosure, a script for generating a business processing request may be pre-stored in a client. In response to detecting a business processing operation initiated by a user, the client may obtain a pending business identifier input by the user and run the script, so as to generate a business processing request according to the pending business identifier. After obtaining the business processing request, the client may send the business processing request to the server, so that the server may determine the pending business information and the processing end information according to the pending business identifier indicated by the business processing request.

[0066] According to an embodiment of the present disclosure, the server may pre-store U candidate pending business identifiers and V candidate business data identifiers and W candidate processing end identifiers corresponding to each of the U candidate pending business identifiers. U, V and W are all positive integers. After receiving a business processing request, the server may match the pending business identifier indicated by the business processing request with the U candidate pending business identifiers, respectively, so as to determine the target business identifier among the U candidate pending business identifiers. After obtaining the target business identifier, the V candidate business data identifiers corresponding to the target business identifier may be determined as the pending business information, and the W candidate processing end identifiers corresponding to the target business identifier may be determined as the processing end information.

[0067] According to an embodiment of the present disclosure, the service information to be processed may include M service data identifiers and processing type identifiers corresponding to each of the M service data identifiers. The service data identifier may be used to characterize different service data. The processing type identifier may be used to characterize the type of processing operation that needs to be performed on the service data corresponding to the service data identifier.

[0068] According to an embodiment of the present disclosure, the processing end information may include P processing end identifiers and processing range identifiers corresponding to each of the P processing end identifiers. The processing end identifiers may be used to characterize different processing ends. The processing range identifier may be used to characterize the data range that the processing end corresponding to the processing end identifier can process. The processing end identifier may be set according to actual business needs and is not limited here. For example, the processing end identifier may include one of the following: a global (i.e., Global) processing range and a local (i.e., Session) processing range.

[0069] For example, when the processing scope identifier indicates that the processing end corresponding to the processing end identifier belongs to the global processing scope, for each of the M business data identifiers, it can be further determined whether the processing end corresponding to the processing end identifier is permitted to execute the processing operation corresponding to the processing type identifier corresponding to the business data identifier according to the processing end identifier and the processing type identifier. Alternatively, when the processing scope identifier indicates that the processing end corresponding to the processing end identifier belongs to the local processing scope, the service end can locally execute the processing of the business data corresponding to the business data identifier.

[0070] According to an embodiment of the present disclosure, in the case where the processing end corresponding to the processing end identifier permits the execution of the processing operation corresponding to the processing type identifier, the business data identifier and the processing type identifier can be sent to the processing end corresponding to the processing end identifier. After receiving the business data identifier and the processing type identifier from the service end, the processing end can obtain the original business data corresponding to the business data identifier according to the business data identifier, and process the original business data according to the processing type identifier to obtain the target business data. Alternatively, in the case where the processing end corresponding to the processing end identifier prohibits the execution of the processing operation corresponding to the processing type identifier, the service end can perform the processing of the business data corresponding to the business data identifier locally.

[0071] According to an embodiment of the present disclosure, the target business data may include a first number of first target business data determined by the processing end and a second number of second target business data determined by the service end. After obtaining the first number of first target business data from the processing end, the first number of first target business data and the second number of second target business data may be processed according to the association relationship between the M business data identifiers in the business information to be processed, to obtain a business processing result corresponding to the business identifier to be processed.

[0072] According to the embodiments of the present disclosure, since the pending business information and the processing end information are determined according to the pending business identifier indicated by the business processing request, the automatic determination of the relevant business information is realized, which is conducive to improving the efficiency of subsequent business processing. On this basis, when the processing end permits the execution of the processing corresponding to the processing type identifier, by sending the business data identifier and the processing type identifier to the processing end corresponding to the processing end identifier, the processing end determines the target business data according to the business data identifier, and since the business processing result is obtained by processing the target business data, the automatic processing of the business data is realized, thereby at least partially overcoming the technical problem in the related art that the efficiency and stability of business processing are low due to the inability to guarantee the performance of online analytical processing at the kernel level and the usage level, and improving the accuracy of the business processing results.

[0073] Reference below Figure 3 and Figure 4 , the business processing method 200 according to the embodiment of the present invention is further explained.

[0074] According to an embodiment of the present disclosure, the processing end information further includes a processing range identifier corresponding to each of the P processing end identifiers.

[0075] According to an embodiment of the present disclosure, the above-mentioned business processing method 200 may further include the following operations.

[0076] For each of the M business data identifiers, in response to the processing scope identifier corresponding to the business data identifier indicating that the processing end corresponding to the processing end identifier belongs to the global processing scope, the processing end identifier and the processing type identifier are matched to obtain a matching result. If the matching result indicates that the processing end identifier and the processing type identifier match, it is determined that the processing end corresponding to the processing end identifier is permitted to execute the processing corresponding to the processing type identifier. If the matching result indicates that the processing end identifier and the processing type identifier do not match, it is determined that the processing end corresponding to the processing end identifier is prohibited from executing the processing corresponding to the processing type identifier.

[0077] According to an embodiment of the present disclosure, after obtaining a business data identifier, a processing end identifier corresponding to the business data identifier can be determined based on the business data identifier, and on this basis, a processing range identifier corresponding to the processing end identifier can be determined based on the processing end identifier. The processing range identifier can be used to characterize the data range that can be processed by the processing end corresponding to the processing end identifier.

[0078] According to an embodiment of the present disclosure, the processing end identifier may include one of the following: a global (i.e., Global) processing scope and a local (i.e., Session) processing scope. For example, when the processing scope field value corresponding to the processing scope field name is "Session", it can be determined that the processing scope identifier represents that the processing end corresponding to the processing end identifier belongs to the local processing scope. Alternatively, when the processing scope field value corresponding to the processing scope field name is "Global", it can be determined that the processing scope identifier represents that the processing end corresponding to the processing end identifier belongs to the global processing scope.

[0079] According to the embodiments of the present disclosure, whether to perform aggregation and push-down of business data processing is a trade-off issue, which can be dynamically adjusted according to the processing capabilities and configurations of different external engines. For example, in the first type of business scenario, the performance of business data processing using an external engine is better, so the processing scope identifier corresponding to the first type of business scenario can be set to the global processing scope. Alternatively, in the second type of business scenario, the aggregation capability of the external engine is often not as good as pulling the full amount of data to StarRocks and using StarRocks' engine for aggregation performance, so the processing scope identifier corresponding to the second type of business scenario can be set to the local processing scope.

[0080] According to an embodiment of the present disclosure, a key-value relationship between a processing range field name (e.g., "agg_push_down") and a processing range field value may be preset. A business data identifier may have a corresponding processing end identifier, and a processing end identifier may have a corresponding processing range identifier. A user may enable or disable the option by setting corresponding processing range field values ​​for different business data identifiers, thereby dynamically adjusting whether to enable optimization in a local or global scope.

[0081] According to an embodiment of the present disclosure, the server may pre-store X candidate processing terminal identifiers and Y candidate processing type identifiers corresponding to each of the X candidate processing terminal identifiers. When the processing scope identifier indicates that the processing terminal corresponding to the processing terminal identifier belongs to the global processing scope, the processing terminal identifier may be matched with the X candidate processing terminal identifiers to obtain the target processing terminal identifier. On this basis, the processing type identifier may be matched with the Y candidate processing type identifiers corresponding to the target processing terminal identifier to obtain a matching result. The matching result may be used to indicate whether the processing terminal identifier and the processing type identifier match.

[0082] According to an embodiment of the present disclosure, in response to the processing scope identifier corresponding to the business data identifier representing that the processing end corresponding to the processing end identifier belongs to the global processing scope, matching the processing end identifier and the processing type identifier to obtain a matching result may include the following operations.

[0083] According to the processing end identifier, the Q candidate processing end identifiers are matched respectively to obtain the target processing end identifier. According to the processing type identifier, the S predetermined processing type identifiers corresponding to the target processing end identifier are matched respectively to obtain the processing type matching result. In the case where the processing type matching result indicates that there is a predetermined processing type identifier that matches the processing type identifier among the S predetermined processing type identifiers, a matching result indicating that the processing end identifier and the processing type identifier match is determined. In the case where the processing type matching result indicates that there is no predetermined processing type identifier that matches the processing type identifier among the S predetermined processing type identifiers, a matching result indicating that the processing end identifier and the processing type identifier do not match is determined.

[0084] According to an embodiment of the present disclosure, both Q and S may be positive integers.

[0085] According to an embodiment of the present disclosure, after obtaining the target processing end identifier, the processing type identifier and the S predetermined type identifiers corresponding to the target processing end identifier can be matched respectively to obtain a processing type matching result. The processing type matching result can be used to indicate whether the processing end identifier matches the processing type identifier.

[0086] For example, when the processing type matching result indicates that there is a predetermined processing type identifier that matches the processing type identifier among the S predetermined processing type identifiers, a matching result indicating that the processing end identifier and the processing type identifier match can be determined. On this basis, it can be determined that the processing end corresponding to the processing end identifier is permitted to execute the processing corresponding to the processing type identifier.

[0087] Alternatively, when the processing type matching result indicates that there is no predetermined processing type identifier matching the processing type identifier among the S predetermined processing type identifiers, a matching result indicating that the processing end identifier and the processing type identifier do not match can be determined. On this basis, it can be determined that the processing end corresponding to the processing end identifier is prohibited from executing the processing corresponding to the processing type identifier.

[0088] According to an embodiment of the present disclosure, the above-mentioned business processing method 200 may further include the following operations.

[0089] In response to the processing range identifier corresponding to the business data identifier indicating that the processing end corresponding to the processing end identifier belongs to the local processing range, the initial business data is obtained according to the business data identifier. According to the processing type identifier corresponding to the business data identifier, the initial business data is processed to obtain the second target business data corresponding to the business data identifier.

[0090] According to an embodiment of the present disclosure, when the processing scope identifier corresponding to the business data identifier indicates that the processing end corresponding to the processing end identifier belongs to the local processing scope, the processing operation of the business data can be performed locally. For example, the full amount of initial business data corresponding to the business data identifier can be obtained according to the business data identifier. On this basis, the initial business data can be processed locally by the server according to the processing type identifier to obtain the second target business data corresponding to the business data identifier.

[0091] According to the embodiments of the present disclosure, since the business processing method is applicable after the optimizer stage of the native engine execution plan, this optimization scheme is optimized for scenarios that hit the specified processing range, and other scenarios that do not hit the processing range fall back to the native execution plan. Therefore, the business processing method provided by the present disclosure is equivalent to a pluggable enhancement, which can support users to push down according to different external source configurations, thereby improving the flexibility of business processing and achieving a balance between stability and performance.

[0092] Figure 3 An example schematic diagram of a business processing process according to an embodiment of the present disclosure is schematically shown.

[0093] like Figure 3As shown, in 300, the business data identifier 301 may have a corresponding processing scope identifier 302. After the processing scope identifier 302 is obtained, operation S310 may be performed.

[0094] In operation S310, it is determined whether the processing scope identifier indicates that the processing end corresponding to the processing end identifier belongs to the global processing scope.

[0095] If not, the initial business data 303 can be obtained according to the business data identifier 301. The initial business data 303 is processed according to the processing type identifier corresponding to the business data identifier 301 to obtain the second target business data 304 corresponding to the business data identifier 301.

[0096] If yes, the Q candidate processing end identifiers can be matched according to the processing end identifier to obtain the target processing end identifier 305. According to the processing type identifier, the S predetermined processing type identifiers corresponding to the target processing end identifier 305 are matched to obtain the processing type matching result 306. After obtaining the processing type matching result 306, operation S320 can be performed.

[0097] In operation S320, it is determined whether the matching result indicates that the processing end identifier and the processing type identifier match.

[0098] If not, a matching result indicating that the processing end identifier and the processing type identifier do not match can be determined, and it can be determined that the processing end corresponding to the processing end identifier is prohibited from executing the processing corresponding to the processing type identifier 307 .

[0099] If so, a matching result indicating that the processing end identifier and the processing type identifier match can be determined, and the processing end corresponding to the processing end identifier can be determined to be permitted to execute the processing corresponding to the processing type identifier 308. On this basis, the processing end can process the business data corresponding to the business data identifier to obtain the first target business data 309.

[0100] According to an embodiment of the present disclosure, when the candidate processing end identifier represents that the processing end belongs to the first target type, the predetermined processing type identifier corresponding to the candidate processing end identifier includes at least one of the following: counting type, association type, grouping type and extreme value type.

[0101] According to an embodiment of the present disclosure, when the candidate processing end identifier represents that the processing end belongs to the second target type, the predetermined processing type identifier corresponding to the candidate processing end identifier includes at least one of the following: counting type, summation type, mean type, association type, sorting type, grouping type and extreme value type.

[0102] According to an embodiment of the present disclosure, the processing type identifier can be set according to actual business needs and is not limited here. For example, the processing type identifier may include at least one of the following: filtering type (i.e. Where), aggregation type, association type (i.e. Join), grouping type (i.e. Group By) and sorting type (i.e. TopN). The aggregation type may include at least one of the following: counting type (i.e. Count), summation type (i.e. Sum), mean type (i.e. Avg) and extreme value type. The extreme value type may include at least one of the following: maximum value type (i.e. Max) and minimum value type (i.e. Min).

[0103] According to an embodiment of the present disclosure, the candidate processing end corresponding to the candidate processing end identifier may belong to a target type. For example, the candidate processing end may belong to a first target type, and the first target type may be set to an ElasticSearch type. On this basis, the candidate processing end belonging to the ElasticSearch type may support push-down operations of operators such as counting type, association type, grouping type, and extreme value type.

[0104] Alternatively, the candidate processing end may belong to the second target type, and the second target type may be set to the MySQL type. On this basis, the candidate processing end belonging to the MySQL type may support push-down operations of operators such as count type, sum type, mean type, association type, sort type, grouping type, and extreme value type.

[0105] According to an embodiment of the present disclosure, the business information to be processed also includes the association relationship between M business data identifiers, and the target business data includes first target business data determined by the processing end and second target business data determined by the service end.

[0106] According to an embodiment of the present disclosure, operation S230 may include the following operations.

[0107] In response to receiving a first number of first target business data from a processing end, a second number of second target business data and a first number of first target business data are processed according to an association relationship to obtain a business processing result.

[0108] According to an embodiment of the present disclosure, the sum of the first number and the second number may be equal to M.

[0109] According to an embodiment of the present disclosure, the first target business data may refer to data obtained by the processing end by processing the business data corresponding to the business data identifier. The second target business data may refer to data obtained by the service end by processing the business data corresponding to the business data identifier.

[0110] According to an embodiment of the present disclosure, the business processing process is explained by taking M as 10 (i.e., the business information to be processed includes 10 business data identifiers), the first number is 7 (i.e., 7 first target business data are received from the processing end), and the second number is 3 (i.e., 3 second target business data are processed by the server end) as an example.

[0111] For example, when the processing scope identifier indicates that the processing end corresponding to the processing end identifier belongs to the global processing scope, or the processing end corresponding to the processing end identifier is permitted to execute the processing corresponding to the processing type identifier, the processing end can perform business data processing operations externally to obtain 7 first target business data.

[0112] Alternatively, when the processing scope identifier indicates that the processing end corresponding to the processing end identifier belongs to a local processing scope, or the processing end corresponding to the processing end identifier is prohibited from executing the processing corresponding to the processing type identifier, the server can perform the business data processing operation locally to obtain three second target business data.

[0113] According to an embodiment of the present disclosure, after obtaining 7 first target business data and 3 second target business data, the 7 first target business data and 3 second target business data can be processed according to the association relationship between the 10 business data identifiers to obtain a business processing result.

[0114] According to the embodiments of the present disclosure, by optimizing the query plan, the aggregation functions and predicates are pushed down to the external data source, so that the aggregation operation can be completed in the external data source, and the data obtained from the external engine is changed from the original data to the aggregation result, thereby reducing the number of data scans, thereby reducing the pressure of the query engine on the external data source in the big data scenario, being able to squeeze the performance of the external engine, improving the stability of the engine itself, improving the query efficiency, and thus improving the data query performance.

[0115] Figure 4 An example schematic diagram of a business processing process according to another embodiment of the present disclosure is schematically shown.

[0116] like Figure 4 As shown, in 400, in response to receiving a business processing request 401, to-be-processed business information 402 and processing end information 403 can be determined according to the to-be-processed business identifier 401_1 indicated by the business processing request 401. The to-be-processed business information 402 includes M business data identifiers 402_1 and processing type identifiers 402_2 corresponding to each of the M business data identifiers 402_1. The processing end information 403 includes P processing end identifiers 403_1 and processing range identifiers 403_2 corresponding to each of the P processing end identifiers 403_1.

[0117] In response to the processing scope identifier 403_1 corresponding to the business data identifier 402_1 indicating that the processing end corresponding to the processing end identifier 403_2 belongs to the global processing scope, the processing end identifier 403_2 and the processing type identifier 402_2 are matched to obtain a matching result. When the matching result indicates that the processing end identifier 403_2 and the processing type identifier 402_2 match, it is determined that the processing end corresponding to the processing end identifier 403_2 is allowed to execute the processing corresponding to the processing type identifier 402_2.

[0118] In response to the processing end corresponding to the processing end identifier 403_1 allowing execution of the processing corresponding to the processing type identifier 402_2, the business data identifier 402_1 and the processing type identifier 402_2 are sent to the processing end corresponding to the processing end identifier 403_2, so that the processing end determines the first target business data 405 according to the business data identifier 402_1.

[0119] In response to receiving the first number of first target business data 405 from the processing end, the second number of second target business data 406 and the first number of first target business data 405 may be processed according to the association relationship 407 to obtain a business processing result 408 .

[0120] The above are merely exemplary embodiments, but are not limited thereto, and may also include other business processing methods known in the art, as long as they can improve the efficiency and accuracy of business processing.

[0121] Figure 5 The flowchart of a service processing method according to another embodiment of the present disclosure is schematically shown.

[0122] like Figure 5 As shown, the business processing method 500 includes operations S510 to S530.

[0123] In operation S510, in response to receiving the service data identifier and the processing type identifier from the server, original service data is acquired according to the service data identifier.

[0124] In operation S520, the original business data is processed according to the processing type identifier to obtain target business data.

[0125] In operation S530, the target business data is sent to the server, so that the server determines the business processing result according to the target business data.

[0126] According to the embodiments of the present disclosure, for the description of the business data identifier, the processing type identifier, the target business data and the business processing result, please refer to the relevant content above, which will not be repeated here.

[0127] According to an embodiment of the present disclosure, the processing end may pre-store at least one candidate business data identifier and candidate business data corresponding to each of the at least one candidate business data identifier. After obtaining the business data identifier and the processing type identifier, the business data identifier may be matched with the at least one candidate business data identifier to obtain the target business data identifier. After obtaining the target business data identifier, the candidate business data corresponding to the target business data identifier may be determined as the original business data corresponding to the business data identifier.

[0128] According to an embodiment of the present disclosure, after obtaining the original business data, the original business data can be parsed and processed to obtain the original data structure. On this basis, the original data structure can be processed according to the processing type identifier to obtain the target business data. After obtaining the target business data, the target business data can be sent to the server, so that the server can process the first number of first target business data and the second number of second target business data according to the association relationship between the business data identifiers to obtain the business processing result corresponding to the business identifier to be processed.

[0129] According to the embodiments of the present disclosure, since the original business data is obtained according to the business data identifier from the server, the automatic determination of the relevant business data is achieved, which is conducive to improving the efficiency of subsequent business processing. On this basis, since the business processing result is determined by the server in response to the target business data received from the processing end, the target business data is obtained by the processing end by processing the original business data according to the processing type identifier, and by pushing the business data processing process down to the corresponding processing end, the processing of business data on the server is avoided, thereby improving the efficiency of the business processing process and the accuracy of the business processing results.

[0130] Reference below Figure 6 to Figure 9 , the business processing method 500 according to the embodiment of the present invention is further explained.

[0131] According to an embodiment of the present disclosure, operation S520 may include the following operations.

[0132] The original business data is parsed to obtain an original data structure, wherein the original data structure includes P original data nodes and associations between the P original data nodes, where P is a positive integer. According to the processing type identifier and the associations between the P original data nodes, the P original data nodes are processed to obtain target business data.

[0133] According to the embodiments of the present disclosure, the specific method of parsing the original business data can be set according to the actual business needs, which is not limited here. For example, the parsing processing method may include at least one of the following: lexical analysis processing and grammatical analysis processing. For example, the original business data can be subjected to lexical analysis processing to obtain the original data structure. Alternatively, the original business data can be subjected to grammatical analysis processing to obtain the original data structure. Alternatively, the original business data can be subjected to lexical analysis processing and grammatical analysis processing to obtain the original data structure.

[0134] According to an embodiment of the present disclosure, after the original data structure is obtained, the P original data nodes in the original data structure may be processed according to a processing type identifier corresponding to the business data identifier to obtain target business data.

[0135] Figure 6 An example schematic diagram of a business processing process when the processing end belongs to the first target type according to an embodiment of the present disclosure is schematically shown.

[0136] like Figure 6 As shown, in 600, by merging the scan nodes, projection nodes and aggregation nodes corresponding to different parts (i.e., PlanFragment) in the query execution plan, and pushing all the operations of this part to the external ES engine for processing, the overall aggregation query operation is pushed down to the external data source.

[0137] Aggregate scan operator 640 can be used to perform aggregation operations on data in the ES index. Aggregate scan operator 640 can send queries to the ES cluster and use the specified aggregation method to summarize and count the retrieved data.

[0138] Taking the aggregate scan operation process 610 as an example, the scan (i.e., PHYSICAL_ES_SCAN) node 611 can scan and obtain the original data in the external data source. After obtaining the original data, the local hash aggregation (i.e., PhysicalHashAggregate type LOCAL) node 612 can be used to perform data grouping and aggregation operations on a single node. The data distribution (i.e., PHYSICAL_DISTRIBUTION) node 613 is used to distribute the data to the correct target node according to the requirements of the query plan. The global hash aggregation (i.e., PhysicalHashAggregatetype GLOBAL) node 614 is used to distribute the data to different nodes for local aggregation, and then the results of the local aggregation are summarized again on one node for global aggregation operations.

[0139] Taking the aggregate scan operation process 620 as an example, the scan (i.e., PHYSICAL_ES_SCAN) node 621 can scan and obtain the original data in the external data source. After obtaining the original data, the local hash aggregation (i.e., PhysicalHashAggregate type LOCAL) node 622 can be used to perform data grouping and aggregation operations on a single node. The data distribution (i.e., PHYSICAL_DISTRIBUTION) node 623 is used to distribute the data to the correct target node according to the requirements of the query plan. The global deduplication hash aggregation (i.e., PhysicalHashAggregate type DISTINCT_GLOBAL) node 624 is used to perform global deduplication operations. The global hash aggregation (i.e., PhysicalHashAggregatetypeGLOBAL) node 625 is used to distribute the data to different nodes for local aggregation, and then the results of the local aggregation are summarized again on one node for global aggregation operations.

[0140] Taking the aggregate scan operation process 630 as an example, the scan (i.e., PHYSICAL_ES_SCAN) node 631 can scan and obtain the original data in the external data source. After obtaining the original data, the local hash aggregation (i.e., PhysicalHashAggregate type LOCAL) node 632 can be used to perform data grouping and aggregation operations on a single node. The data distribution (i.e., PHYSICAL DISTRIBUTION) node 633 is used to distribute the data to the correct target node according to the requirements of the query plan. The global deduplication hash aggregation (i.e., PhysicalHashAggregate type DISTINCT_GLOBAL) node 634 is used to perform global deduplication operations. The local deduplication hash aggregation (i.e., PhysicalHashAggregatetypeDISTINCT_LOCAL) node 635 is used to perform local deduplication operations. The data distribution (i.e., PHYSICAL_DISTRIBUTION) node 636 is used to distribute the data to the correct target node according to the requirements of the query plan. The global hash aggregation (ie PhysicalHashAggregate type GLOBAL) node 637 is used to distribute the data to different nodes for local aggregation, and then the results of the local aggregation are aggregated again to one node for global aggregation operation.

[0141] Alternatively, for example, in the process of performing join and then projection on two count type (i.e., count(distinct)) queries, in order to avoid result distortion in the aggregation push-down scenario, it is possible to determine whether it is necessary to insert a data distribution (i.e., PHYSICAL_DISTRIBUTION) operator by identifying whether the OptExpression type of the top-level operator Parent of the matching rule is PHYSICAL_HASH_JOIN.

[0142] Figure 7 An example schematic diagram of a business processing process when the processing end belongs to the second target type according to an embodiment of the present disclosure is schematically shown.

[0143] like Figure 7 As shown, in 700, the aggregate scan operator 730 can be used to perform an aggregate operation on the data in the MYSQL index. The aggregate scan operator 730 can send a query to the MYSQL cluster and use a specified aggregation method to summarize and count the retrieved data.

[0144] Taking the aggregate scan operation process 710 as an example, the scan (i.e., PHYSICAL_MYSQL_SCAN) node 711 can scan the external data source to obtain the original data. After obtaining the original data, the global hash aggregation (i.e., PhysicalHashAggregate type GLOBAL) node 712 can be used to distribute the data to different nodes for local aggregation, and then the results of the local aggregation are aggregated again to one node for global aggregation operation.

[0145] Taking the aggregate scan operation process 720 as an example, the scan (i.e., PHYSICAL_MYSQL_SCAN) node 721 can scan and obtain the original data in the external data source. After obtaining the original data, the global hash aggregation (i.e., PhysicalHashAggregate type GLOBAL) node 722 can be used to distribute the data to different nodes for local aggregation, and then the results of the local aggregation are aggregated to one node again for global aggregation operation. The sorting (i.e., PHYSICAL_TOPN) node 723 is used to apply the TOPN operation to the query result set, that is, to select the first N records that meet the conditions. On this basis, the sorting (i.e., PHYSICAL_TOPN) node 724 can be used to apply the TOPN operation to the query result set again, that is, to select the first N records that meet the conditions.

[0146] According to an embodiment of the present disclosure, the original data nodes include a third number of original parent data nodes and a fourth number of original child data nodes corresponding to each of the third number of original parent data nodes.

[0147] According to an embodiment of the present disclosure, according to the association relationship between the processing type identifier and the P original data nodes, processing the P original data nodes to obtain the target business data may include the following operations.

[0148] For each original parent data node among the third number of original parent data nodes, in response to the node type of the original parent data node being the target node type, Q child node sets are determined among the fourth number of original child data nodes corresponding to the original parent data node, wherein the child node sets include at least two original child data nodes having the same node type, and Q is a positive integer.

[0149] For each of the Q subnode sets, at least two original sub-data nodes corresponding to the subnode set are merged to obtain a target sub-node corresponding to the subnode set. Target business data is determined based on the association relationship between the P original data nodes and the target sub-nodes corresponding to each of the Q subnode sets.

[0150] According to the embodiments of the present disclosure, the transformation of StarRocks aggregation push-down can be focused on the stage after the Optimizer stage and before the PhysicalPlan is generated. For example, starting from the ScanNode node, based on the heuristic rules, the bottom-up pattern is matched step by step to merge some nodes that hit the pattern and generate a new custom node.

[0151] According to an embodiment of the present disclosure, for each original parent data node in the third number of original parent data nodes, it can be determined whether the original parent data node is of the target node type. In the case where it is determined that the original parent data node is of the target node type, at least one child node set can be determined. The child node set can include at least two original child data nodes of the same node type.

[0152] According to an embodiment of the present disclosure, for each subnode set in at least one subnode set, at least two original sub-data nodes in the subnode set may be merged to obtain a target subnode corresponding to the subnode set. On this basis, the target business data may be determined based on the association relationship between the P original data nodes and the target subnodes corresponding to each of the Q subnode sets.

[0153] According to an embodiment of the present disclosure, by providing an optimization solution for the OLAP engine in the lake-warehouse integrated federated query process, that is, conditional push-down of some aggregate functions, the number of data scans is reduced, thereby improving the efficiency and accuracy of subsequent business processing.

[0154] Figure 8An example schematic diagram of a process of processing original business data according to a processing type identifier to obtain target business data according to an embodiment of the present disclosure is schematically shown.

[0155] like Figure 8 As shown, in 800, after obtaining the original business data 801, the original business data 801 can be parsed to obtain an original data structure 802. The original data structure 802 can include P original data nodes 802_1 and association relationships 802_2 between the P original data nodes 802_1. The P original data nodes 802_1 can include a third number of original parent data nodes 803 and a fourth number of original child data nodes corresponding to the third number of original parent data nodes 803, respectively.

[0156] Operation S810 may be performed for each original parent data node 803 of the third number of original parent data nodes 803. In operation S810, it is determined whether the node type of the original parent data node is the target node type.

[0157] If so, Q child node sets 804 can be determined from the fourth number of original child data nodes corresponding to the original parent data node 803. The child node set 804 can include at least two original child data nodes 804_1 having the same node type. For each child node set 804 in the Q child node sets 804, at least two original child data nodes 804_1 corresponding to the child node set 804 can be merged to obtain a target child node 805 corresponding to the child node set. On this basis, the target business data 806 can be determined based on the association relationship 802_2 between the P original data nodes and the target child nodes 805 corresponding to each of the Q child node sets 804. If not, the processing flow can be terminated.

[0158] Fig. 9 An example schematic diagram schematically illustrates the interaction process of the business processing method according to an embodiment of the present disclosure.

[0159] like Fig. 9 As shown, in 900, the interaction process of the business processing method applied between the server and the processor may include operations S901 to S909.

[0160] In operation S901, in response to receiving a service processing request, the server may determine information about the service to be processed and information about the processing end according to an identifier of the service to be processed indicated in the service processing request.

[0161] In operation S902, in response to the processing scope identifier corresponding to the business data identifier indicating that the processing end corresponding to the processing end identifier belongs to the global processing scope, the server may match the processing end identifier with the processing type identifier to obtain a matching result.

[0162] In operation S903, when the matching result indicates that the processing end identifier and the processing type identifier match, the server may determine that the processing end corresponding to the processing end identifier is permitted to execute the processing corresponding to the processing type identifier.

[0163] In operation S904, in response to the processor corresponding to the processor identifier permitting execution of the process corresponding to the process type identifier, the server may send the service data identifier and the process type identifier to the processor corresponding to the processor identifier.

[0164] In operation S905, in response to receiving the service data identifier and the processing type identifier from the service end, the processing end may obtain the original service data according to the service data identifier.

[0165] In operation S906, the processing end may parse the original business data to obtain an original data structure.

[0166] In operation S907, the processing end may process the P original data nodes according to the association relationship between the processing type identifier and the P original data nodes to obtain target business data.

[0167] In operation S908, the processing end may send the target service data to the service end.

[0168] In operation S909 , in response to receiving the target service data from the processing end, the service end may process the target service data to obtain a service processing result.

[0169] The above are merely exemplary embodiments, but are not limited thereto, and may also include other business processing methods known in the art, as long as they can improve the efficiency and accuracy of business processing.

[0170] Fig.10 A block diagram of a service processing device according to an embodiment of the present disclosure is schematically shown.

[0171] like Fig.10 As shown, the service processing device 1000 may include a first determining module 1010 , a first sending module 1020 and a first processing module 1030 .

[0172] The first determination module 1010 is used to determine the pending business information and processing end information in response to receiving a business processing request and according to the pending business identifier indicated by the business processing request, wherein the pending business information includes M business data identifiers and processing type identifiers corresponding to each of the M business data identifiers, and the processing end information includes P processing end identifiers, and M and P are both positive integers.

[0173] The first sending module 1020 is used to send the business data identifier and the processing type identifier to the processing end corresponding to the processing end identifier in response to the processing end corresponding to the processing end identifier allowing the processing corresponding to the processing type identifier to be executed, so that the processing end can determine the target business data according to the business data identifier.

[0174] The first processing module 1030 is used to process the target business data in response to receiving the target business data from the processing end to obtain a business processing result.

[0175] According to an embodiment of the present disclosure, the processing end information further includes a processing range identifier corresponding to each of the P processing end identifiers.

[0176] According to an embodiment of the present disclosure, the service processing apparatus 1000 may further include a matching module, a second determining module and a third determining module.

[0177] The matching module is used to match the processing end identifier and the processing type identifier for each of the M business data identifiers, in response to the processing scope identifier corresponding to the business data identifier representing that the processing end corresponding to the processing end identifier belongs to the global processing scope, to obtain a matching result.

[0178] The second determination module is used to determine that the processing end corresponding to the processing end identifier is allowed to execute the processing corresponding to the processing type identifier when the matching result indicates that the processing end identifier and the processing type identifier match.

[0179] The third determination module is used to determine that the processing end corresponding to the processing end identifier is prohibited from executing the processing corresponding to the processing type identifier when the matching result indicates that the processing end identifier and the processing type identifier do not match.

[0180] According to an embodiment of the present disclosure, the matching module may include a first matching unit, a second matching unit, a first determining unit, and a second determining unit.

[0181] The first matching unit is used to match the Q candidate processing end identifiers respectively according to the processing end identifier to obtain the target processing end identifier.

[0182] The second matching unit is used to match S predetermined processing type identifiers corresponding to the target processing end identifier respectively according to the processing type identifier to obtain a processing type matching result.

[0183] The first determining unit is used to determine a matching result indicating that the processing end identifier matches the processing type identifier when the processing type matching result indicates that there is a predetermined processing type identifier matching the processing type identifier among the S predetermined processing type identifiers.

[0184] The second determining unit is configured to determine a matching result indicating that the processing end identifier and the processing type identifier do not match when the processing type matching result indicates that there is no predetermined processing type identifier matching the processing type identifier among the S predetermined processing type identifiers.

[0185] According to an embodiment of the present disclosure, Q and S are both positive integers.

[0186] According to an embodiment of the present disclosure, when the candidate processing end identifier represents that the processing end belongs to the first target type, the predetermined processing type identifier corresponding to the candidate processing end identifier includes at least one of the following: counting type, association type, grouping type and extreme value type.

[0187] According to an embodiment of the present disclosure, when the candidate processing end identifier represents that the processing end belongs to the second target type, the predetermined processing type identifier corresponding to the candidate processing end identifier includes at least one of the following: counting type, summation type, mean type, association type, sorting type, grouping type and extreme value type.

[0188] According to an embodiment of the present disclosure, the service processing apparatus 1000 may further include a second acquisition module and a third processing module.

[0189] The second acquisition module is used to acquire initial business data according to the business data identifier in response to the processing range identifier corresponding to the business data identifier indicating that the processing end corresponding to the processing end identifier belongs to the local processing range.

[0190] The third processing module is used to process the initial business data according to the processing type identifier corresponding to the business data identifier to obtain second target business data corresponding to the business data identifier.

[0191] According to an embodiment of the present disclosure, the business information to be processed also includes associations between M business data identifiers, and the target business data includes first target business data determined by the processing end and second target business data determined by the service end.

[0192] According to an embodiment of the present disclosure, the first processing module 1030 may include a first processing unit.

[0193] The first processing unit is used for processing the second number of second target business data and the first number of first target business data according to the association relationship in response to receiving the first number of first target business data from the processing end to obtain a business processing result.

[0194] According to an embodiment of the present disclosure, the sum of the first number and the second number is equal to M.

[0195] Fig.11 A block diagram of a service processing device according to another embodiment of the present disclosure is schematically shown.

[0196] like Fig.11 As shown, the service processing device 1100 may include a first acquisition module 1110 , a second processing module 1120 , and a second sending module 1130 .

[0197] The first acquisition module 1110 is used to obtain original business data according to the business data identifier in response to receiving the business data identifier and the processing type identifier from the server.

[0198] The second processing module 1120 is used to process the original business data according to the processing type identifier to obtain target business data.

[0199] The second sending module 1130 is used to send the target business data to the server, so that the server can determine the business processing result according to the target business data.

[0200] According to an embodiment of the present disclosure, the second processing module 1120 may include a second processing unit and a third processing unit.

[0201] The second processing unit is used to parse and process the original business data to obtain an original data structure, wherein the original data structure includes P original data nodes and association relationships between the P original data nodes, and P is a positive integer.

[0202] The third processing unit is used to process the P original data nodes according to the processing type identifier and the association relationship between the P original data nodes to obtain target business data.

[0203] According to an embodiment of the present disclosure, the original data nodes include a third number of original parent data nodes and a fourth number of original child data nodes corresponding to each of the third number of original parent data nodes.

[0204] According to an embodiment of the present disclosure, the third processing unit may include a first determining subunit, a processing subunit, and a second determining subunit.

[0205] The first determination sub-unit is used to determine, for each original parent data node among the third number of original parent data nodes, in response to the node type of the original parent data node being the target node type, Q child node sets from the fourth number of original child data nodes corresponding to the original parent data node, wherein the child node set includes at least two original child data nodes with the same node type, and Q is a positive integer.

[0206] The processing subunit is used to merge at least two original child data nodes corresponding to each child node set in the Q child node sets to obtain a target child node corresponding to the child node set.

[0207] The second determination subunit is used to determine the target business data according to the association relationship between the P original data nodes and the target subnodes corresponding to each of the Q subnode sets.

[0208] According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits, or at least part of the functions of any one of them can be implemented in one module. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be split into multiple modules for implementation. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be at least partially implemented as hardware circuits, such as field programmable gate arrays (FPGAs), programmable logic arrays (PLAs), systems on chips, systems on substrates, systems on packages, application specific integrated circuits (ASICs), or can be implemented by hardware or firmware in any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in any appropriate combination of any of them. Alternatively, according to the embodiments of the present invention, one or more of the modules, submodules, units, and subunits can be at least partially implemented as computer program modules, and when the computer program modules are run, the corresponding functions can be performed.

[0209] For example, any multiple of the first determination module 1010, the first sending module 1020, and the first processing module 1030 can be combined in one module / unit / subunit for implementation, or any one of the modules / units / subunits can be split into multiple modules / units / subunits. Alternatively, at least part of the functions of one or more modules / units / subunits in these modules / units / subunits can be combined with at least part of the functions of other modules / units / subunits and implemented in one module / unit / subunit. According to an embodiment of the present disclosure, at least one of the first determination module 1010, the first sending module 1020, and the first processing module 1030 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or by any one of the three implementation methods of software, hardware, and firmware, or by a suitable combination of any of them. Alternatively, at least one of the first determining module 1010 , the first sending module 1020 , and the first processing module 1030 may be at least partially implemented as a computer program module, and when the computer program module is executed, a corresponding function may be performed.

[0210] For example, any multiple of the first acquisition module 1110, the second processing module 1120, and the second sending module 1130 can be combined in one module / unit / sub-unit for implementation, or any one of the modules / units / sub-units can be split into multiple modules / units / sub-units. Alternatively, at least part of the functions of one or more of these modules / units / sub-units can be combined with at least part of the functions of other modules / units / sub-units and implemented in one module / unit / sub-unit. According to an embodiment of the present disclosure, at least one of the first acquisition module 1110, the second processing module 1120, and the second sending module 1130 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware or in a suitable combination of any of them. Alternatively, at least one of the first acquisition module 1110 , the second processing module 1120 , and the second sending module 1130 may be at least partially implemented as a computer program module, and when the computer program module is executed, a corresponding function may be executed.

[0211] It should be noted that the business processing device part in the embodiment of the present disclosure corresponds to the business processing method part in the embodiment of the present disclosure. The description of the business processing device part specifically refers to the business processing method part and will not be repeated here.

[0212] Fig.12 A block diagram of an electronic device suitable for implementing a service processing method according to an embodiment of the present disclosure is schematically shown. Fig.12 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0213] like Fig.12 As shown, the computer electronic device 1200 according to the embodiment of the present disclosure includes a processor 1201, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 1202 or the program loaded from the storage part 1209 to the random access memory (RAM) 1203. The processor 1201 may include, for example, a general-purpose microprocessor (such as a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (for example, an application-specific integrated circuit (ASIC)), etc. The processor 1201 may also include an onboard memory for caching purposes. The processor 1201 may include a single processing unit or multiple processing units for performing different actions of the method flow according to the embodiment of the present disclosure.

[0214] In RAM 1203, various programs and data required for the operation of electronic device 1200 are stored. Processor 1201, ROM 1202 and RAM 1203 are connected to each other via bus 1204. Processor 1201 performs various operations of the method flow according to the embodiment of the present disclosure by executing the program in ROM 1202 and / or RAM 1203. It should be noted that the program can also be stored in one or more memories other than ROM 1202 and RAM 1203. Processor 1201 can also perform various operations of the method flow according to the embodiment of the present disclosure by executing the program stored in the one or more memories.

[0215] According to an embodiment of the present disclosure, the electronic device 1200 may further include an input / output (I / O) interface 1205, which is also connected to the bus 1204. The electronic device 1200 may further include one or more of the following components connected to the input / output (I / O) interface 1205: an input portion 1206 including a keyboard, a mouse, etc.; an output portion 1207 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage portion 1208 including a hard disk, etc.; and a communication portion 1209 including a network interface card such as a LAN card, a modem, etc. The communication portion 1209 performs communication processing via a network such as the Internet. A drive 1210 is also connected to the input / output (I / O) interface 1205 as needed. A removable medium 1211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 1210 as needed, so that a computer program read therefrom is installed into the storage portion 1208 as needed.

[0216] According to an embodiment of the present disclosure, the method flow according to an embodiment of the present disclosure can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable storage medium, and the computer program contains a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 1209, and / or installed from the removable medium 1211. When the computer program is executed by the processor 1201, the above-mentioned functions defined in the system of the embodiment of the present disclosure are executed. According to an embodiment of the present disclosure, the system, equipment, device, module, unit, etc. described above can be implemented by a computer program module.

[0217] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.

[0218] According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. For example, it may include, but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, apparatus, or device.

[0219] For example, according to an embodiment of the present disclosure, the computer-readable storage medium may include the ROM 1202 and / or the RAM 1203 described above and / or one or more memories other than the ROM 1202 and the RAM 1203 .

[0220] The embodiments of the present disclosure also include a computer program product, which includes a computer program, which contains program code for executing the method provided by the embodiments of the present disclosure. When the computer program product runs on an electronic device, the program code is used to enable the electronic device to implement the business processing method provided by the embodiments of the present disclosure.

[0221] When the computer program is executed by the processor 1201, the above functions defined in the system / device of the embodiment of the present disclosure are executed. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0222] In one embodiment, the computer program may rely on tangible storage media such as optical storage devices, magnetic storage devices, etc. In another embodiment, the computer program may also be transmitted and distributed in the form of signals on a network medium, and downloaded and installed through the communication part 1209, and / or installed from the removable medium 1211. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0223] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computing programs can be implemented using high-level process and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, Java, C++, python, "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on the remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect through the Internet).

[0224] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram may represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box may also occur in an order different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of boxes in the block diagram or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions. It can be understood by those skilled in the art that the features recorded in the various embodiments and / or claims of the present disclosure can be combined and / or combined in a variety of ways, even if such a combination or combination is not explicitly recorded in the present disclosure. In particular, without departing from the spirit and teaching of the present disclosure, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways. All of these combinations and / or combinations fall within the scope of the present disclosure.

[0225] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the attached claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. A business processing method, applied to a server, comprising: In response to receiving a service processing request, determining to-be-processed service information and processing end information according to the to-be-processed service identifier indicated by the service processing request, wherein the to-be-processed service information includes M service data identifiers and processing type identifiers corresponding to each of the M service data identifiers, and the processing end information includes P processing end identifiers, where M and P are both positive integers; In response to the processing end corresponding to the processing end identifier approving execution of the processing corresponding to the processing type identifier, sending the service data identifier and the processing type identifier to the processing end corresponding to the processing end identifier, so that the processing end determines the target service data according to the service data identifier; and In response to receiving the target service data from the processing end, the target service data is processed to obtain a service processing result.

2. The method according to claim 1, wherein: The processing end information also includes a processing range identifier corresponding to each of the P processing end identifiers; The method further comprises: For each of the M service data identifiers, In response to the processing scope identifier corresponding to the business data identifier indicating that the processing end corresponding to the processing end identifier belongs to a global processing scope, matching the processing end identifier with the processing type identifier to obtain a matching result; If the matching result indicates that the processing end identifier and the processing type identifier match, determining that the processing end corresponding to the processing end identifier is permitted to execute the processing corresponding to the processing type identifier; and When the matching result indicates that the processing end identifier and the processing type identifier do not match, it is determined that the processing end corresponding to the processing end identifier is prohibited from executing the processing corresponding to the processing type identifier.

3. The method according to claim 2, wherein: In response to the processing scope identifier corresponding to the business data identifier indicating that the processing end corresponding to the processing end identifier belongs to the global processing scope, the processing end identifier and the processing type identifier are matched to obtain a matching result, including: According to the processing end identifier, respectively match the Q candidate processing end identifiers to obtain the target processing end identifier; According to the processing type identifier, respectively matching S predetermined processing type identifiers corresponding to the target processing end identifier to obtain a processing type matching result; In a case where the processing type matching result indicates that there is a predetermined processing type identifier that matches the processing type identifier among the S predetermined processing type identifiers, determining the matching result indicating that the processing end identifier and the processing type identifier match; and In a case where the processing type matching result indicates that there is no predetermined processing type identifier matching the processing type identifier among the S predetermined processing type identifiers, determining the matching result indicating that the processing end identifier and the processing type identifier do not match; Wherein, Q and S are both positive integers.

4. The method according to claim 3, wherein: In the case where the candidate processing end identifier represents that the processing end belongs to the first target type, the predetermined processing type identifier corresponding to the candidate processing end identifier includes at least one of the following: a counting type, an association type, a grouping type, and an extreme value type; as well as When the candidate processing end identifier represents that the processing end belongs to the second target type, the predetermined processing type identifier corresponding to the candidate processing end identifier includes at least one of the following: counting type, summation type, mean type, association type, sorting type, grouping type and extreme value type.

5. The method according to claim 2, further comprising: In response to the processing range identifier corresponding to the service data identifier indicating that the processing end corresponding to the processing end identifier belongs to a local processing range, obtaining initial service data according to the service data identifier; as well as The initial service data is processed according to the processing type identifier corresponding to the service data identifier to obtain second target service data corresponding to the service data identifier.

6. The method according to any one of claims 1 to 5, wherein: The to-be-processed service information further includes associations between the M service data identifiers, and the target service data includes first target service data determined by the processing end and second target service data determined by the service end; In response to receiving the target service data from the processing end, processing the target service data to obtain the service processing result includes: In response to receiving the first number of the first target business data from the processing end, processing the second number of the second target business data and the first number of the first target business data according to the association relationship to obtain the business processing result; The sum of the first number and the second number is equal to M.

7. A business processing method, applied to a processing end, comprising: In response to receiving the service data identifier and the processing type identifier from the server, obtaining original service data according to the service data identifier; Processing the original business data according to the processing type identifier to obtain target business data; as well as The target business data is sent to the server, so that the server determines the business processing result according to the target business data.

8. The method according to claim 7, wherein: The processing of the original business data according to the processing type identifier to obtain the target business data includes: Parsing the original business data to obtain an original data structure, wherein the original data structure includes P original data nodes and association relationships between the P original data nodes, where P is a positive integer; and According to the association relationship between the processing type identifier and the P original data nodes, the P original data nodes are processed to obtain the target business data.

9. The method according to claim 8, wherein: The original data nodes include a third number of original parent data nodes and a fourth number of original child data nodes corresponding to each of the third number of original parent data nodes; The processing of the P original data nodes according to the association relationship between the processing type identifier and the P original data nodes to obtain the target business data includes: For each original parent data node in the third number of original parent data nodes, In response to the node type of the original parent data node being the target node type, determining Q child node sets from the fourth number of original child data nodes corresponding to the original parent data node, wherein the child node sets include at least two original child data nodes having the same node type, and Q is a positive integer; For each of the Q child node sets, Merging at least two original child data nodes corresponding to the child node set to obtain a target child node corresponding to the child node set; and The target business data is determined according to the association relationship between the P original data nodes and the target sub-nodes corresponding to each of the Q sub-node sets.

10. A service processing device, applied to a server, comprising: A first determination module is configured to, in response to receiving a service processing request, determine to-be-processed service information and processing end information according to the to-be-processed service identifier indicated by the service processing request, wherein the to-be-processed service information includes M service data identifiers and processing type identifiers corresponding to the M service data identifiers, respectively, and the processing end information includes P processing end identifiers, where M and P are both positive integers; a first sending module, configured to send the service data identifier and the processing type identifier to the processing end corresponding to the processing end identifier in response to the processing end corresponding to the processing end identifier approving execution of the processing corresponding to the processing type identifier, so that the processing end determines the target service data according to the service data identifier; and The first processing module is used to process the target business data in response to receiving the target business data from the processing end to obtain a business processing result.

11. A service processing device, applied to a processing end, comprising: A first acquisition module, configured to, in response to receiving a business data identifier and a processing type identifier from a server, acquire original business data according to the business data identifier; A second processing module, used to process the original business data according to the processing type identifier to obtain target business data; as well as The second sending module is used to send the target business data to the server, so that the server can determine the business processing result according to the target business data.

12. An electronic device comprising: one or more processors; a memory for storing one or more instructions, Wherein, when the one or more instructions are executed by the one or more processors, the one or more processors implement the method of any one of claims 1 to 6 or any one of claims 7 to 9.

13. A computer-readable storage medium having executable instructions stored thereon, wherein when the executable instructions are executed by a processor, the processor is enabled to implement the method of any one of claims 1 to 6 or any one of claims 7 to 9.

14. A computer program product comprising computer executable instructions for implementing the method of any one of claims 1 to 6 or any one of claims 7 to 9 when the computer executable instructions are executed.

Images