Link management method, device, equipment and medium for application service invocation

Abstract

The present disclosure provides a link management method for application service calls, which relates to the field of microservice technology and can be applied to the field of financial technology. The method includes: configuring a shell program corresponding to each application service, wherein the shell program is used to call the corresponding application service, be called by the upper-layer application service, and generate a unique transaction ID; in response to a transaction request, calling the corresponding application service by calling the shell program to process the transaction request; wherein the application service corresponding to the shell program of the next layer is initiated by calling the shell program of the next layer through the application service of the current layer; using the unique transaction ID, the service name of the application service, and the calling time as indexes, storing and / or querying the link information and result information generated in response to the transaction request. The present disclosure also provides a link management device, an electronic device, a computer-readable storage medium, and a computer program product for application service calls.

Description

Technical Field

[0001] The present disclosure relates to the field of microservice technology and can be applied to the field of financial technology. Specifically, it relates to a link management method, device, electronic device and storage medium for application service calls. Background Art

[0002] In the existing microservice architecture, many microservices run in their respective application containers, which makes their call relationships and operation result information scattered and service call information fragmented. When a failure occurs, application operation and maintenance personnel need to troubleshoot the problem of their own application. Although this troubleshooting method is feasible, it has high communication costs and low troubleshooting efficiency.

[0003] Public Content

[0004] In view of this, the present disclosure provides, on one hand, a link management method for application service calls, comprising: configuring a shell program corresponding to each application service, wherein the shell program is used to call the corresponding application service, be called by the application service of the upper layer, and generate a unique transaction ID; in response to a transaction request, calling the corresponding application service to process the transaction request by calling the shell program; wherein the application service of the current layer calls the shell program of the next layer to initiate a call to the application service corresponding to the shell program of the next layer; using the unique transaction ID, the service name of the application service and the calling time as indexes, storing and / or querying the link information and result information generated in response to the transaction request.

[0005] According to an embodiment of the present disclosure, the processing of the transaction request by calling the corresponding application service by calling the shell program includes: determining whether the shell program is called for the first time; in response to the first call to the shell program, generating the unique transaction ID corresponding to the transaction request, and in the process of calling the shell program of the next layer through the application service of the current layer, passing the unique transaction ID to the shell program of the next layer; in response to not calling the shell program for the first time, in the process of calling the shell program of the next layer through the application service of the current layer, passing the unique transaction ID generated by the first call to the shell program to the shell program of the next layer.

[0006] According to an embodiment of the present disclosure, the processing of the transaction request by calling the corresponding application service by calling the shell program includes: in response to the existence of an upper-layer calling relationship in the n-th layer application service call, the result information obtained after the n-th layer application service call is completed is fed back to the n-1-th layer application service, so that the n-1-th layer shell program calls the n-1-th layer application service to process the transaction request according to the result information obtained after the n-th layer application service call is completed.

[0007] According to an embodiment of the present disclosure, storing the link information and result information generated in response to the transaction request includes: storing the call relationship and result information corresponding to the current layer application service using the unique transaction ID, the service name and call time of the current layer application service, and the service name of the application service that calls the current layer shell program as indexes.

[0008] According to an embodiment of the present disclosure, the method of storing the calling relationship and result information corresponding to the current layer application service using the unique transaction ID, the service name and calling time of the current layer application service, and the service name of the application service that calls the current layer shell program as an index includes: after the current layer application service call is completed, the result information corresponding to the current layer application service is directly stored.

[0009] According to an embodiment of the present disclosure, the link information and result information are stored in a Java language connection database by calling the shell program.

[0010] According to an embodiment of the present disclosure, the query response to the link information and result information generated by the transaction request includes: generating a query request based on the unique transaction ID, the service name and calling time of the current layer application service, and the service name of the application service that calls the current layer shell program; converting the query request into a structured query language; executing the structured query language to query the link information and result information corresponding to the query request in the Java language connection database.

[0011] According to an embodiment of the present disclosure, the executing of the structured query language to query the link information and result information corresponding to the query request in the Java language connection database includes: establishing a connection with the Java language connection database through a database driver to execute the structured query language.

