Interface arrangement method and device

Abstract

The embodiment of the invention provides an interface arrangement method and device, which can be applied to the field of computer technology and application technology, in the method, an original arrangement link is firstly acquired, and at least one target calling link matched with the original arrangement link is acquired from a plurality of pre-configured entry point calling links, each target calling link is the same as one sub-arrangement link of the original arrangement link; each target calling link is associated with at least one section, and each section comprises an entry point in the original arrangement link and a corresponding enhanced calling link; and weaving the enhanced calling link contained in each section into the original arrangement link according to the entry point contained in each section to obtain the target arrangement link, so that a function of automatically weaving related services into the original arrangement link is realized, and meanwhile, the arrangement efficiency and maintainability of interface arrangement are improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the fields of computer technology and application technology, and in particular, to an interface arrangement method and device. Background Art

[0002] Interface orchestration refers to combining and calling multiple independent interfaces (which may come from different systems or services) through certain logic and rules to implement a more complex business function or process. A complete business logic link often requires common functions such as logging, transaction management, and security checks. Since these common functions are not related to the business logic itself, they will not be embedded in the business logic link; accordingly, when performing interface orchestration for the business logic link, the business interfaces of these common functions will not be included in the interface orchestration results.

[0003] In the related art, the codes of these common functions are directly embedded into the business logic code. However, this method makes the code complicated and difficult to maintain. At the same time, it is difficult to ensure the efficiency of the interface arrangement of the business logic link. Summary of the invention

[0004] The embodiments of the present invention provide an interface arrangement method and device for improving the flexibility and efficiency of interface arrangement.

[0005] On the one hand, an embodiment of the present application provides an interface arrangement method, the method comprising:

[0006] Get the original orchestration link;

[0007] Acquire at least one target call link matching the original orchestration link from a plurality of pre-configured entry point call links, wherein each target call link is the same as a sub-orchestration link of the original orchestration link; each target call link is associated with at least one aspect, and each aspect includes: an entry point in the original orchestration link and a corresponding enhanced call link;

[0008] According to the entry points contained in each aspect, the enhanced call link contained in each aspect is woven into the original orchestration link to obtain the target orchestration link.

[0009] Optionally, the entry point call link is a single business interface; or, a call chain obtained by arranging multiple business interfaces;

[0010] For each aspect associated with the entry point call link, the entry point included in the aspect is located before the starting business interface or after the ending business interface of the entry point call link;

[0011] The enhanced call chain included in the aspect is a single enhanced business interface; or, a call chain obtained by arranging multiple enhanced business interfaces.

[0012] Optionally, it also includes:

[0013] When the slice includes multiple enhanced call links, the execution priorities of the multiple enhanced call links are configured, and the execution priorities of the multiple enhanced call links indicate the execution order of the multiple enhanced call links.

[0014] Optionally, it also includes:

[0015] The configuration information of each slice is converted into an adjacency list for storage.

[0016] Optionally, acquiring at least one target call link matching the original orchestration link from the pre-configured multiple entry point call links includes:

[0017] Before executing the original orchestration link, a subgraph isomorphism algorithm is used to iteratively search the multiple entry point call links to obtain at least one target call link matching the original orchestration link.

[0018] Optionally, the iterative search of the multiple entry point call links by using a subgraph isomorphism algorithm to obtain at least one target call link matching the original orchestration link includes:

[0019] Converting the original orchestration link into a first graph structure, and converting the multiple entry point call links into corresponding second graph structures respectively;

[0020] A subgraph isomorphism algorithm is used to traverse each subgraph structure included in the first graph structure, and when a subgraph structure is isomorphic to the second graph structure, an entry point call link corresponding to the second graph structure is used as the target call link.

[0021] Optionally, according to the entry point contained in each slice, the enhanced call link contained in each slice is weaved into the original orchestration link to obtain the target orchestration link, and further includes:

[0022] The target orchestration link is executed to obtain an execution result, and the execution process of the target orchestration link is visualized.

[0023] On the one hand, an embodiment of the present application provides an interface arrangement device, the device comprising:

[0024] An acquisition module is used to obtain the original orchestration link;

[0025] A processing module, configured to obtain at least one target call link matching the original orchestration link from a plurality of pre-configured entry point call links, wherein each target call link is the same as a sub-orchestration link of the original orchestration link; each target call link is associated with at least one aspect, and each aspect includes: an entry point in the original orchestration link and a corresponding enhanced call link;

