CN114756507A - Transaction drop point query method, device, equipment and medium - Google Patents

Transaction drop point query method, device, equipment and medium Download PDF

Info

Publication number
CN114756507A
CN114756507A CN202210291743.3A CN202210291743A CN114756507A CN 114756507 A CN114756507 A CN 114756507A CN 202210291743 A CN202210291743 A CN 202210291743A CN 114756507 A CN114756507 A CN 114756507A
Authority
CN
China
Prior art keywords
application
transaction
information
server
service
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210291743.3A
Other languages
Chinese (zh)
Inventor
苑普光
何恺
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Industrial and Commercial Bank of China Ltd ICBC
Original Assignee
Industrial and Commercial Bank of China Ltd ICBC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Industrial and Commercial Bank of China Ltd ICBC filed Critical Industrial and Commercial Bank of China Ltd ICBC
Priority to CN202210291743.3A priority Critical patent/CN114756507A/en
Publication of CN114756507A publication Critical patent/CN114756507A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/14—Details of searching files based on file metadata
    • G06F16/148—File search processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/1805—Append-only file systems, e.g. using logs or journals to store data
    • G06F16/1815—Journaling file systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Library & Information Science (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • General Business, Economics & Management (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The disclosure provides a transaction placement query method which can be applied to the technical field of big data. The method comprises the following steps: acquiring first service main key information of a transaction to be inquired and information of a first service transaction scene to which the first service main key information belongs; acquiring an application link configured aiming at a first service transaction scene to obtain a first application link; determining transaction identification information used for identifying a transaction to be queried in any first application in a first application link; and determining a drop point server executing the transaction to be inquired by retrieving the transaction identification information from the logs of the S servers of the first application. The present disclosure also provides a transaction placement query apparatus, device, storage medium and program product.

Description

Transaction drop point query method, device, equipment and medium
Technical Field
The present disclosure relates to the field of big data technologies, and more particularly, to a method, an apparatus, a device, a medium, and a program product for transaction drop point query.
Background
The digitalized transformation of enterprise information is more and more rapid, and a series of technical transformation buxus arrive in order to improve the response capability of the system, reduce the production risk of business and accelerate the parallel butt joint with the outside. The improvement of various technical classes increases the number of servers, program sets and the like of each application, and particularly, for a service scene with a long link, the path branches of the service scene are more multiplied. Problems occurring in the transformation process, effect evaluation after transformation and the like all need to go deep into an application layer, a server layer and a log layer for analysis, and the series of analysis must be established on accurate execution path monitoring.
In the process of implementing the disclosed concept, the inventor finds that at least the following problems exist in the prior art: at present, when transaction path monitoring is carried out, either manual traversal retrieval and determination are carried out by workers, or a specific query tool is developed for partial application to position, so that the efficiency is low, and the universality is difficult.
Disclosure of Invention
In view of the foregoing, the present disclosure provides a method, apparatus, device, medium, and program product for universal, automated transaction drop point query.
In a first aspect of the embodiments of the present disclosure, a method for querying a transaction placement is provided. The method comprises the following steps: acquiring first service main key information of a transaction to be inquired and information of a first service transaction scene to which the first service main key information belongs; acquiring an application link configured for the first service transaction scene to obtain a first application link; the application link is a process formed by connecting each application program in N application programs serving as processing nodes, wherein N is an integer greater than or equal to 2; determining transaction identification information used for identifying the transaction to be queried in any first application in the first application link; and determining a landing server for executing the transaction to be inquired by retrieving the transaction identification information from logs of S servers of the first application, wherein S is an integer greater than or equal to 2. When determining the transaction identification information used for identifying the transaction to be queried in any first application in the first application link, the method includes: when the first application is the first application program in the first application link, determining that the transaction identification information is the first service key information; and when the first application is an application program except the first application program, determining the transaction identification information according to a transaction information transfer mode between the first application program and an upstream application program thereof in the first application link.
According to an embodiment of the present disclosure, the transaction information transfer method includes: the first application and the upstream application program thereof identify the same transaction by the same service key information; or the upstream application of the first application generates event information after processing a transaction and transmits the event information to the first application, wherein the first application identifies the transaction transferred from the upstream application of the first application by using the event information.
According to an embodiment of the present disclosure, the method further comprises: and configuring the transaction information transfer mode between each application program in the R application programs and other application programs, wherein the R application programs comprise all application programs in the first application link.
According to an embodiment of the present disclosure, the method further comprises: and configuring M application links in one-to-one correspondence with M service transaction scenes, wherein M is an integer greater than or equal to 1, and the M service transaction scenes comprise the first service transaction scene.
According to an embodiment of the present disclosure, the determining a landing server executing the transaction to be queried by retrieving the transaction identification information from the logs of the S servers of the first application includes: performing log retrieval on the S servers one by one; and after a target log containing the transaction identification information is retrieved, taking a server where the target log is located as the drop point server.
According to an embodiment of the present disclosure, the performing log retrieval server by server in the S servers includes: and in each server, retrieving the logs generated in a preset time period from the completion time of the transaction to be inquired.
According to the embodiment of the present disclosure, after the server where the target log is located is taken as the drop point server, the method further includes: downloading the target log; and/or correspondingly outputting the information of the first application program and the information of the drop point server.
According to an embodiment of the present disclosure, the method further includes setting a tag to a server of each of R applications, where the tag is information marked in a natural language and plays a role of identification, and where the R applications include all applications in the first application link. The correspondingly outputting the information of the first application program and the information of the drop point server comprises: and correspondingly outputting the name of the first application program and the label of the drop point server.
According to an embodiment of the present disclosure, the correspondingly outputting the information of the first application and the information of the drop point server further includes: and displaying the information of each application program of the first application link and the information of the corresponding drop point server in pairs according to the sequence of the application programs in the first application link.
According to an embodiment of the present disclosure, acquiring the first service key information includes: and responding to the initiation of the transaction to be inquired, and acquiring the first service key information.
In a second aspect of the disclosed embodiments, a transaction placement query device is provided. The device comprises a transaction module, a transaction chain module, a determination module and a query module. The transaction module is used for acquiring the first service key information of the transaction to be inquired and the information of the first service transaction scene to which the first service key information belongs. The transaction chain module is used for acquiring an application link configured for the first service transaction scenario to obtain a first application link; the application link is a process formed by connecting each of N application programs serving as processing nodes, wherein N is an integer greater than or equal to 2. The determining module is used for determining transaction identification information used for identifying the transaction to be inquired in any first application in the first application link. The query module is configured to determine a drop point server for executing the transaction to be queried by retrieving the transaction identification information from logs of S servers of the first application, where S is an integer greater than or equal to 2. The determining module is specifically configured to determine that the transaction identification information is the first service key information when the first application is a first application program in the first application link; and when the first application is an application program except the first application program, determining the transaction identification information according to a transaction information transfer mode between the first application program and an upstream application program thereof in the first application link.
According to an embodiment of the present disclosure, the apparatus further comprises a first configuration module. The first configuration module is configured to configure the transaction information forwarding manner between each of R application programs and other application programs, where the R application programs include all application programs in the first application link.
According to an embodiment of the present disclosure, the apparatus further comprises a second configuration module. The second configuration module is configured to configure M application links corresponding to M service transaction scenarios one to one, where M is an integer greater than or equal to 1, and the M service transaction scenarios include the first service transaction scenario.
According to an embodiment of the present disclosure, the apparatus further comprises an output module. The output module is used for correspondingly outputting the information of the first application program and the information of the drop point server.
According to an embodiment of the present disclosure, the apparatus further comprises a tag module. The tag module is configured to set a tag for a server of each of R applications, where the tag is information marked in a natural language and plays a role in identification, and the R applications include all applications in the first application link. Correspondingly, the output module is specifically configured to output the name of the first application program and the label of the drop point server correspondingly.
In a third aspect of the disclosed embodiments, an electronic device is provided. The electronic device includes one or more processors, and one or more memories. The one or more memories are for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to perform the above-described methods.
In a fourth aspect of the embodiments of the present disclosure, there is also provided a computer-readable storage medium having stored thereon executable instructions, which when executed by a processor, cause the processor to perform the above-mentioned method.
In a fifth aspect of the embodiments of the present disclosure, there is also provided a computer program product comprising a computer program which, when executed by a processor, implements the above method.
Drawings
The foregoing and other objects, features and advantages of the disclosure will be apparent from the following description of embodiments of the disclosure, taken in conjunction with the accompanying drawings of which:
FIG. 1 schematically illustrates an application scenario diagram of a transaction drop point query method, apparatus, device, medium and program product according to an embodiment of the disclosure;
FIG. 2 schematically illustrates a flow diagram of a transaction drop point query method according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow chart of determining a drop point server through log retrieval in a transaction drop point query method according to an embodiment of the disclosure;
FIG. 4 schematically shows an architectural illustration of an application link according to an embodiment of the present disclosure;
FIG. 5 schematically illustrates a transaction drop point query method flow, according to an embodiment of the disclosure;
FIG. 6 schematically illustrates a transaction drop point query method flow, according to another embodiment of the disclosure;
FIG. 7 schematically illustrates a flow diagram of a transaction drop point query method according to yet another embodiment of the disclosure;
FIG. 8 schematically shows a block diagram of a transaction drop point query device according to an embodiment of the present disclosure;
FIG. 9 schematically illustrates a workflow of a transaction drop point query device during a test process according to an embodiment of the present disclosure; and
fig. 10 schematically illustrates a block diagram of an electronic device suitable for implementing a transaction drop point query method according to an embodiment of the disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs, unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
Herein, the "application link" refers to a flow in which each of N applications is connected as a processing node, where N is an integer greater than or equal to 2. The N applications in one application link are all applications for implementing transactions in the corresponding business transaction scenario, and the connection relationship between the N applications may include serial or parallel. Among them, there is a relation between calling and called between two application programs connected in series. That is, when a transaction is executed, the immediately following downstream application is called by the upstream application.
As used herein, "drop point" refers to a server in each application that performs a transaction, also referred to as a "drop point server".
Various embodiments of the present disclosure provide a versatile, automated transaction landing query method, apparatus, device, medium, and program product by analyzing, refining, and abstracting transaction path monitoring with manual retrieval.
In particular, a transaction placement query method implemented according to the present disclosure may be implemented by the following operations. First, first service key information of a transaction to be inquired and information of a first service transaction scene to which the first service key information belongs are obtained. Then, an application link configured for the first service transaction scenario is obtained, and a first application link is obtained. And then, determining transaction identification information used for identifying the transaction to be inquired in any first application in the first application link, wherein when the first application is a first application program in the first application link, the transaction identification information is determined to be first service main key information, and when the first application is an application program except the first application program, the transaction identification information is determined according to a transaction information transfer mode between the first application program and an upstream application program in the first application link. And then, the transaction identification information is searched in logs of S servers of the first application, and a drop point server for executing the transaction to be inquired is determined, wherein S is an integer greater than or equal to 2.
According to the embodiment of the disclosure, a business transaction scene and a corresponding application link are configured through user operation, and then positioning query can be performed on a drop point server of any transaction in the business transaction scene under any application. Therefore, the method can be used independently of industries, business transaction scenes, transactions and application programs, so that the query of the transaction placement point is decoupled from the industries, the scenes, the transactions and the application programs, the special service for a certain industry or a certain specific business transaction scene is not needed, the binding relationship can be configured according to the analysis and monitoring requirements, and a universal solution framework for the query of the transaction placement point is realized.
Fig. 1 schematically illustrates an application scenario diagram of a transaction drop point query method, apparatus, device, medium, and program product according to embodiments of the disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, the application scenario 100 according to this embodiment may include at least one terminal device (three are shown, terminal devices 101, 102, 103), a network 104, a server 105, a network 106, and clusters 107, 108. The network 104 is used to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 106 is used to provide communication links between the server 105 and the clusters 107, 108. The networks 104, 106 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The server 105 may be a server that provides various services, such as a backend management server for a website (for example only).
Clusters 107, 108 are clusters of servers running different applications, respectively. For example, cluster 107 is a cluster of servers running application a, e.g., 4 servers are illustrated. Cluster 108 is a cluster of servers running application B, e.g., 4 servers are illustrated.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like.
For example, a user initiates a transaction to the server 105 using a client application in the terminal devices 101, 102, 103. After receiving the transaction request of the transaction, the server 105 may forward the transaction request to a corresponding application program for specific execution according to the business transaction application scenario to which the transaction belongs. It is assumed that when a transaction in the business transaction scenario needs to be completed by both the application a and the application B, where the application a is an upstream application of the application B, the server 105 may forward the transaction request to a server (e.g., a1) in the cluster 107 running the application a for processing, after the processing of the server a1 in the cluster 107 is completed, the server invokes a server (e.g., B2) in the cluster 108 running the application B for processing, after the processing of the server B2 in the cluster 108 is completed, the processing result may be fed back to the server 105, and then the server 105 may feed back the final processing result to the terminal devices 101, 102, and 103. In this case, the application link of the business transaction scenario to which the transaction initiated by the user belongs is application a- > application B, and the execution path information of the transaction is "application a, server a 1" - > "application B, server B1".
In some embodiments, the networks 104, 106 may communicate. In other embodiments, the networks 104, 106 may be the same network or partially overlapping networks. Correspondingly, the terminal devices 101, 102, 103 may also be connected to the clusters 107, 108 via the networks 104, 106. Thus, the user may also initiate related transactions to the clusters 107 and/or 108 using the terminal devices 101, 102, 103. When a transaction needs to be completed by the application a and the application B together and the application a is an upstream application of the application B, the user may also send a transaction request to the cluster 107 through the terminal devices 101, 102, and 103, where the transaction request may reach the server a1 in the cluster 107, call the server B2 in the cluster 108 after the processing of the server a1 in the cluster 107 is completed, and feed back the processing result to the terminal devices 101, 102, and 103 after the processing of the server B2 in the cluster 108 is completed.
It is understood that the above examples in which only two applications are connected in series in the application link are merely exemplary, and the disclosure is not limited to the number of applications in the application link and the series-parallel relationship.
It should be noted that the transaction drop point query method provided by the embodiment of the present disclosure may be generally executed by the server 105. For example, the server 105 may query a transaction to be queried determined based on the operation of the user in the terminal device 101, 102, 103, a landing server in each application (e.g., application a and/or application B), and may form execution path information of the transaction to be queried, and the like. Accordingly, the transaction placement query device, apparatus, medium, and program product provided by the embodiments of the present disclosure may also be provided in the server 105. Of course, in other implementations, the transaction drop point query method provided by the embodiments of the present disclosure may also be executed by the cluster 107 or the cluster 108. Correspondingly, the transaction drop point query device provided by the embodiment of the present disclosure may also be disposed in the cluster 107 or the cluster 108.
It should be understood that the number of end devices, networks, servers, and clusters in fig. 1 is merely illustrative. There may be any number of end devices, networks, servers, and clusters, as desired for implementation.
The transaction drop point query method according to the embodiment of the present disclosure will be described in detail through fig. 2 to 7 based on the application scenario described in fig. 1, in which the method of the embodiment of the present disclosure performed by the server 105 is taken as an example for explanation.
Fig. 2 schematically illustrates a flow diagram of a transaction drop point query method according to an embodiment of the present disclosure.
As shown in fig. 2, the transaction drop point query method according to this embodiment may include operations S210 to S240.
In operation S210, first service key information of a transaction to be queried and information of a first service transaction scenario to which the first service key information belongs are acquired.
The first service key information is the unique identification information of the transaction to be inquired. Such as an order number in an order payment transaction or a delivery order number in a logistics delivery, etc.
In one embodiment, the first service primary key information and the information of the first service transaction scenario to which the first service primary key information belongs can be input through the operation of the user in the terminal device 101, 102, 103. For example, when a tester wants to monitor a product gray level operation status, or an IPV4/IPV6 switching situation, or a switching operation effect of a large host and an open platform, a corresponding front-end page may be developed, and then the tester may open the front-end page in the terminal device 101, 102, 103, select transaction scenario information to which a transaction to be queried belongs, and input first service primary key information.
In one embodiment, the server 105 may also automatically obtain the first service key information and the information of the first service transaction scenario. For example, through script configuration, the server 105 may obtain the service key information of all transactions in a certain service transaction scenario within a certain period of time at regular time or triggered by a condition, so that each transaction in the service transaction scenario within the certain period of time may be respectively used as a transaction to be queried. The server 105 may extract the service primary key information from the processing result information fed back to the terminal devices 101, 102, 103 when acquiring the service primary key information.
According to one embodiment of the disclosure, first service primary key information may be acquired in response to initiation of a transaction to be queried. For example, when a user initiates a transaction to be queried through the terminal devices 101, 102, and 103, the server 105 processes a received transaction request, and then obtains the service key information of the transaction while forwarding the transaction request to a corresponding application cluster, in this way, the service key information of the transaction to be queried may be automatically obtained.
In operation S220, an application link configured for the first service transaction scenario is obtained, so as to obtain a first application link. The application link is a process formed by connecting each application program in N application programs serving as processing nodes, wherein N is an integer greater than or equal to 2.
The application link configured for each business transaction scenario in the implementation of the present disclosure is an execution flow composed of application programs for implementing transactions in the business transaction scenario.
Besides the transfer and call relations between the application programs, the application link may also include detailed information such as server information under each application program (such as server ip, server user name, server password and/or server identification), and log information in each server (such as log path, log file type, etc.).
In operation S230, transaction identification information for identifying a transaction to be queried in any first application in the first application link is determined.
And when the first application is the first application program in the first application link, determining the transaction identification information as the first service main key information.
And when the first application is an application program except the first application program, determining the transaction identification information according to a transaction information transfer mode between the first application and an upstream application program thereof in the first application link.
The transaction information transfer method between the application programs can be generally divided into two types: first, the adjacent upstream and downstream applications all identify the same transaction with the same business key information (this way will be referred to as "the first switching way" hereinafter); second, the upstream application generates event information (e.g., recorded by a specific field) after processing a transaction, and delivers the event information to the downstream application, so that the downstream application can identify the transaction forwarded from the upstream application with the event information (hereinafter, this manner is referred to as "second forwarding manner").
When the first application is switched with the upstream application according to the first switching mode, the transaction identification information of the transaction to be inquired in the first application is the service key information of the transaction to be inquired in the upstream application. For example, when the upstream application of the first application is the first application program in the first application link, the transaction identification information in the first application is the first service primary key information. For another example, when the upstream application of the first application is an application program in the middle link of the first application link, if the transfer manner of the transaction information among the application programs before the first application in the first application link is a first transfer manner, the transaction identification information in the first application is still the first service key information; however, if there is a second forwarding method in the forwarding method of the transaction information among the plurality of application programs before the first application in the first application link, the service key information of the transaction to be queried in the upstream application of the first application needs to be queried, where the queried service key information may not be the same as the first service key information.
When the transaction information is transferred between the first application and the upstream application thereof according to the second transfer method, the event information needs to be queried from the log record of the transaction to be queried recorded in the upstream application of the first application, so as to serve as the transaction identification information of the transaction to be queried in the first application.
In operation S240, a drop point server for executing a transaction to be queried is determined by retrieving transaction identification information in logs of S servers of the first application, where S is an integer greater than or equal to 2.
In the transaction drop point query method of the embodiment of the disclosure, a user can selectively query the drop point server in any one or more application programs in the first application link according to requirements. For example, only one or some of the applications may be grayed, and at this time, only the grayed application may be used as the first application to query the drop point server therein.
Alternatively, according to other embodiments of the present disclosure, each application may be queried for its landing server in the order of all applications in the first application link. Namely, all the application programs in the first application link are sequentially used as the first application program to perform retrieval query according to the sequence. Therefore, the execution path information of the transaction to be inquired can be correspondingly obtained. In this way, transaction identification information can be retrieved from different application servers based on a service transaction scene and an application link thereof configured by a user in advance, complete detection of an execution path of a transaction in the service transaction scene is realized, and efficiency of monitoring the execution path of a long-link transaction is improved.
Fig. 3 schematically shows a flowchart of determining a drop point server through log retrieval in a transaction drop point query method according to an embodiment of the present disclosure. Fig. 4 schematically shows an architectural illustration of an application link according to an embodiment of the present disclosure.
As shown in fig. 3, the process of determining the drop point server in operation S240 according to the embodiment may include operations S301 to S303. This is explained below with reference to the example of fig. 4.
First, in operation S301, a log search is performed server by server among S servers.
Referring to fig. 4, assume that the application link for the transaction to be queried is application a- > application B. In determining the drop point server in application a, log retrieval may be performed from the four servers a1, a2, A3, and a4 of application a one by one. Accordingly, in determining the drop point server in application B, the log retrieval is also performed one by one from the four servers B1, B2, B3, and B4 of application B
Considering that one application program may be used in a plurality of business transaction scenarios and a large number of transactions may be performed at the same time, when log retrieval is performed in each server, logs generated within a predetermined time (for example, 1 hour) before the completion of a transaction to be queried may be retrieved, so that not only are loophole logs avoided, but also retrieval of a large number of logs is avoided.
Then, in operation S302, after the target log containing the transaction identification information is retrieved, the server where the target log is located is used as the drop point server.
In one embodiment, when the transaction identifying information is retrieved, the retrieval may be stopped and the current application may be skipped. For example, in the example of fig. 4, log retrieval may be performed in the server of application a first, and once the transaction identification information is retrieved, application a may be skipped and then log retrieval may be performed one by one to the four servers of application B. In this way, the transaction identification information can be retrieved from different application servers according to the calling relationship priority of the application program in the first application link, so that the complete monitoring and tracking of the execution path of the transaction to be queried can be realized.
In some embodiments, the target log may be downloaded before the current application is popped out for subsequent queries, widening the personalized query usage.
Next, in operation S303, information of the first application and information of the drop point server are correspondingly output. For example, application A-Server A1.
In some implementations, a tag may be set in advance for the server of each of the R applications, where the tag is the identifying information marked in the natural language, where the R applications include all applications in the first application link.
Generally, servers are encoded and distinguished by serial numbers and the like, and servers of different types or different manufacturers may be identified differently. The effect of effectively distinguishing the servers is difficult to achieve by using identification information such as serial numbers for users of pure IT technologies such as testers and operation and maintenance personnel, so in some embodiments of the present disclosure, the servers under each application program can be distinguished explicitly by setting a tag marked in a natural language for the servers. In this way, in operation S303, the name of the first application program and the label of the drop point server may be correspondingly output, so that a user, such as a tester or an operation and maintenance worker, may quickly and clearly locate the drop point server from the multiple servers of each application program.
In other implementations, when a drop point server is determined for each application in the first application link, the information for each application in the first application link and the information for the corresponding drop point server may be presented in pairs in the order of the applications in the first application link. Therefore, complete execution path information of the transaction to be queried can be displayed, and complete monitoring of the execution path of the transaction to be queried is realized.
When a drop point server is determined for each application in the first application link, the process of performing log retrieval may be divided into an application layer, a server layer, and a log layer as a whole. The retrieval sequence of the application layer is subject to the sequence of the application programs in the application link; the retrieval sequence of the server layer is based on the front-back sequence of the server labels maintained by the operator under each application; after entering the log layer, the retrieval can be sequentially carried out from front to back according to the printing sequence of the log lines.
Fig. 5 schematically shows a transaction drop point query method flow according to an embodiment of the disclosure. The corresponding application link in the business transaction scenario shown in fig. 5 involves two applications: application a and application B, each deploying 4 servers. Reference may be made in particular to the illustration of fig. 4. In the scenario of fig. 5, application a and application B may be connected in series and perform information forwarding according to the first forwarding manner described above, that is, both application a and application B identify the same transaction with the same service primary key information. It should be noted that the following description of the flow shown in fig. 5 is only an exemplary embodiment of the transaction drop point query method according to the embodiment of the disclosure, and does not limit the disclosure.
As shown in FIG. 5, the specific implementation of the transaction drop point query method may include steps S51-S58.
S51: the user (e.g., tester, operation and maintenance personnel, supervisor, etc.) adds a new service transaction scenario name in the front-end page of the terminal device 101, 102, 103.
S52: the user maintains detailed information of the application programs a and B under the name of the business transaction scene name, such as an application name, a server ip, a server user name, a server password, a log path, a log file, and a server flag.
S53: and the user initiates the transaction under the name of the business transaction scene and records the business main key information.
S54: the user selects a service transaction scenario name in the front end page of the terminal device 101, 102, 103 and inputs service primary key information.
S55: the server 105 automatically connects to the server a1, and queries the logs within one hour (the time can be preset in the system) from the transaction completion time according to the log path and the file name, so as to avoid querying a large amount of logs.
S56: and sequentially matching the service key information input by the user according to the log printing sequence. Once the information match is successful, the log file under the server A1 is automatically downloaded and jumps out of the server A1 to server B1 for the same logical search. If the service main key information is not matched in the server A1, the server A1 is automatically jumped out, the server A2 is entered to search the same logic, and the process is repeated until the application program A is jumped out after the service main key information is searched in the four servers of the application program A. And then enter application B to perform the same logical search.
S57: accurately matching information of two servers (namely, drop point servers) containing service main key information in the searched logs with a server label maintained by a user in advance, and after matching is successful, searching a result according to an application program A-server label; the application B-server tag "is output to the front page in the terminal apparatus 101, 102, 103 and displayed.
S58: the user can download the log (namely, the target log) for retrieving the service main key information in the system by himself for personalized retrieval under other purposes.
If the subsequent server landing point retrieval requirements of other transactions in the same business transaction scene exist, S53-S58 can be directly executed.
Fig. 6 schematically shows a transaction drop point query method flow according to another embodiment of the disclosure. The corresponding application link in the business transaction scenario shown in fig. 6 involves two applications: application a and application B, each deploying 4 servers. Reference may be made in particular to the illustration of fig. 4. In the scenario of fig. 6, the application a and the application B may be connected in series, and perform information forwarding according to the second forwarding manner described above, that is, after the processing of the application a is completed, an event information (e.g., an event number) is generated, and then the event number and the intermediate processing result of the transaction are transmitted to the application B. It should be noted that the following description of the flow shown in fig. 6 is only an exemplary embodiment of the transaction drop point query method according to the embodiment of the disclosure, and does not limit the disclosure.
As shown in fig. 6, a specific implementation of the transaction drop point query method may include steps S61-S610.
S61: the user (e.g., tester, operation and maintenance personnel, supervisor, etc.) adds the name of the service transaction scenario to the front-end page of the terminal device 101, 102, 103.
S62: the user adds detailed information of the application program A and the application program B under the name of the business transaction scene, such as an application name, a server ip, a server user name, a server password, a log path, a log file, a server label and the like. Meanwhile, the user needs to maintain the transaction information switching mode of the application program A and the application program B in the business transaction scene.
Taking the order payment scenario as an example, a transaction may flow through two applications in sequence (e.g., an online payment application and a personal electronic banking application). Assuming that the application program A is an online payment application and the application program B is a personal electronic banking application, the application program B needs to be called through the application program A when one order payment transaction is realized.
When the transaction landing point is queried, for the same payment transaction, when the log is searched in the application program B, the "event number" of the payment transaction needs to be queried from the log of the application program A. When the log in the application program a is searched, the log can be searched depending on the order number (i.e. the service key information) recorded by the user. Therefore, the field name (e.g. serial no) and the inter-application call flag (sign) of the "event number" for the transaction information transfer between the application program a and the application program B can be maintained in the detailed information of the application program a and the application program B in advance for subsequent association retrieval.
S63: and the user initiates the service transaction in the scene and records the service key information.
S64: the user selects a service transaction scene name on the front-end page of the terminal device 101, 102, 103 and inputs service main key information.
S65: the server 105 automatically connects to the server a1, and queries the log within one hour (time can be preset in the system) from the transaction completion time according to the log path and the file name, so as to avoid querying a large amount of logs.
S66: and matching the service main key information input by the user in sequence according to the log printing sequence (for example, from the latest log to the front). Once the information matching of the service main key information is successful, the system starts to accurately search the ' call sign ' (sign) ' of the application program A and the application program B from the log line where the service main key information is located, automatically searches the event number field serialno from the log line where the ' call sign ' (sign) is located after the call sign (sign) is matched, and records the field value after the search is completed to obtain the event number. If the service main key information is not matched in the A1, the server A1 is automatically jumped out to enter other servers in the application program A for sequential retrieval until the service main key information is retrieved and the event number is obtained, and finally, the log file under the server is automatically downloaded.
S67: the server 105 automatically connects to B1 and looks up the log for an hour (time may be preset in the system) from the time of completion of the transaction based on the log path and the file name.
S68: and sequentially matching the fields of the serial no fields according to the log printing sequence, and automatically downloading the log file under the server once the information is successfully matched. If the information is not successfully matched, sequentially searching the servers B2, B3 and B4 until the information is successfully matched.
S69: accurately matching information of two servers (namely, drop point servers) containing service main key information in the searched logs with a server label maintained by a user in advance, and after matching is successful, searching a result according to an application program A-server label; the application B-server tag "is output to the front page in the terminal apparatus 101, 102, 103 and displayed.
S610: the user can download the target log in the system by himself, and personalized retrieval under other purposes is carried out.
If the subsequent server drop point search requirement under the same service transaction scene exists, directly executing S63-S610.
It will be appreciated that the two application scenarios shown in fig. 5 and 6 may constitute a complementary relationship, may represent two typical ways in a transaction landing query scenario, and support extensions under multiple applications.
When 4 servers are hung down by the application programs A and B which form the upstream and downstream relation respectively, 16 kinds of possible point falling situations of the transaction can be obtained by permutation and combination according to the uncertainty of the transaction point falling. When the gray levels of the applications a and B are published, for example, 2 of the applications a and/or B are gray level servers, and the remaining 2 are non-gray level servers, if the drop point server is located by a manual query method, repeated traversal is required, and in an extreme case, 16 repeated queries are required. However, with the transaction drop point query method of the embodiment of the present disclosure, no matter whether the application programs a and B are switched in the first manner or in the second manner, the service transaction scenario information, the corresponding application link, and the switching manner between the upstream and downstream applications need to be maintained at the front end once, and then the service key information is input and the name of the service transaction scenario is selected, so that the matching retrieval can be automatically performed, the repetitive operation cost of manual query by a tester is avoided, and the use effect is very visible.
Fig. 7 schematically illustrates a flow chart of a transaction drop point query method according to yet another embodiment of the present disclosure.
As shown in fig. 7, the transaction placement query method according to this embodiment may further include operation S711 and/or operation S712 before operations S210 to S240.
In operation S711, M application links corresponding to M service transaction scenarios one to one are configured, where M is an integer greater than or equal to 1, and the M service transaction scenarios include a first service transaction scenario.
In operation S712, a transaction information forwarding manner between each of the R applications and other applications is configured, where the R applications include all applications in the first application link.
In an embodiment, as illustrated in fig. 5 and fig. 6, when querying, an application link may be configured for a corresponding service transaction scenario, and a transaction information forwarding manner between application programs in the application link may be configured. And then, if the transactions under the same service transaction scene exist, directly multiplexing.
In other implementations, various business transaction scenarios provided by an organization (e.g., a business or department) may be collected and corresponding application links pre-configured. In addition, various application programs maintained in an organization can be collected, and a transaction information transfer mode between each application program and other application programs can be set according to the calling or called relation between the application program and the other application programs. In this way, the query can be repeated for a long time after one-time maintenance, and the automatic query of the transaction placement point through the whole process is facilitated, so that an application link and the like can be flexibly customized and rapidly deployed according to business needs and the like, and the query of the transaction placement point is decoupled from a specific business transaction scene and an application program.
Therefore, the transaction drop point query method disclosed by the embodiment of the disclosure is wide in application range and convenient to popularize. The method can be widely applied to the aspects of testing the service system, monitoring the state of the server, analyzing the cluster problems and the like. For example, in the business test of daily online payment, after the tester completes the payment business transaction, it needs to pay attention to whether the server through which the transaction flows runs is a grayscale version or a non-grayscale version, or to which server the transaction specifically flows, so as to log in the server to obtain a log to analyze the problem.
Based on the transaction drop point query method of each embodiment, the embodiment of the disclosure also provides a transaction drop point query device. The apparatus will be described in detail below with reference to fig. 8 and 9.
Fig. 8 schematically shows a block diagram of a transaction drop point query device 800 according to an embodiment of the present disclosure.
As shown in fig. 8, the apparatus 800 may include a transaction module 810, a transaction chain module 820, a determination module 830, and a query module 840 according to embodiments of the disclosure. According to still further embodiments of the present disclosure, the apparatus 800 may further include at least one of a first configuration module 850, a second configuration module 860, a tag module 870, or an output module 880. The apparatus 800 may be used to implement the transaction drop point query method described with reference to fig. 2-7.
Specifically, the transaction module 810 is configured to obtain information of a first service key of a transaction to be queried and information of a first service transaction scenario to which the first service key belongs. In one embodiment, the transaction module 810 performs operation S210 described previously.
The transaction chain module 820 is configured to obtain an application link configured for a first service transaction scenario, to obtain a first application link. The application link is a process formed by connecting each application program in N application programs as processing nodes, wherein N is an integer greater than or equal to 2. The transaction chain module 820 may comb the called application programs and the calling relationship in the first service transaction scenario, construct an application link, and implement permutation and combination of the application programs in the first service transaction scenario. In one embodiment, the transaction chain module 820 may perform operation S220 described above.
The determining module 830 is configured to determine transaction identification information used for identifying the transaction to be queried in any first application in the first application link. When the first application is a first application program in a first application link, determining that the transaction identification information is first service main key information; and when the first application is an application program except the first application program, determining the transaction identification information according to a transaction information transfer mode between the first application and an upstream application program thereof in the first application link. In one embodiment, the determining module 830 may perform operation S230 described previously.
The query module 840 is configured to determine a drop point server for executing a transaction to be queried by retrieving transaction identification information from logs of S servers of the first application, where S is an integer greater than or equal to 2. In one embodiment, the query module 840 may perform operation S240 described above.
The query module 840 may perform a precise retrieval in a log of a plurality of servers of the first application based on the first service primary key information.
The first configuration module 850 is configured to configure a transaction information forwarding manner between each of the R applications and other applications, where the R applications include all applications in the first application link. In one embodiment, the first configuration module 850 may perform operation S712 described previously.
The second configuration module 860 is configured to configure M application links corresponding to M service transaction scenarios one to one, where M is an integer greater than or equal to 1, and the M service transaction scenarios include the first service transaction scenario. In one embodiment, the second configuration module 860 may perform operation S711 described previously.
The tag module 870 is configured to set a tag for a server of each of the R applications, wherein the tag is information marked in a natural language that serves as an identifier, and wherein the R applications include all applications in the first application link. The tagging module 870 tags information of the application server, and realizes the conversion from recessive information to dominant information. Accordingly, the output module 880 may output the name of the first application and the label of the drop point server, correspondingly. Therefore, the execution path of the transaction is conveniently and clearly positioned by the user by means of server information tagging.
The output module 880 is configured to output information of the first application and information of the drop point server correspondingly.
Fig. 9 schematically illustrates a workflow of the transaction drop point query device 800 in a test process according to an embodiment of the present disclosure, wherein the illustration of fig. 9 is merely exemplary and does not limit the device 800.
As shown in fig. 9, the operation workflow of each module in the transaction drop point query device 800 in the test process may include steps 1) to 7).
Step 1), the user initiates a business transaction through interaction with the transaction module 810.
Step 2), the business transaction is processed by each application server to generate business main key information;
step 3), inputting service key information in the query module 840 based on user operation for retrieval and matching;
step 4), the query module 840 receives information such as an application link and a transaction information forwarding mode pre-configured in the transaction chain module 820 (through the first configuration module 850 and the second configuration module 860), and executes query according to the information; wherein, the function of receiving the query thread in the query module 840 in step 4) is substantially the same as that of the determination module 830;
step 5), the query module 840 interacts with servers under various application programs, such as connection, log extraction, primary key information retrieval, server information return and the like;
step 6), the query module 840 performs relational mapping between the returned recorded server information and the server tag preset in the tag module 870.
And 7), correspondingly outputting the name of the application program and the label of the drop point server by an output module 880, and providing the output to a user.
Any of the transaction module 810, the transaction chain module 820, the determination module 830, the query module 840, the first configuration module 850, the second configuration module 860, the tag module 870, or the output module 880 may be combined into one module or any one of them may be split into multiple modules according to embodiments of the present disclosure. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the transaction module 810, the transaction chain module 820, the determination module 830, the query module 840, the first configuration module 850, the second configuration module 860, the tag module 870, or the output module 880 may be implemented at least in part 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 may be implemented in hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or in any one of three implementations of software, hardware, and firmware, or in any suitable combination of any of them. Alternatively, at least one of the transaction module 810, the transaction chain module 820, the determination module 830, the query module 840, the first configuration module 850, the second configuration module 860, the tag module 870 or the output module 880 may be implemented at least in part as a computer program module that when executed may perform a corresponding function.
Fig. 10 schematically illustrates a block diagram of an electronic device suitable for implementing a transaction drop query method according to an embodiment of the disclosure.
As shown in fig. 10, an electronic device 1000 according to an embodiment of the present disclosure includes a processor 1001 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. Processor 1001 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 1001 may also include onboard memory for caching purposes. The processor 1001 may comprise a single processing unit or a plurality of processing units for performing the different actions of the method flows according to embodiments of the present disclosure.
In the RAM1003, various programs and data necessary for the operation of the electronic apparatus 1000 are stored. The processor 1001, ROM 1002, and RAM1003 are connected to each other by a bus 1004. The processor 1001 performs various operations of the method flow according to the embodiments of the present disclosure by executing programs in the ROM 1002 and/or the RAM 1003. Note that the program may also be stored in one or more memories other than the ROM 1002 and the RAM 1003. The processor 1001 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in one or more memories.
Electronic device 1000 may also include an input/output (I/O) interface 1005, the input/output (I/O) interface 1005 also being connected to bus 1004, according to an embodiment of the present disclosure. Electronic device 1000 may also include one or more of the following components connected to I/O interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output portion 1007 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 1008 including a hard disk and the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The driver 1010 is also connected to the I/O interface 1005 as necessary. A removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1010 as necessary, so that a computer program read out therefrom is mounted into the storage section 1008 as necessary.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 1002 and/or the RAM1003 described above and/or one or more memories other than the ROM 1002 and the RAM 1003.
Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated in the flow chart. When the computer program product runs in a computer system, the program code is used for causing the computer system to realize the method provided by the embodiment of the disclosure.
The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 1001. The systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted in the form of a signal on a network medium, distributed, downloaded and installed via the communication part 1009, and/or installed from the removable medium 1011. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
In such an embodiment, the computer program may be downloaded and installed from the network through the communication part 1009 and/or installed from the removable medium 1011. The computer program performs the above-described functions defined in the system of the embodiment of the present disclosure when executed by the processor 1001. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user's computing device, partly on the user's device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (15)