[0012] On the other hand, the present disclosure provides a link management device for application service calls, including: a configuration module, used to configure a shell program corresponding to each application service, wherein the shell program is used to call the corresponding application service, be called by the application service of the upper layer, and generate a unique transaction ID; a response module, used to respond to a transaction request, call the corresponding application service by calling the shell program to process the transaction request; wherein the application service corresponding to the shell program of the lower layer is initiated by calling the shell program of the lower layer through the application service of the current layer; a storage module, used to store link information and result information generated in response to the transaction request with the unique transaction ID, the service name of the application service and the call time as indexes; a query module, used to store and query the link information and result information generated in response to the transaction request with the unique transaction ID, the service name of the application service and the call time as indexes.

[0013] Another aspect of the present disclosure provides an electronic device, including: one or more processors; and a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method as described above.

[0014] Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions, which are used to implement the above method when executed.

[0015] Another aspect of the present disclosure provides a computer program, which includes computer executable instructions, and the instructions are used to implement the method described above when executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] Figure 1 The system architecture 100 of the link management method and system for application service scheduling according to an embodiment of the present disclosure is schematically shown;

[0017] Figure 2 A flowchart of a link management method for application service invocation according to an embodiment of the present disclosure is schematically shown;

[0018] Figure 3 A flowchart of a method for calling an application service through a shell program according to an embodiment of the present disclosure is schematically shown;

[0019] Figure 4 The following schematically shows an application scenario diagram of a link management method for application service invocation according to an embodiment of the present disclosure;

[0020] Figure 5 A flowchart of a method for calling an application service through a shell program according to another embodiment of the present disclosure is schematically shown;

[0021] Figure 6 A flowchart schematically shows a method for storing link information and result information according to an embodiment of the present disclosure;

[0022] Figure 7 A flowchart schematically shows a method for querying link information and result information according to an embodiment of the present disclosure;

[0023] Figure 8 A block diagram schematically shows a link management device for application service invocation according to an embodiment of the present disclosure;

[0024] Fig. 9 Schematically shows a block diagram of a response module 820 according to an embodiment of the present disclosure;

[0025] Fig.10Schematically shows a block diagram of a response module 820 according to another embodiment of the present disclosure;

[0026] Fig.11 Schematically shows a block diagram of a query module 840 according to an embodiment of the present disclosure;

[0027] Fig.12 A block diagram of an electronic device suitable for implementing the method described above according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0028] 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.

[0029] 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.

[0030] 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.