[0026] The weaving module is used to weave the enhanced call link contained in each slice into the original orchestration link according to the entry point contained in each slice, so as to obtain the target orchestration link.

[0027] Optionally, the entry point call link is a single business interface; or, a call chain obtained by arranging multiple business interfaces;

[0028] For each aspect associated with the entry point call link, the entry point included in the aspect is located before the starting business interface or after the ending business interface of the entry point call link;

[0029] The enhanced call chain included in the aspect is a single enhanced business interface; or, a call chain obtained by arranging multiple enhanced business interfaces.

[0030] Optionally, the processing module is further used for:

[0031] When the slice includes multiple enhanced call links, the execution priorities of the multiple enhanced call links are configured, and the execution priorities of the multiple enhanced call links indicate the execution order of the multiple enhanced call links.

[0032] Optionally, the processing module is further used for:

[0033] The configuration information of each slice is converted into an adjacency list for storage.

[0034] Optionally, the processing module is specifically used for:

[0035] Before executing the original orchestration link, a subgraph isomorphism algorithm is used to iteratively search the multiple entry point call links to obtain at least one target call link matching the original orchestration link.

[0036] Optionally, the processing module is specifically used for:

[0037] Converting the original orchestration link into a first graph structure, and converting the multiple entry point call links into corresponding second graph structures respectively;

[0038] A subgraph isomorphism algorithm is used to traverse each subgraph structure included in the first graph structure, and when a subgraph structure is isomorphic to the second graph structure, an entry point call link corresponding to the second graph structure is used as the target call link.

[0039] Optionally, the weaving module is specifically used for:

[0040] The target orchestration link is executed to obtain an execution result, and the execution process of the target orchestration link is visualized.

[0041] In one aspect, an embodiment of the present application provides a computer device, including:

[0042] A memory for storing program instructions;

[0043] The processor is used to call the program instructions stored in the memory and execute the steps of the above-mentioned interface arrangement method according to the obtained program.

[0044] On the one hand, an embodiment of the present application provides a computer-readable storage medium storing a computer program executable by a computer device, and when the program is run on the computer device, the computer executes the steps of the above-mentioned interface arrangement method.

[0045] On the one hand, an embodiment of the present application provides a computer program product, including a computer program stored on a computer-readable storage medium, wherein the computer program includes program instructions, and when the program instructions are executed by a computer device, the computer device executes the steps of the above-mentioned interface orchestration method.

[0046] In the embodiment of the present application, at least one target call link matching the original orchestration link is obtained from the pre-configured multiple entry point call links, each target call link is associated with at least one aspect, each aspect includes an entry point and a corresponding enhanced call link, and the enhanced call link contained in each aspect is woven into the original orchestration link according to the entry point, so as to realize the automatic weaving of relevant business functions into the original orchestration link, improve the scalability of the original orchestration link, and reduce the complexity and maintenance difficulty of the code compared to directly embedding the code of the general function into the business logic code. At the same time, the coupling problem caused by the original orchestration link directly calling the general business interface is solved, and the orchestration efficiency and maintainability of the interface orchestration are improved. Secondly, the pre-configured multiple entry point call links provide a variety of options for the function weaving of the original orchestration link, thereby supporting aspect programming of various call chain scenarios and improving the flexibility of aspect programming. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0048] Figure 1 A schematic diagram of a system architecture provided in an embodiment of the present application;

[0049] Figure 2 A flowchart of an interface arrangement method provided in an embodiment of the present application;

[0050] Figure 3 A schematic diagram of a process flow of an original orchestration link provided in an embodiment of the present application;

[0051] Figure 4A A schematic diagram of a flow chart of an entry point calling link provided in an embodiment of the present application;

[0052] Figure 4B A schematic diagram of a flow chart of an entry point calling link provided in an embodiment of the present application;

[0053] Figure 5 A schematic diagram of a link matching method provided in an embodiment of the present application;

[0054] Figure 6 A schematic diagram of a target orchestration link process provided by an embodiment of the present application;

[0055] Figure 7 A flowchart of an interface arrangement method provided in an embodiment of the present application;