1. A transaction placement query method, comprising:
acquiring first service main key information of a transaction to be inquired and information of a first service transaction scene to which the first service main key information belongs;
acquiring an application link configured for the first service transaction scene to obtain a first application link; the application link is a process formed by connecting each application program in N application programs serving as processing nodes, wherein N is an integer greater than or equal to 2;
determining transaction identification information used for identifying the transaction to be queried in any first application in the first application link, including:
when the first application is the first application program in the first application link, determining that the transaction identification information is the first service key information; and
when the first application is an application program except the first application program, determining the transaction identification information according to a transaction information transfer mode between the first application and an upstream application program thereof in the first application link;
and determining a landing server for executing the transaction to be inquired by retrieving the transaction identification information from logs of S servers of the first application, wherein S is an integer greater than or equal to 2.
2. The method of claim 1, wherein the transaction information forwarding manner comprises:
the first application and the upstream application program thereof identify the same transaction by the same business key information; or
The upstream application of the first application generates event information after processing a transaction and transmits the event information to the first application, wherein the first application identifies the transaction transferred from the upstream application of the first application by the event information.
3. The method according to claim 1 or 2, wherein the method further comprises:
and configuring the transaction information transfer mode between each application program in the R application programs and other application programs, wherein the R application programs comprise all application programs in the first application link.
4. The method according to claim 1 or 2, wherein the method further comprises:
and configuring M application links in one-to-one correspondence with M service transaction scenes, wherein M is an integer greater than or equal to 1, and the M service transaction scenes comprise the first service transaction scene.
5. The method of claim 1, wherein the determining a landing server to execute the transaction to query by retrieving the transaction identifying information in a log of S servers of the first application comprises:
performing log retrieval on the S servers one by one; and
and after a target log containing the transaction identification information is retrieved, taking a server where the target log is located as the drop point server.
6. The method of claim 5, wherein said server-by-server log retrieval among said S servers comprises:
and in each server, retrieving the logs generated in a preset time period from the completion time of the transaction to be inquired.
7. The method of claim 5, wherein after taking the server where the target log is located as the drop point server, the method further comprises:
downloading the target log; and/or
And correspondingly outputting the information of the first application program and the information of the drop point server.
8. The method of claim 7, wherein,
the method further comprises the following steps: setting a label for a server of each application program in R application programs, wherein the label is information marked by natural language and used for identification, and the R application programs comprise all the application programs in the first application link;
the correspondingly outputting the information of the first application program and the information of the drop point server comprises: and correspondingly outputting the name of the first application program and the label of the drop point server.
9. The method of claim 7 or 8, wherein the correspondingly outputting the information of the first application and the information of the drop point server further comprises:
and displaying the information of each application program of the first application link and the information of the corresponding drop point server in pairs according to the sequence of the application programs in the first application link.
10. A transaction placement query device, comprising:
the transaction module is used for acquiring first service key information of a transaction to be inquired and information of a first service transaction scene to which the first service key information belongs;
the transaction chain module is used for acquiring an application link configured for the first service transaction scene to obtain a first application link; the application link is a process formed by connecting each application program in N application programs serving as processing nodes, wherein N is an integer greater than or equal to 2;
a determining module, configured to determine transaction identification information used for identifying the transaction to be queried in any first application in the first application link, including:
determining that the transaction identification information is the first service primary key information when the first application is the first application program in the first application link; and
when the first application is an application program except the first application program, determining the transaction identification information according to a transaction information switching mode between the first application program and an upstream application program thereof in the first application link;
and the query module is used for determining a drop point server for executing the transaction to be queried by retrieving the transaction identification information from logs of S servers of the first application, wherein S is an integer greater than or equal to 2.
11. The apparatus of claim 10, wherein the apparatus further comprises:
the first configuration module is configured to configure the transaction information forwarding manner between each of the R application programs and other application programs, where the R application programs include all application programs in the first application link.
12. The apparatus of claim 10, wherein the apparatus further comprises:
and the second configuration module is used for configuring M application links in one-to-one correspondence with M service transaction scenes, wherein M is an integer greater than or equal to 1, and the M service transaction scenes comprise the first service transaction scene.
13. An electronic device, comprising:
one or more processors;
one or more memories for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-9.
14. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1 to 9.
15. A computer program product comprising a computer program which, when executed by a processor, carries out the method according to any one of claims 1 to 9.
CN202210291743.3A 2022-03-22 2022-03-22 Transaction drop point query method, device, equipment and medium Pending CN114756507A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210291743.3A CN114756507A (en) 2022-03-22 2022-03-22 Transaction drop point query method, device, equipment and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210291743.3A CN114756507A (en) 2022-03-22 2022-03-22 Transaction drop point query method, device, equipment and medium