[0031] In the case of using expressions such as "at least one of A, B, and C, etc.", it should generally be interpreted in accordance with the meaning of the expression generally 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.). In the case of using expressions such as "at least one of A, B, or C, etc.", it should generally be interpreted in accordance with the meaning of the expression generally understood by those skilled in the art (for example, "a system having at least one of A, B, or 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.).

[0032] Some block diagrams and / or flow charts are shown in the accompanying drawings. It should be understood that some boxes or combinations thereof in the block diagrams and / or flow charts can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that these instructions can create a device for implementing the functions / operations described in these block diagrams and / or flow charts when executed by the processor. The technology of the present disclosure can be implemented in the form of hardware and / or software (including firmware, microcode, etc.). In addition, the technology of the present disclosure can take the form of a computer program product on a computer-readable storage medium storing instructions, which can be used by an instruction execution system or used in conjunction with an instruction execution system.

[0033] In the technical solution of the present disclosure, the collection, storage, use, processing, transmission, provision, disclosure and application of user personal information involved comply with the provisions of relevant laws and regulations, take necessary confidentiality measures, and do not violate public order and good morals.

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

[0035] In view of the technical problems existing in the related art, the embodiment of the present disclosure provides a link management method for application service calls, including: configuring a shell program corresponding to each application service, wherein the shell program is used to call the corresponding application service, be called by the upper layer application service, and generate a unique transaction ID. In response to a transaction request, the corresponding application service is called by calling the shell program to process the transaction request; wherein the application service corresponding to the shell program of the next layer is initiated by calling the shell program of the next layer through the application service of the current layer. Using the unique transaction ID, the service name of the application service and the calling time as indexes, the link information and result information generated in response to the transaction request are stored and / or queried.

[0036] Figure 1 The system architecture 100 of the link management method and system for application service scheduling according to an embodiment of the present disclosure 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.

[0037] like Figure 1 As shown, the system architecture 100 according to this embodiment may include a client 101, a network 102 and a server 103. The network 102 is used to provide a communication link between the client 101 and the server 103.

[0038] The client 101 may include, for example, but is not limited to, a smart phone, a tablet computer, a desktop PC, a laptop PC, a netbook computer, a workstation, a server, a game console, etc. The client 101 may be used by operation and maintenance personnel to query and display call link information and result information. The network 102 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc. The wired method may be, for example, a connection using a cable and any of the following multiple interfaces: optical fiber channel, infrared interface, D-type data interface, serial interface, USB interface, USB Type-C interface or Dock interface, and the wireless method may be, for example, a connection using a wireless communication method, wherein the wireless communication may be, for example, any of a plurality of wireless technology standards such as Bluetooth, Wi-Fi, Infrared, ZigBee, etc. The server 103 is used to execute the link management method for the application service call of the embodiment of the present disclosure, and feed back the link information and result information generated in response to the transaction request to the client 101 through the network 102.

[0039] It should be noted that the link management method for application service calls provided in the embodiment of the present disclosure can be executed by the server 103. Accordingly, the link management device for application service calls provided in the embodiment of the present disclosure can be set in the server 103. Alternatively, the link management method for application service calls provided in the embodiment of the present disclosure can also be executed by a server or server cluster that is different from the server 103 and can communicate with the client 101 and / or the server 103. Accordingly, the link management device for application service calls provided in the embodiment of the present disclosure can also be set in a server or server cluster that is different from the server 103 and can communicate with the client 101 and / or the server 103. Alternatively, the link management method for application service calls provided in the embodiment of the present disclosure can also be partially executed by the server 103 and partially executed by the client 101. Accordingly, the link management device for application service calls provided in the embodiment of the present disclosure can also be partially set in the server 103 and partially set in the client 101.

[0040] It should be understood that Figure 1 The number of clients, networks and servers in the embodiment is only for illustration. Any number of clients, networks and servers may be provided as required.

[0041] The link management method for application service calls provided by the embodiments of the present disclosure can be applied to the field of financial technology. For example, as the pace of platforms under the hosts of banks, securities companies and other institutions accelerates, more and more business processes are stripped from the host to the platform, and most of them use a microservice architecture. Many services run in their respective application containers, and their call relationships and operation result information are scattered. When operation and maintenance personnel need to troubleshoot based on link information and result information, the link management method for application service calls provided by the embodiments of the present disclosure is used to centralize the call information, and there is no need to check logs or error information on the servers or containers of each application, thereby improving the efficiency of troubleshooting and reducing costs.

[0042] It should be understood that the link management method for application service calls provided by the embodiments of the present disclosure is not limited to the application in the field of financial technology. The above description is only exemplary. The link management method for application service calls provided by the embodiments of the present disclosure can be applied to technical fields involving link management for application service calls, such as the e-commerce field and the logistics field.

[0043] Figure 2 The flowchart of the link management method for application service invocation according to the embodiment of the present disclosure is schematically shown.

[0044] like Figure 2 As shown, the link management method called by the application service may include operations S201 to S203, for example.

[0045] In operation S201, a shell program corresponding to each application service is configured.

[0046] In operation S202, in response to the transaction request, the corresponding application service is called by calling the shell program to process the transaction request, wherein the application service of the current layer calls the shell program of the next layer to initiate the call of the application service corresponding to the shell program of the next layer.

[0047] In operation S203, link information and result information generated in response to the transaction request are stored and / or queried using the unique transaction ID, the service name of the application service, and the calling time as indexes.

[0048] In the disclosed embodiment, completing a transaction request may require calling multiple application services, and a corresponding shell program (or shell service) may be configured for each application service. The shell program is used to call the corresponding application service, and is used to be called by the upper-layer application service to call the lower-layer application service when a calling relationship exists between the upper-layer application service and the lower-layer application service. The shell program is also used to generate a unique transaction ID, which is used to connect the entire application service call link in series, so that the link information and result information of the entire application service call can be centrally stored and managed based on the unique transaction ID combined with the application service name and the call time, and the link information and result information of the entire application service call can be efficiently queried. The shell program is also used to obtain the calling parameters of the application service, so as to call the corresponding application service according to the calling parameters.

[0049] Exemplarily, to complete a transaction request, application service 1, application service 2 and application service 3 need to be completed together, so corresponding shell program 1, shell program 2 and shell program 3 are configured for application service 1, application service 2 and application service 3 respectively. In the process of responding to the transaction request, application service 1 is called through shell program 1, application service 2 is called through shell program 2, application service 3 is called through shell program 3, shell program 2 is called through application service 1, and shell program 3 is called through application service 2. Then, the calling relationship and the generated result information of application service 1, application service 2 and application service 3 are stored using a unique transaction ID combined with the application service name and the calling time as an index.

[0050] According to the link management method for application service calls of the disclosed embodiment, since the entire application service link of the transaction request is connected in series through the shell program, each application service is no longer independently operated in its own application container, so that the call relationship and result information are no longer scattered, and the call relationship and result information are centralized, and there is no need to query the call relationship and result information (log or error information) on the server or container of each application. Then, the entire application service link information is marked and indexed in combination with the application service name and call time through the unique transaction ID generated by the shell program, thereby realizing rapid query of link information and result information.

[0051] The following is a Figure 2 The link management method called by the application service shown is further introduced.

[0052] Figure 3 The flowchart of a method for calling an application service through a shell program according to an embodiment of the present disclosure is schematically shown.

[0053] Figure 4 An application scenario diagram of a link management method called by an application service according to an embodiment of the present disclosure is schematically shown.

[0054] like Figure 3 As shown, the method of calling an application service through a shell program may include, for example, operations S301 to S303.

[0055] In operation S301, it is determined whether the shell program is called for the first time.

[0056] In operation S302, in response to the first call to the shell program, a unique transaction ID corresponding to the transaction request is generated, and in the process of calling the shell program of the next layer through the application service of the current layer, the unique transaction ID is passed to the shell program of the next layer.

[0057] In operation S303, in response to not calling the shell program for the first time, in the process of calling the shell program of the next layer through the application service of the current layer, the unique transaction ID generated by calling the shell program for the first time is passed to the shell program of the next layer.

[0058] Specifically, Figure 4 As shown, in one embodiment of the present disclosure, if a transaction request needs to call application service 1, application service 2 and application service 3 at the same time to complete the transaction, then after the start program 005 initiates the transaction request, in response to the transaction request, the shell program 1 in application 006 will be called first to call application service 1 to execute the corresponding application service. At this time, it will be determined whether the shell program 1 is called for the first time. If the shell program 1 is called for the first time, a unique transaction ID corresponding to the transaction request will be generated. In the process of shell program 1 calling application service 1, shell program 1 will pass the unique transaction ID to application service 1. After the application service 1 is called, application service 2 is called to execute the corresponding application service by calling shell program 2 in application 007 through application service 1. At this time, shell program 2 no longer needs to generate a transaction ID. Application service 2 will pass the unique transaction ID generated by shell program 1 to shell program 2. In the process of shell program 2 calling application service 2, shell program 2 will pass the unique transaction ID to application service 2. And so on, until all application service calls are completed and the transaction request is executed.

[0059] In another embodiment of the present disclosure, when the transaction request is repeatedly initiated, this is not the first time that the shell program 1 is called, and the shell program 1 no longer needs to generate a transaction ID, and can directly use the unique transaction ID generated by the first call to the shell program 1.

[0060] It can be seen that the unique transaction ID generated by the first call to the shell program 1 can be used throughout the entire call chain, and then the link information and result information of the entire chain can be connected in series to achieve centralized management of the link information and result information.

[0061] It should be understood that different transaction requests generally call different application services, and the generated unique transaction IDs will also be different.

[0062] Figure 5 The flowchart of a method for calling an application service through a shell program according to another embodiment of the present disclosure is schematically shown.

[0063] like Figure 5 As shown, the method for calling an application service through a shell program may include, for example, operations S501 to S502.

[0064] In operation S501, it is determined whether the n-th layer application service call has an upper layer call relationship.

[0065] In operation S502, in response to the existence of an upper-layer calling relationship in the n-layer application service call, the result information obtained after the n-layer application service call is completed is fed back to the n-1-layer application service, so that the n-1-layer shell program calls the n-1-layer application service to process the transaction request according to the result information obtained after the n-layer application service call is completed.

[0066] Continue reading Figure 4 In some application scenarios of the disclosed embodiments, after the shell program 3 calls the application service 3 to execute the corresponding application service, the entire transaction request processing flow is not over. The shell program 2 needs to further process the transaction request based on the result information generated by the shell program 3 calling the application service 3 to execute the corresponding application service and the result information generated by the previous shell program 2 calling the application service 2 to execute the corresponding application service. The shell program 1 needs to process again based on the result information obtained by the shell program 2 calling the application service 2 to further process the transaction request and the result information obtained by the previous shell program 1 calling the application service 1 to process the transaction request. At this time, since the application service 2 has an upper-level calling relationship with the application service 3 and the application service 1 has an upper-level calling relationship with the application service 2, the result information obtained after the third-layer application service call is completed will be fed back to the second-layer application service for further processing, and the further processed structure will be fed back to the first-layer application service for further processing. Since the shell program 1 no longer has an upper-level calling relationship at this time, the processed result is directly stored.

[0067] Therefore, by returning the result information of the lower-layer application service for further processing when there is an upper-layer call relationship, the link management requirements of different business scenarios can be further met.

[0068] It should be understood that when shell program 1 needs to further process the transaction request based on the result information obtained by shell program 2 calling application service 2 and the result information obtained by shell program 1 calling application service 1 to process the transaction request, shell program 1 is no longer called for the first time, and shell program 1 no longer needs to generate a transaction ID. It can directly use the unique transaction ID generated by the first call to shell program 1.

[0069] Figure 6The flowchart schematically shows a method for storing link information and result information according to an embodiment of the present disclosure.

[0070] like Figure 6 As shown, the storage method may include, for example, operations S601 to S602.

[0071] In operation S601, it is determined whether the application service of the current layer has been called.

[0072] In the embodiments of the present disclosure, call completion means that after the application service call of the current layer is completed, it is no longer necessary to call other application services, or after the application service call of the current layer is completed, it is necessary to call other application services but it is no longer necessary to process again based on the result information generated by other application services.

[0073] In operation S602, in response to the completion of the previous layer application service call, the call relationship and result information corresponding to the current layer application service is stored with the unique transaction ID, the service name and call time of the current layer application service, and the service name of the application service that calls the current layer shell program as indexes.

[0074] In the disclosed embodiment, the call time can record the call start time and the call end time. For repeated calls of the same transaction request, even if the unique transaction ID and application service name are the same, they can be distinguished according to the call time to facilitate the management of link information.

[0075] In the embodiments of the present disclosure, Figure 4 As shown, after the current layer application service call is completed, the link information and result information can be stored in the Java language connection database by calling the shell program. Specifically, Figure 4 As shown, the link information and result information can be fed back to the update module 004 through the shell program of the current layer, so that the update module 004 updates the link information and result information into the database 003.

[0076] According to the embodiment of the present disclosure, the query efficiency of subsequent link information and result information can be improved by connecting to a database storing link information and result information through Java language.

[0077] Figure 7 The flowchart of the method for querying link information and result information according to an embodiment of the present disclosure is schematically shown.

[0078] like Figure 7 As shown, the query method may include, for example, operations S701 to S703.

[0079] In operation S701, a query request is generated according to a unique transaction ID, a service name and a calling time of a current layer application service, and a service name of an application service that calls a shell program of the current layer.

[0080] In operation S702, the query request is converted into a structured query language.

[0081] In operation S703, the structured query language is executed to query the Java language connection database for link information and result information corresponding to the query request.

[0082] In the disclosed embodiment, since the stored index is the unique transaction ID, the service name and call time of the current layer application service, and the service name of the application service that calls the current layer shell program, the unique transaction ID, the service name and call time of the current layer application service, and the service name of the application service that calls the current layer shell program are selected to generate a query request. Figure 4 As shown, the user enters the transaction ID, service name and calling time of the current layer application service, and service name of the application service that calls the current layer shell program on UI page end 001, and query module 002 generates a query request based on the transaction ID, service name and calling time of the current layer application service, and service name of the application service that calls the current layer shell program.

[0083] Since the database used in the embodiment of the present disclosure is used for storage, it is necessary to convert the query request into a structured query language, and quickly query the link information and result information corresponding to the query request in the Java language connection database by executing the structured query language. Specifically, a connection can be established with the Java language connection database through a database driver to execute the structured query language. The queried link information and result information are returned to the UI page end 001 for display, so that the operation and maintenance personnel can efficiently troubleshoot according to the link information and result information.

[0084] In summary, the link management method for application service calls provided by the embodiment of the present disclosure connects the entire application service link of the transaction request in series through the shell program. Each application service is no longer independently run in its own application container, so that the call relationship and result information are no longer scattered, and the call relationship and result information are centralized, and there is no need to query the call relationship and result information on the server or container of each application. The entire application service link information is then marked and indexed in combination with the application service name and call time through the unique transaction ID generated by the shell program, thereby realizing rapid query of link information and result information. In addition, the configuration of the shell program reduces the modification of the application program involved in the entire business processing, thereby not affecting the original business processing flow.

[0085] Figure 8 A block diagram of a link management device for application service invocation according to an embodiment of the present disclosure is schematically shown.

[0086] like Figure 8As shown, the link management device 800 may include a configuration module 810 , a response module 820 , a storage module 830 and a query module 840 .

[0087] The configuration module 810 is used to configure the shell program corresponding to each application service, wherein the shell program is used to call the corresponding application service, be called by the upper layer application service and generate a unique transaction ID.

[0088] The response module 820 is used to respond to the transaction request and call the corresponding application service by calling the shell program to process the transaction request; wherein, the application service of the next layer is called by the shell program of the current layer to initiate the call of the application service corresponding to the shell program of the next layer.

[0089] The storage module 830 is used to store the link information and result information generated in response to the transaction request with the unique transaction ID, the service name of the application service and the calling time as indexes.

[0090] The query module 840 is used to store the link information and result information generated in response to the transaction request by using the unique transaction ID, the service name of the application service and the calling time as indexes.

[0091] Fig. 9 The block diagram of the response module 820 according to an embodiment of the present disclosure is schematically shown.

[0092] like Fig. 9 As shown, the response module 820 may include, for example, a first determination unit 821 , a first response unit 822 , and a second response unit 823 .

[0093] The first judging unit 821 is used to judge whether the shell program is called for the first time.

[0094] The first response unit 822 is used to generate a unique transaction ID corresponding to the transaction request in response to the first call to the shell program, and pass the unique transaction ID to the shell program of the next layer in the process of calling the shell program of the next layer through the application service of the current layer.

[0095] The second response unit 823 is used to respond to the non-first call to the shell program, and in the process of calling the shell program of the next layer through the application service of the current layer, pass the unique transaction ID generated by the first call to the shell program to the shell program of the next layer.

[0096] Fig.10 The block diagram of the response module 820 according to another embodiment of the present disclosure is schematically shown.

[0097] like Fig.10 As shown, the response module 820 may include, for example, a second determination unit 824 and a third response unit 825 .

[0098] The second determination unit 824 is used to determine whether the n-th layer application service call has an upper layer call relationship.

[0099] The third response unit 825 is used to respond to the existence of an upper-layer call relationship in the n-layer application service call, and feed back the result information obtained after the n-layer application service call is completed to the n-1-layer application service, so that the n-1-layer shell program calls the n-1-layer application service to process the transaction request according to the result information obtained after the n-layer application service call is completed.

[0100] Fig.11 The block diagram of the query module 840 according to an embodiment of the present disclosure is schematically shown.

[0101] like Fig.11 As shown, the query module 840 may include, for example, a generating unit 841 , a converting unit 842 , and an executing unit 843 .

[0102] The generating unit 841 is used to generate a query request according to the unique transaction ID, the service name and calling time of the current layer application service, and the service name of the application service that calls the current layer shell program.

[0103] The conversion unit 842 is used to convert the query request into a structured query language.

[0104] The execution unit 843 is used to execute the structured query language to query the link information and result information corresponding to the query request in the Java language connection database.

[0105] 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.

[0106] For example, any multiple of the configuration module 810, the response module 820, the storage module 830 and the query module 840 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 of 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 configuration module 810, the response module 820, the storage module 830 and the query module 840 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 configuration module 810 , the response module 820 , the storage module 830 , and the query module 840 may be at least partially implemented as a computer program module, and when the computer program module is executed, the corresponding function may be performed.

[0107] It should be noted that the link management device part in the embodiment of the present disclosure corresponds to the link management method part in the embodiment of the present disclosure, and their specific implementation details and technical effects are also the same, which will not be repeated here.

[0108] Fig.12 A block diagram of an electronic device suitable for implementing the method described above 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.

[0109] like Fig.12 As shown, the electronic device 1200 according to an embodiment of the present disclosure includes a processor 1201, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1202 or a program loaded from a storage part 1208 into a random access memory (RAM) 1203. The processor 1201 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (e.g., 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 an embodiment of the present disclosure.

[0110] 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.

[0111] 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 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 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.

[0112] 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.

[0113] 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.

[0114] 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.

[0115] 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 .

[0116] 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.

Claims

1. A link management method for application service invocation, comprising: Configure a shell program corresponding to each application service, wherein the shell program is used to call the corresponding application service, be called by the upper layer application service, and generate a unique transaction ID; In response to a transaction request, the corresponding application service is called by calling the shell program to process the transaction request; wherein, the application service corresponding to the shell program of the next layer is called by the application service of the current layer to initiate the call of the application service; the calling of the corresponding application service by calling the shell program to process the transaction request includes: determining whether the shell program is called for the first time; in response to the first call of the shell program, generating the unique transaction ID corresponding to the transaction request, and in the process of calling the shell program of the next layer by the application service of the current layer, passing the unique transaction ID to the shell program of the next layer; in response to not calling the shell program for the first time, in the process of calling the shell program of the next layer by the application service of the current layer, passing the unique transaction ID generated by the first call of the shell program to the shell program of the next layer; The link information and result information generated in response to the transaction request are stored and / or queried using the unique transaction ID, the service name of the application service and the calling time as indexes.

2. The link management method for application service invocation according to claim 1, wherein: The processing of the transaction request by calling the corresponding application service by calling the shell program includes: In response to the existence of an upper-layer calling relationship in the n-layer application service call, the result information obtained after the n-layer application service call is completed is fed back to the n-1-layer application service, so that the n-1-layer shell program calls the n-1-layer application service and processes the transaction request according to the result information obtained after the n-layer application service call is completed.

3. The link management method for application service invocation according to claim 1, wherein: Storing the link information and result information generated in response to the transaction request includes: After the current layer application service is called, the call relationship and result information corresponding to the current layer application service is stored with the unique transaction ID, the service name and call time of the current layer application service, and the service name of the application service that calls the current layer shell program as indexes.

4. The link management method for application service invocation according to any one of claims 1 or 3, wherein: The link information and result information are stored in a Java language connection database by calling the shell program.

5. The link management method for application service invocation according to claim 4, wherein: The querying of the link information and result information generated in response to the transaction request includes: Generate a query request according to the unique transaction ID, the service name and calling time of the current layer application service, and the service name of the application service that calls the current layer shell program; Converting the query request into structured query language; The structured query language is executed to query the link information and result information corresponding to the query request in the Java language connection database.

6. The link management method for application service invocation according to claim 5, wherein: The executing of the structured query language to query the Java language connection database for link information and result information corresponding to the query request includes: A connection is established with the Java language connection database through a database driver to execute the structured query language.

7. A link management device for application service invocation, comprising: A configuration module, used to configure a shell program corresponding to each application service, wherein the shell program is used to call the corresponding application service, be called by the upper layer application service, and generate a unique transaction ID; A response module, for responding to a transaction request, calling the corresponding application service by calling the shell program to process the transaction request; wherein, the application service corresponding to the shell program of the next layer is called by the application service of the current layer to initiate the call of the shell program; the calling of the corresponding application service by calling the shell program to process the transaction request includes: determining whether the shell program is called for the first time; in response to the first call of the shell program, generating the unique transaction ID corresponding to the transaction request, and in the process of calling the shell program of the next layer by the application service of the current layer, passing the unique transaction ID to the shell program of the next layer; in response to not calling the shell program for the first time, in the process of calling the shell program of the next layer by the application service of the current layer, passing the unique transaction ID generated by the first call of the shell program to the shell program of the next layer; A storage module, used to store link information and result information generated in response to the transaction request with the unique transaction ID, the service name of the application service and the calling time as indexes; The query module is used to store the link information and result information generated in response to the transaction request by using the unique transaction ID, the service name of the application service and the calling time as indexes.

8. An electronic device comprising: one or more processors; a memory for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 6.

9. A computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, enables the processor to implement the method according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images