[0056] Figure 8 A schematic diagram of the structure of an interface arrangement device provided in an embodiment of the present application;

[0057] Fig. 9 A schematic diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0058] In order to make the purpose, technical scheme and beneficial effects of the present invention more clear, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0059] For ease of understanding, the terms involved in the embodiments of the present invention are explained below.

[0060] Interface orchestration: refers to combining and calling multiple independent business interfaces (which may come from different systems or services) through certain logic and rules to achieve a more complex business function or process.

[0061] Aspect-Oriented Programming (AOP): A programming paradigm that aims to separate common business functions from core business logic.

[0062] Aspects: define the abstraction of common business functions and specify the rules for when, where, and how to apply enhancements. Aspects are mainly composed of enhancements, entry points, and other parts.

[0063] Enhancement: The specific implementation of the aspect, which defines the specific behavior of the aspect. Enhancement can be performed at specific points such as before method execution, after execution, when an exception is thrown, etc. It adds additional functions or behaviors to existing methods or classes by defining aspects without modifying the original code.

[0064] Entry point: It is used to specify the business interface affected by the enhancement, and can accurately control the timing of the enhancement execution in the program.

[0065] Subgraph isomorphism algorithm: An algorithm used in graph theory to solve the subgraph isomorphism problem. It is used to determine whether a graph (called a subgraph) is a subgraph of another graph (called the target graph). This subgraph relationship is maintained through a mapping between vertex sets and edge sets. At the same time, the mapped subgraph is required to keep the original edge and vertex relationship unchanged in the target graph.

[0066] The following is a brief introduction to the system architecture diagram applicable to the technical solution of the embodiment of the present application. It should be noted that the process introduced below is only used to illustrate the embodiment of the present application and is not a limitation.

[0067] refer to Figure 1 , which is an architecture diagram of a visual interface orchestration system applicable to an embodiment of the present application. The system architecture includes at least a terminal device 101 and a server 102. The number of terminal devices 101 can be one or more, and the number of servers 102 can also be one or more. The present application does not specifically limit the number of terminal devices 101 and servers 102.

[0068] The terminal device 101 is pre-installed with an application with an interface arrangement function, which is a client application, a web application, a small program application, etc. The user can use the application to perform visual interface arrangement, visual section configuration, etc. The terminal device 101 can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart home appliance, a smart voice interaction device, a smart car device, etc., but is not limited thereto.

[0069] Server 102 is the background server of the application. Server 102 can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers. It can also be a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDN), as well as big data and artificial intelligence platforms, but is not limited to these.

[0070] It should be noted that the method in the embodiment of the present application can be executed by the terminal device 101 or the server 102 alone, or can be executed by the terminal device 101 and the server 102 together.

[0071] In the embodiment of the present application, the terminal device 101 and the server 102 may be directly or indirectly connected to each other through one or more networks. The network may be a wired network or a wireless network, for example, a mobile cellular network, or a wireless fidelity (Wireless-Fidelity, WIFI) network, or other possible networks, which are not limited in the embodiment of the present application.

[0072] The following is based on Figure 1 The system architecture diagram shown in FIG. 1 shows an example of an interface arrangement method. The method can be described as follows: Figure 1 The terminal device 101 shown in the figure may also be executed by the server 102, or the terminal device 101 and the server 102 may interact to execute the Figure 2 As shown, the following steps are included:

[0073] Step 201: Obtain the original orchestration link.

[0074] Specifically, the original orchestration link refers to a complete business logic link formed according to certain logic or rules. Figure 3 The original orchestration link contains multiple business interfaces, namely business interfaces A, B, C, and D. Each business interface can define the input parameter message. After business interface B, a judgment logic statement is embedded. If the result of the judgment logic statement is yes, business interface C is called; if the result of the judgment logic statement is no, business interface D is called.

[0075] Each business interface passes the processed call result to the next business interface as the input parameter of the next business interface. All business interfaces form an orchestration link, which can be used as a complete business logic link to provide external services.

[0076] Step 202: Acquire at least one target call link matching the original orchestration link from the pre-configured multiple entry point call links, wherein each target call link is the same as a sub-orchestration link of the original orchestration link, each target call link is associated with at least one aspect, and each aspect includes: an entry point in the original orchestration link and a corresponding enhanced call link.