Publications (1)

Publication Number Publication Date
CN114756507A true CN114756507A (en) 2022-07-15

Family

ID=82328161

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210291743.3A Pending CN114756507A (en) 2022-03-22 2022-03-22 Transaction drop point query method, device, equipment and medium

Country Status (1)

Country Link
CN (1) CN114756507A (en)

Similar Documents

Publication Publication Date Title
US11593400B1 (en) Automatic triage model execution in machine data driven monitoring automation apparatus
US10942960B2 (en) Automatic triage model execution in machine data driven monitoring automation apparatus with visualization
CN113987074A (en) Distributed service full-link monitoring method and device, electronic equipment and storage medium
US9104451B2 (en) Dynamic communication between script and execution layers
US20090063175A1 (en) Methods and systems for providing multiple support options
CN111355622A (en) Container traffic monitoring method, system and computer readable storage medium
WO2021072742A1 (en) Assessing an impact of an upgrade to computer software
CN107704357B (en) Log generation method and device
CN110795332A (en) Automatic testing method and device
CN113595886A (en) Instant messaging message processing method and device, electronic equipment and storage medium
CN114756507A (en) Transaction drop point query method, device, equipment and medium
CN115904527A (en) Data processing method, device, equipment and medium
CN114461909A (en) Information processing method, information processing apparatus, electronic device, and storage medium
CN112783903B (en) Method and device for generating update log
CN113392311A (en) Field searching method, field searching device, electronic equipment and storage medium
CN112799797A (en) Task management method and device
CN116401319B (en) Data synchronization method and device, electronic equipment and computer readable storage medium
CN111290870A (en) Method and device for detecting abnormity
CN112819554B (en) Service processing method and device based on page operation and computer equipment
CN114938341B (en) Environment detection method and device, electronic equipment and storage medium
CN118152963A (en) Transaction abnormality detection method, device, electronic equipment and computer storage medium
US11245795B2 (en) System and method of running an agent guide script-flow in an employee desktop web client
US11537503B2 (en) Code editor for user interface component testing
CN116627692A (en) Emergency event handling method, apparatus, device, medium and program product
CN115190008B (en) Fault processing method, fault processing device, electronic equipment and storage medium

Legal Events

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