[0077] Specifically, the sub-orchestration links include: single interface links, one-way linked list serial links, tree links, and graph links. Figure 3 , the business interface A (or B, C, D) in the figure is a single interface link; the sub-orchestration link composed of business interface A and business interface B is a unidirectional linked list serial link.

[0078] Aspects are modular units used for decoupling and encapsulation in software development. Aspects consist of entry points and enhanced call links, which define the rules, timing, and location of applying enhanced call links. Enhanced call links are the specific implementation of aspects, which define the specific behavior of aspects and are used to add additional functions to the original orchestration link. One function is implemented by an enhanced call chain, which can be various functions such as logging and specific business triggering.

[0079] In some embodiments, the entry point call link is a single business interface; or, a call chain obtained by arranging multiple business interfaces; for each aspect associated with the entry point call link, the entry point contained in the aspect is located before the starting business interface or after the ending business interface of the entry point call link; the enhanced call link contained in the aspect is a single enhanced business interface; or, a call chain obtained by arranging multiple enhanced business interfaces.

[0080] Specifically, aspect configuration includes: entry point configuration and enhanced call link configuration. First, in the entry point configuration, it is specified what type of orchestration link the aspect intercepts. An enhanced call link is defined for each defined entry point. An enhanced call link defines the functions and parameters that an entry point needs to execute. The enhanced call link can be a single business interface or a combination of multiple business interfaces, and can be various functions such as logging and specific business triggering.

[0081] For example, refer to Figure 4A , the entry point call link is: the call chain obtained by orchestration of business interface A and business interface B. The entry point call link corresponds to multiple aspects, such as enhanced call link 1 and entry point 1 form a aspect, enhanced call link 2 and entry point 1 form a aspect, and enhanced call link 3 and entry point 2 form a aspect.

[0082] Each aspect contains an enhanced call chain, which can be a single enhanced business interface. For example, enhanced call chain 1 is business interface N, and enhanced call chain 3 is business interface Z. The enhanced call chain contained in the aspect can also be a call chain obtained by arranging multiple enhanced business interfaces. For example, enhanced call chain 2 is a call chain obtained by arranging business interfaces X and Y.

[0083] Set entry points before the starting service interface (service interface A) and after the ending service interface (service interface B) of the entry point call link, such as Figure 4A The enhanced call link woven in this way belongs to the surrounding enhanced call link, including entry points 1 and 2.

[0084] It should be noted that this application is not limited to the above Figure 4A In one implementation example, the entry point can also be set only before the entry point calls the starting service interface of the link, for example, only Figure 4A The enhanced call link woven at this position belongs to the front enhanced call link; you can also set the entry point only after the end business interface of the entry point call link, for example, only set Figure 4A The entry point 2 in the figure, the enhanced call link woven at this position belongs to the post-enhanced call link.

[0085] The above-mentioned aspect configuration process can be visualized. In the process of using the visual orchestration system application, business interfaces with different functions can be combined by dragging, dropping, and so on to build enhanced call links, thereby creating call links to achieve more complex and diverse interface functions.

[0086] In the embodiment of the present application, this aspect configuration method is adopted to improve the scalability and flexibility of the system and ensure the code stability of each business interface; secondly, by defining the location of the entry point, the timing of execution of the enhanced call link in the program of the entire business logic link can be accurately controlled.

[0087] In addition, the present application also configures a universal entry point call chain, and the universal entry point call chain can be a single universal business interface or a chain containing multiple universal business interfaces.

[0088] For example, refer to Figure 4B The general entry point call link is a general business interface M, and a general business identifier is configured for the general business interface M. The entry point call link corresponds to a section, which includes an entry point and an enhanced call link (ie, business interface G). The entry point is located at the output end of the general business interface M.

[0089] Each service interface in the original orchestration link has a pre-set shared service identifier. If the universal service identifier of the universal service interface M matches the shared service identifiers of multiple service interfaces in the original orchestration link, then the entry point call link is the target call link.

[0090] For each business interface matched by the original orchestration link, the enhanced call link (i.e. business interface G) in the aspect is woven in according to the entry point in the aspect (i.e. the output end of the business interface), so as to weave the same function into multiple business interfaces matched in the original orchestration link.

[0091] In the embodiment of the present application, configuring a universal entry point call link can effectively reduce the configuration cost of the entry point call link and improve the orchestration efficiency of the interface orchestration.

[0092] In some embodiments, when a slice includes multiple enhanced call links, execution priorities of the multiple enhanced call links are configured, and the execution priorities of the multiple enhanced call links indicate the execution order of the multiple enhanced call links.

[0093] For defined aspects, if multiple aspects share a cut-in point (i.e., one cut-in point is associated with multiple enhanced call links), the priority of each enhanced call link is defined by a number. The priority indicates multiple, and the smaller the number, the higher the execution order of the enhanced call link after it is woven into the orchestration link. That is, when a business interface in the original orchestration link is enhanced by multiple aspects, the enhanced call link contained in the aspect with a higher priority in the same cut-in point will be executed first.

[0094] When multiple enhanced call links are associated with one entry point, refer to Figure 4A In the enhanced call link 1 and enhanced call link 2, since different enhanced call links perform different functions, it is necessary to configure execution priorities for multiple enhanced call links on the same entry point to ensure the execution order of multiple enhanced call chains contained in the aspect after being woven into the original orchestration link.

[0095] In an embodiment of the present application, by defining the priorities of multiple enhanced call links in the aspect, multiple functions can be added to the original orchestration link at the matching entry point, and the smooth execution of multiple functions can be ensured, thereby improving the reusability, maintainability and scalability of the code.

[0096] In some embodiments, the configuration information of each slice is converted into an adjacency list for storage.

[0097] Specifically, the configuration information of each slice is converted into a directed graph or an undirected graph structure. If the enhanced call link in the slice is a single interface call link, the configuration information of the slice is converted into an undirected graph structure. If there are multiple business interfaces in the enhanced call link in the slice, refer to Figure 4A The enhanced call link 2 in the example converts the configuration information of the slice into a directed graph structure.

[0098] The graph structure is stored in the form of an adjacency list. The adjacency list is a storage structure that combines sequential allocation and chain allocation. It can describe every point on the graph and establish a container for each vertex of the graph. The nodes in the i-th container contain all adjacent vertices of the vertex. In practice, the most commonly used adjacency list is the adjacency matrix, which is an adjacency list that does not discretize the edge set of each vertex.

[0099] In an embodiment of the present application, the configuration information of the slice is converted into a directed graph or an undirected graph structure and stored in the form of an adjacency list, which can achieve fast query and update, improve the query and processing capabilities of the graph database, and is easy to expand.

[0100] In some embodiments, before executing the original orchestration link, a subgraph isomorphism algorithm is used to iteratively search multiple entry point call links to obtain at least one target call link that matches the original orchestration link.

[0101] Specifically, the subgraph isomorphism algorithm is a method for verifying whether a query graph is a subgraph of another graph. The core of the algorithm is to find isomorphic mappings between two graphs. The subgraph isomorphism algorithm is usually implemented using a backtracking algorithm, which is similar to the tree traversal process. It scores each edge of the query graph. The lower the score, the more efficient the edge pruning. In order of scores from low to high, it verifies whether each edge in the query graph has a corresponding edge in the data graph, and checks whether the connection relationship of these edges is consistent.

[0102] In this application, the query graph can be viewed as a chain of pointcut calls, such as Figure 4A It contains the entry point call chain of business interface A and business interface B; the data diagram is the original orchestration link, for example Figure 3 Original orchestration link shown.

[0103] In some embodiments, the original orchestration link is converted into a first graph structure, and multiple entry point call links are respectively converted into corresponding second graph structures; a subgraph isomorphism algorithm is used to traverse each subgraph structure included in the first graph structure, and when a subgraph structure is isomorphic to the second graph structure, the entry point call link corresponding to the second graph structure is used as the target call link.

[0104] Specifically, the original orchestration link is converted into the first graph structure, and the entry point call chain is converted into the second graph structure. According to the second graph structure, the subgraph isomorphism algorithm is used based on JGraphT to traverse each subgraph structure in the first graph structure. When a subgraph structure is traversed that is isomorphic to the second graph structure, the entry point call link corresponding to the second graph structure is used as the target call link, where isomorphism requires not only the same nodes (business interfaces) but also the same connection mode.

[0105] JGraphT is a graphics library for processing and manipulating graph structure data, including a variety of classic graph algorithms. The subgraph isomorphism algorithm in the embodiment of the present application can be the U11mann algorithm, the VF2 algorithm, the GraphMatch algorithm, the VF3 algorithm and the Weifeiler-Lehman algorithm, which is not specifically limited in the present application.

[0106] For example, refer to Figure 5 , Figure 4A The entry point shown in the call link is the business interface A, Figure 3 The service interface A in the original orchestration link shown matches; Figure 4A The entry point shown in the call link is the business interface B, which is Figure 3 The service interface B in the original orchestration link shown matches; Figure 4A The connection mode between business interface A and business interface B in the entry point call link shown in Figure 3 The connection modes of service interface A and service interface B in the original orchestration link shown match; therefore, Figure 3 The original arrangement link shown has Figure 4A The entry point calls the same sub-orchestration link as shown (including business interface A, business interface B, and the connection mode between business interface A and business interface B). Figure 4A The entry point call chain shown is Figure 3 The target call link that matches the original orchestration link is shown.

[0107] Step 203: According to the entry points contained in each slice, the enhanced call link contained in each slice is woven into the original orchestration link to obtain the target orchestration link.

[0108] Specifically, after determining the target call link, the enhanced call links contained in each aspect are woven into the original orchestration link according to the entry points contained in each aspect on the target call link to obtain the target orchestration link.

[0109] For example, refer to Figure 6 ,Will Figure 4A The enhanced call link 1 (including business interface N) and enhanced call link 2 (including business interface X and business interface Y) associated with entry point 1 are woven into Figure 3The position of entry point 1 in the original orchestration link shown in FIG; similarly, the enhanced call link 3 (including business interface Z) associated with entry point 2 is woven into Figure 3 The location of entry point 2 in the original orchestration link shown in , and the target orchestration link is obtained, see Figure 6 , where the execution priority of enhanced call link 1 is higher than that of enhanced call link 2, so the execution order of business interface N is before that of business interface X.

[0110] In some embodiments, after obtaining the target orchestration link, the target orchestration link is executed to obtain an execution result, and the execution process of the target orchestration link is visualized.

[0111] In the embodiment of the present application, the execution process of the target orchestration link is visualized, so that the interface orchestration is dynamic, which facilitates the user to better understand and participate in the orchestration process, and lowers the usage threshold.

[0112] In the embodiment of the present application, at least one target call link matching the original orchestration link is obtained from the pre-configured multiple entry point call links, each target call link is associated with at least one aspect, each aspect includes an entry point and a corresponding enhanced call link, and the enhanced call link contained in each aspect is woven into the original orchestration link according to the entry point, so as to realize the automatic weaving of relevant business functions into the original orchestration link, improve the scalability of the original orchestration link, and reduce the complexity and maintenance difficulty of the code compared to directly embedding the code of the general function into the business logic code. At the same time, the coupling problem caused by the original orchestration link directly calling the general business interface is solved, and the orchestration efficiency and maintainability of the interface orchestration are improved. Secondly, the pre-configured multiple entry point call links provide a variety of options for the function weaving of the original orchestration link, thereby supporting aspect programming of various call chain scenarios and improving the flexibility of aspect programming.

[0113] In order to better explain the embodiment of the present application, the following describes an interface arrangement method provided by the embodiment of the present application in combination with an actual scenario. The process of the method is as follows: Figure 1 The server execution shown includes the following steps: Figure 7 As shown:

[0114] Step 701, slice configuration.

[0115] Step 702: Slice storage.

[0116] Specifically, aspect configuration refers to the entry points and enhanced call links associated with the manually pre-configured entry point call links, and the aspect configuration information is converted into a database stored in a graph structure. At the same time, the graph structure converted by the entry point call link is also stored in the database.

[0117] Step 703: the original orchestration link is executed.

[0118] Specifically, when the original orchestration link is executed, the original orchestration link is intercepted and converted into the first graph structure.

[0119] Step 704: Slice matching.

[0120] Specifically, the graph structure of each entry point call link in the database is used as the second graph structure. For each second graph structure, based on the second graph structure, a subgraph isomorphism algorithm is used to traverse the subgraph structures of the first graph structure until a subgraph structure matching the second graph structure is traversed. The entry point call link corresponding to the subgraph structure is the target call link.

[0121] Step 705: Enhance call link weaving.

[0122] Specifically, according to the entry points contained in the aspect, the enhanced call link contained in the aspect is woven into the original orchestration link to obtain the target orchestration link.

[0123] Step 706: The target orchestration link is executed.

[0124] Specifically, the execution process of the target orchestration link is visualized.

[0125] In an embodiment of the present application, on the basis of a visual interface orchestration system, the aspect of the original orchestration link is defined by configuring an entry point call link, and a subgraph isomorphism algorithm is used to dynamically match the sub-orchestration links in the original orchestration link with each entry point call link. If the match is successful, the aspect associated with the entry point call link is woven into the original orchestration link, making the aspect matching of the original orchestration link dynamic, and the aspect programming more flexible and fast, greatly improving the system development efficiency and maintainability.

[0126] Based on the same technical concept, the embodiment of the present application provides a structural diagram of an interface arrangement device, such as Figure 8 As shown, the interface arrangement device 800 includes:

[0127] The acquisition module 801 is used to acquire the original orchestration link;

[0128] The processing module 802 is configured to obtain at least one target call link matching the original orchestration link from a plurality of pre-configured entry point call links, wherein each target call link is the same as a sub-orchestration link of the original orchestration link; each target call link is associated with at least one aspect, and each aspect includes: an entry point in the original orchestration link and a corresponding enhanced call link;

[0129] The weaving module 803 is used to weave the enhanced call link included in each slice into the original orchestration link according to the entry point included in each slice, so as to obtain the target orchestration link.

[0130] Specifically, the entry point call link is a single business interface; or a call chain obtained by arranging multiple business interfaces;

[0131] For each aspect associated with the entry point call link, the entry point included in the aspect is located before the starting business interface or after the ending business interface of the entry point call link;

[0132] The enhanced call chain included in the aspect is a single enhanced business interface; or, a call chain obtained by arranging multiple enhanced business interfaces.

[0133] Specifically, the processing module 802 is further used for:

[0134] When the slice includes multiple enhanced call links, the execution priorities of the multiple enhanced call links are configured, and the execution priorities of the multiple enhanced call links indicate the execution order of the multiple enhanced call links.

[0135] Specifically, the processing module 802 is further used for:

[0136] The configuration information of each slice is converted into an adjacency list for storage.

[0137] Specifically, the processing module 802 is specifically used for:

[0138] Before executing the original orchestration link, a subgraph isomorphism algorithm is used to iteratively search the multiple entry point call links to obtain at least one target call link matching the original orchestration link.

[0139] Specifically, the processing module 802 is specifically used for:

[0140] Converting the original orchestration link into a first graph structure, and converting the multiple entry point call links into corresponding second graph structures respectively;

[0141] A subgraph isomorphism algorithm is used to traverse each subgraph structure included in the first graph structure, and when a subgraph structure is isomorphic to the second graph structure, an entry point call link corresponding to the second graph structure is used as the target call link.

[0142] Specifically, the weaving module 803 is used to:

[0143] The target orchestration link is executed to obtain an execution result, and the execution process of the target orchestration link is visualized.

[0144] Based on the same technical concept, the embodiment of the present application provides a computer device, which can be Figure 1 The server shown, such as Fig. 9 As shown, it includes at least one processor 901 and a memory 902 connected to the at least one processor. The specific link medium between the processor 901 and the memory 902 is not limited in the embodiment of the present application. Fig. 9 For example, the processor 901 and the memory 902 are connected via a bus. The bus can be divided into an address bus, a data bus, a control bus, etc.

[0145] In the embodiment of the present application, the memory 902 stores instructions executed by at least one processor 901, and the at least one processor 901 can perform the steps of the above-mentioned interface orchestration method by executing the instructions stored in the memory 902.

[0146] Among them, the processor 901 is the control center of the computer device, and can use various interfaces and lines to connect various parts of the computer device, and realize interface arrangement by running or executing instructions stored in the memory 902 and calling data stored in the memory 902. Optionally, the processor 901 may include one or more processing modules, and the processor 901 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 901. In some embodiments, the processor 901 and the memory 902 may be implemented on the same chip, and in some embodiments, they may also be implemented separately on independent chips.

[0147] Processor 901 can be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit (ASIC), a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, and can implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor can be a microprocessor or any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware processor for execution, or can be executed by a combination of hardware and software modules in the processor.

[0148] The memory 902 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory 902 may include at least one type of storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (Random Access Memory, RAM), a static random access memory (Static Random Access Memory, SRAM), a programmable read-only memory (Programmable Read Only Memory, PROM), a read-only memory (Read Only Memory, ROM), an electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic memory, a disk, an optical disk, etc. The memory 902 is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer device, but is not limited thereto. The memory 902 in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, for storing program instructions and / or data.

[0149] Based on the same inventive concept, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program that can be executed by a computer device. When the program runs on the computer device, the computer device executes the steps of the above-mentioned interface arrangement method.

[0150] Based on the same inventive concept, an embodiment of the present application provides a computer program product, including a computer program stored on a computer-readable storage medium, wherein the computer program includes program instructions. When the program instructions are executed by a computer device, the computer device executes the steps of the above-mentioned interface arrangement method.

[0151] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0152] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, 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, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0153] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0154] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0155] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. An interface arrangement method, characterized in that: include: Get the original orchestration link; Acquire at least one target call link matching the original orchestration link from a plurality of pre-configured entry point call links, wherein each target call link is the same as a sub-orchestration link of the original orchestration link; each target call link is associated with at least one aspect, and each aspect includes: an entry point in the original orchestration link and a corresponding enhanced call link; According to the entry points contained in each aspect, the enhanced call link contained in each aspect is woven into the original orchestration link to obtain the target orchestration link.

2. The method according to claim 1, characterized in that The entry point call link is a single business interface; or a call chain obtained by arranging multiple business interfaces; For each aspect associated with the entry point call link, the entry point included in the aspect is located before the starting business interface or after the ending business interface of the entry point call link; The enhanced call chain included in the aspect is a single enhanced business interface; or, a call chain obtained by arranging multiple enhanced business interfaces.

3. The method according to claim 2, characterized in that Also includes: When the slice includes multiple enhanced call links, the execution priorities of the multiple enhanced call links are configured, and the execution priorities of the multiple enhanced call links indicate the execution order of the multiple enhanced call links.

4. The method according to claim 2, characterized in that Also includes: The configuration information of each slice is converted into an adjacency list for storage.

5. The method according to claim 1, characterized in that The acquiring, from the pre-configured multiple entry point call links, at least one target call link matching the original orchestration link comprises: Before executing the original orchestration link, a subgraph isomorphism algorithm is used to iteratively search the multiple entry point call links to obtain at least one target call link matching the original orchestration link.

6. The method according to claim 5, characterized in that The iterative search of the multiple entry point call links by using a subgraph isomorphism algorithm to obtain at least one target call link matching the original orchestration link includes: Converting the original orchestration link into a first graph structure, and converting the multiple entry point call links into corresponding second graph structures respectively; A subgraph isomorphism algorithm is used to traverse each subgraph structure included in the first graph structure, and when a subgraph structure is isomorphic to the second graph structure, an entry point call link corresponding to the second graph structure is used as the target call link.

7. The method according to any one of claims 1 to 6, characterized in that: After the enhanced call link included in each slice is woven into the original orchestration link according to the entry point included in each slice, and the target orchestration link is obtained, the method further includes: The target orchestration link is executed to obtain an execution result, and the execution process of the target orchestration link is visualized.

8. An interface arrangement device, characterized in that: include: An acquisition module is used to obtain the original orchestration link; A processing module, configured to obtain at least one target call link matching the original orchestration link from a plurality of pre-configured entry point call links, wherein each target call link is the same as a sub-orchestration link of the original orchestration link; each target call link is associated with at least one aspect, and each aspect includes: an entry point in the original orchestration link and a corresponding enhanced call link; The weaving module is used to weave the enhanced call link contained in each slice into the original orchestration link according to the entry point contained in each slice, so as to obtain the target orchestration link.

9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of any one of the methods of claims 1 to 7 are implemented.

10. A computer-readable storage medium, characterized in that: It stores a computer program executable by a computer device. When the program is run on the computer device, the computer device executes the steps of any method described in claims 1 to 7.

11. A computer program product, characterized in that The computer program product comprises a computer program stored on a computer-readable storage medium, wherein the computer program comprises program instructions, and when the program instructions are executed by a computer device, the computer device is caused to execute the steps of the method according to any one of claims 1 to 7.

Images