CN114706827A - Automatic generation method and device for transaction link topology - Google Patents
Automatic generation method and device for transaction link topology Download PDFInfo
- Publication number
- CN114706827A CN114706827A CN202210410555.8A CN202210410555A CN114706827A CN 114706827 A CN114706827 A CN 114706827A CN 202210410555 A CN202210410555 A CN 202210410555A CN 114706827 A CN114706827 A CN 114706827A
- Authority
- CN
- China
- Prior art keywords
- transaction
- application system
- link
- link topology
- journal
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000012544 monitoring process Methods 0.000 claims abstract description 28
- 238000004590 computer program Methods 0.000 claims description 15
- 230000015654 memory Effects 0.000 claims description 14
- 230000004044 response Effects 0.000 claims description 9
- 238000012545 processing Methods 0.000 abstract description 5
- 230000010354 integration Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 11
- 238000004891 communication Methods 0.000 description 8
- 238000012546 transfer Methods 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 6
- 230000000977 initiatory effect Effects 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 4
- 238000005070 sampling Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 239000012634 fragment Substances 0.000 description 2
- 230000036541 health Effects 0.000 description 2
- 238000013024 troubleshooting Methods 0.000 description 2
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
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/17—Details of further file system functions
- G06F16/1734—Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
-
- 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/02—Banking, e.g. interest calculation or account maintenance
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Finance (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 method comprises the steps of acquiring a transaction flow log of each transaction from each application system according to a transaction code, wherein the transaction flow log of each transaction comprises a transaction identifier and a transaction flow sequence number; determining an application system calling link of each transaction according to the transaction identification and the transaction sequence number; identifying an application system calling link of the same type of transaction according to the transaction code; and (4) carrying out integration processing on the application system call links of the same type of transaction to obtain the transaction link topology of the same type of transaction. According to the scheme, the transaction link topologies of various transactions can be obtained, all application systems passing through the transactions can be visually monitored through the transaction link topologies of various transactions, and the transaction scene monitoring is realized.
Description
Technical Field
The present disclosure relates to the field of finance, and in particular, to a method, an apparatus, a computer device, a storage medium, and a computer program product for automatically generating a transaction link topology.
Background
With the continuous development of large enterprise services such as banks and the like, the appeal of monitoring the calling relationship between application systems according to transaction scenes is increasing day by day. In large enterprises such as banks, a transaction first passes through a plurality of application systems and then passes through a plurality of micro-services or modules inside the application systems. When the transaction fails to troubleshoot the failure problem, the failure application system needs to be located first, so that operation and maintenance and developers of the corresponding system can be informed in time.
A transaction link tracking method commonly used in the prior art includes: several important concerned transactions are selected, and the system and calling precedence relation related to the transactions are maintained in the database code table in advance. The method has high manual maintenance cost and poor accuracy. When a user side finds that a certain transaction fails, the user side often needs to manually analyze which systems are involved in the transaction, all development and operation and maintenance personnel involved in the systems need to simultaneously attend to the on-site self-checking problem, and the problem positioning cost is high.
In the prior art, APM monitoring tools such as zipkin and skywalk are used, call link tracking is realized through traceid and span mechanisms, the monitoring granularity of the open source tools is fine, but the level of an application system cannot be embodied, the business meaning of a transaction cannot be identified, the call link between services of the transaction can be inquired only through a globally unique traceid, but the transaction is not known to be a transfer or an account opening, the monitoring according to a transaction scene is not facilitated, and therefore the method cannot be directly applied to the business scene of a bank.
Aiming at the problems of poor accuracy and incapability of monitoring business according to a transaction scene in the prior art, an automatic generation method of transaction link topology is needed.
Disclosure of Invention
To solve the above problems in the prior art, embodiments herein provide a method, an apparatus, a computer device, a storage medium, and a computer program product for automatically generating a transaction link topology.
An embodiment herein provides a method for automatically generating a transaction link topology, the method including: acquiring a transaction running log of each transaction from each application system according to the transaction code, wherein the transaction running log of each transaction comprises a transaction identifier and a transaction running sequence number; determining an application system calling link of each transaction according to the transaction identification and the transaction serial number; identifying an application system calling link of the same type of transaction according to the transaction code; and integrating the application system call links of the same type of transaction to obtain the transaction link topology of the same type of transaction.
According to one aspect of embodiments herein, the process of generating a transaction journal for each transaction by each application system comprises: receiving a transaction code and a transaction identifier of the transaction sent by a first application system and a transaction serial number generated by the previous application system for the transaction, wherein different transaction scenes correspond to different transaction codes, and each transaction has a unique transaction identifier; generating a transaction sequence number of the transaction; and recording the transaction running sequence number, the transaction running sequence number generated by the last application system for the transaction, the transaction code of the transaction and the transaction identification in an original log of the transaction, and generating the transaction running log of the application system for the transaction.
According to an aspect of embodiments herein, determining the application system call link for each transaction according to the transaction identifier and the transaction serial number comprises: acquiring a transaction journal corresponding to the same transaction identifier according to the transaction identifier; analyzing the transaction flow log corresponding to the same transaction identifier into a structured field; taking every two analyzed transaction journal logs as a transaction journal log group, comparing transaction journal serial numbers in the transaction journal log group, and if the same transaction journal serial numbers exist, determining that the application systems corresponding to the transaction journal log group have a serial-chain relationship, otherwise, determining that the serial-chain relationship does not exist; and generating a calling link of the transaction according to the serial link relation of the application system.
According to an aspect of embodiments herein, generating the transaction link topology further comprises: identifying the transaction journal to determine whether a new application system exists, and if so, re-determining the transaction link topology; identifying a timestamp of a transaction journal of each application system in the transaction link topology within a preset time, and if the timestamp is not changed, deleting the application system in the transaction link topology; and if the time stamp changes, updating the time stamp of the application system in the transaction link topology.
According to one aspect of embodiments herein, the method further comprises: calculating monitoring indexes of transaction flow logs of each application system, wherein the monitoring indexes comprise transaction success rate, transaction amount and average response time; and adding the monitoring indexes of the application systems into the transaction link topology as leaf nodes of the corresponding application systems.
According to one aspect of embodiments herein, the method further comprises: receiving an inquiry request sent by a client, wherein the inquiry request comprises a transaction code; acquiring a transaction link topology according to the transaction code in the query request; and sending the transaction link topology to a client so as to display the transaction link topology by the client.
An embodiment herein provides an apparatus for automatically generating a transaction link topology, including: the transaction running log acquiring unit is used for acquiring the transaction running log of each transaction from each application system according to the transaction code, wherein the transaction running log of each transaction comprises a transaction identifier and a transaction running sequence number; the application system call link determining unit is used for determining an application system call link of each transaction according to the transaction identification and the transaction serial number; the application system calling link identification unit is used for identifying the application system calling links of the same type of transaction according to the transaction codes; and the transaction link topology determining unit is used for integrating the application system call links of the same type of transaction to obtain the transaction link topology of the same type of transaction.
Embodiments herein also provide a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the above method when executing the computer program.
Embodiments herein also provide a computer-readable storage medium having stored thereon computer instructions, which when executed by a processor, implement the above-described method.
A computer program product comprising a computer program that when executed by a processor implements the above-described method is also disclosed in embodiments herein.
According to the scheme, the transaction link topologies of various transactions can be obtained, all application systems passing through the transactions can be visually monitored through the transaction link topologies of various transactions, and the transaction scene monitoring is realized.
Drawings
In order to more clearly illustrate the embodiments or technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flow chart illustrating a transaction link generation method according to an embodiment of the present disclosure;
FIG. 2 is a flow diagram illustrating a method for generating a transaction journal for each transaction by various application systems according to an embodiment of the present disclosure;
FIG. 3 is a flowchart illustrating a method for determining an application system call link for each transaction according to an embodiment of the present disclosure;
FIG. 4 is a flowchart illustrating a method for updating a transaction link topology according to an embodiment of the disclosure;
FIG. 5 is a flow diagram illustrating another method for determining a transaction link topology according to an embodiment herein;
FIG. 6 illustrates a method for generating a transaction link topology according to an embodiment of the present disclosure;
fig. 7 is a schematic structural diagram of an automatic transaction link topology generation apparatus according to an embodiment of the present disclosure;
fig. 8 is a schematic structural diagram illustrating a detailed structure of an automatic generation apparatus of a transaction link topology according to an embodiment of the present disclosure;
FIG. 9 is a schematic diagram illustrating a transaction link topology according to an embodiment herein;
fig. 10 is a schematic structural diagram of a computer device according to an embodiment of the present disclosure.
Description of the symbols of the drawings:
701. a transaction journal obtaining unit;
702. an application system calls a link determining unit;
7021. a chaining module;
703. an application system calls a link identification unit;
704. a transaction link topology determination unit;
7041. a transaction link topology updating module;
7042. a monitoring index calculation module;
1002. a computer device;
1004. a processor;
1006. a memory;
1008. a drive mechanism;
1010. an input/output module;
1012. an input device;
1014. an output device;
1016. a presentation device;
1018. a graphical user interface;
1020. a network interface;
1022. a communication link;
1024. a communication bus.
Detailed Description
In order to make the technical solutions in the present specification better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments, but not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments herein without making any creative effort, shall fall within the scope of protection.
It should be noted that the terms "first," "second," and the like in the description and claims herein and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments herein described are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, apparatus, article, or device that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or device.
The present specification provides method steps as described in the examples or flowcharts, but may include more or fewer steps based on routine or non-inventive labor. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual system or apparatus product executes, it can execute sequentially or in parallel according to the method shown in the embodiment or the figures.
It should be noted that the automatic generation method of transaction link topology herein can be used in the financial field, and can also be used in other fields besides the financial field, for example, the computer field, etc. The application field of the transaction link topology automatic generation method is not limited.
Fig. 1 is a flowchart of a transaction link generation method according to an embodiment of the present disclosure, which specifically includes the following steps:
In some embodiments of the present description, the transaction code may represent different transaction scenarios. Taking banking as an example, there are a large number of transaction scenarios in banking including but not limited to private transfer, public transfer, online account opening, loan, payment, payroll, payment, and the like. Each trading scenario has a uniquely corresponding trading code. The transaction code may be generated by the first application system invoked by the service invoker. For example, if the service caller is a user who needs to open an account, the mobile banking client operated by the user is the first application system, which is also called a channel system. When the transaction occurs, the first application system/channel system that is invoked first generates a transaction code associated with the transaction scenario. Correspondingly, the corresponding relation of the transaction code to the transaction scene can be preset. For example, the transaction code "A0001" represents a transaction scenario for the transfer; the transaction code "E12300" represents a transaction scenario for an online account opening. In this step, the transaction code may be preset according to the service requirement, and the preset transaction code may be stored in a transaction code table or other storage medium with a storage function.
In some embodiments of the present description, different transaction branches may be possible under the same transaction scenario. That is, a transaction may pass through multiple different applications. For example, in an "online account opening" transaction scenario, if a user initiating a transaction is a good credit-qualified customer, the transaction does not need to verify an "illegal fund transfer" step, and therefore, the application systems that the transaction of the user needs to pass through are: the system comprises a mobile banking application system, an MCIS application system, an IPS application system and a core banking application system. The whole application system calling link of the online account opening transaction of the user is as follows: cell phone bank-MCIS-IPS-core bank. For another example, in an "online account opening" transaction scenario, if the credit qualification of the user initiating the transaction is low, the transaction needs to verify an "illegal fund transfer" step, so the application systems that the transaction of the user needs to pass through are: the system comprises a mobile banking application system, an MCIS application system, an illegal fund transfer application system, an IPS application system and a core banking application system. The whole application system calling link of the online account opening transaction of the user is as follows: mobile banking-MCIS-illegal funds transfer-IPS-core bank.
In the transaction generation process, through a plurality of application systems, the plurality of application systems called by the transaction respectively generate respective transaction flow logs. The transaction journal includes a transaction representation and an application system representation. Wherein the transaction identifier in the transaction flow log is used to represent the name or attribute of the current transaction. The transaction id is unique for each transaction, that is, each transaction has a unique transaction id, and different transactions have different transaction ids, which are different from each other. In some embodiments of the present description, the transaction identification may include a global sequence number. Further, the transaction identification may be initiated by the transaction initiator. Wherein, the transaction initiating end can be understood as: a first application system of the plurality of application systems called by the transaction in the transaction occurrence process; it can also be understood that: a channel system of the transaction (e.g., cell phone bank, internet bank, counter front end system, etc.). The transaction identifier is always throughout the entire transaction, and all application systems called by the transaction include the transaction identifier of the transaction in a call message (i.e., transaction journal) calling the next application system.
Correspondingly, the transaction sequence number is an identifier generated by the application system of the service caller during the transaction occurrence process. The transaction sequence number is used for identifying the calling relationship between the caller and the callee in each service request. I.e. the calling relationship between the application system called and the application system executing the call during the transaction. Specifically, the transaction serial number may include a serial number generated by the application system and a serial number generated by the next application system. The serial number of the running water child generated by the application system can be sent to the running water log of the next application system, and is used for the parent serial number of the application system of the next application system.
And step 102, determining an application system calling link of each transaction according to the transaction identification and the transaction sequence number. In some embodiments of the present description, a call link between application systems of each transaction may be determined according to the transaction identifier and the transaction sequence number in the transaction sequence log corresponding to each application system. As shown in step 101, each type of transaction corresponds to a transaction code. According to the transaction code, the transaction flow log containing the transaction code can be inquired from a plurality of transaction flow logs of different transaction scenes. Because the application systems corresponding to the transaction flow logs containing the transaction codes are the first application systems/channel systems called by all transactions, at least one channel system in the transaction scene can be identified according to the transaction codes. And further traversing all transaction flow logs according to the transaction identification in the first application system/channel system of each transaction, and determining the application system call link of each transaction according to the transaction flow sequence numbers in all transaction flow logs.
For example, according to the online account opening transaction code "E12300", 3 journal logs containing the transaction code can be obtained by querying a large number of journal logs of transactions. It may be determined that there are 3 transactions for opening an account online and a channel system corresponding to 5 transactions. Traversing 3 journal logs containing the transaction code, the transaction identifications of the 3 transactions, i.e., global sequence number 1, global sequence number 2, and global sequence number 3, can be determined.
And further traversing all transaction flow logs according to the 3 global sequence numbers, and inquiring to obtain the transaction flow logs respectively containing the global sequence number 1, the global sequence number 2 and the global sequence number 3. And determining the calling relationship of the application system of the transaction according to the transaction sequence numbers contained in all the transaction sequence logs containing the global sequence number 1, and further determining the calling link of the application system of the transaction. The detailed description of this step is shown in fig. 3, and this step is not described herein again.
And 103, identifying the application system calling link of the same type of transaction according to the transaction code. In this step, a plurality of transaction identifications corresponding to the plurality of transactions can be identified according to the transaction codes. And according to the method in the step 102 and the step 103, identifying the application system call links of different transaction identifications corresponding to the same transaction code.
And step 104, integrating the application system call links of the same type of transaction to obtain the transaction link topology of the same type of transaction. The transaction link topology of the same type of transaction can be obtained by processing the link topology of the same type of transaction through the steps.
Fig. 2 is a flowchart illustrating a method for generating a transaction journal for each transaction by various application systems according to an embodiment of the present disclosure. The method specifically comprises the following steps:
As previously described, the first application system calls the first of all application systems for each transaction. It may also be understood as a channel system where the user initiates the transaction. The first application system generates a transaction code corresponding to a transaction scene and a transaction identifier corresponding to each transaction. The first application system also transmits the generated transaction code and the transaction identifier to all other called application systems. And adding the transaction code and the transaction identifier sent by the first application system into the respective transaction flow logs of other called application systems. In addition, other called application systems also add the transaction sequence number of the last application system in the transaction sequence log. For example, the first application system generates a transaction code of "online account opening" as "E12300" and a transaction identifier as "P011212 A4B3C 1202103011720301303456". The transaction code and the transaction identification are received by each application system. In addition, the first application system generates a transaction sequence number of "a 211CDS12DS5GJ 60". The next application to the first application receives the transaction sequence number.
In step 202, a transaction sequence number of the transaction is generated. In some embodiments of the present description, when each application system is called by a service requester, a transaction sequence number corresponding to the application system is generated. In addition, the transaction sequence number in the transaction sequence log of the application system further includes a child sequence number of the previous application system, and the child sequence number of the previous application system may also be referred to as a parent sequence number in the transaction sequence log of the application system. For example, the serial number of the transaction flow generated by the previous application system is "a 211CDS12DS5GJ 60", and the serial number of the transaction flow generated by the application system is "a 211CDS12DS5GJ 70", then the serial number of the transaction flow generated by the application system is "a 211CDS12DS5GJ60| a211CDS12DS5GJ 70". In some embodiments of the present specification, a sequence of a parent serial number and a serial number of a current application system in the transaction serial number corresponding to each application system is not limited.
Fig. 3 is a flowchart of a method for determining an application system call link for each transaction according to an embodiment of the present disclosure, which specifically includes the following steps:
Wherein the parsed structured fields respectively represent: recording a time point type, a transaction occurrence time point, a global serial number, a pipelining serial number, a father pipelining serial number, a full link unique identifier traceid, a call in a current spanID-identifier call chain, an application system code for identifying the application system, an application deployment unit number for identifying the service deployment unit, a caller code, an executor code, a target service code, an interface code name, an interface version number, an initiating channel identifier, an organization number, a unit fragment type code, a unit fragment type value, transaction time consumption and a return state.
For example, the transaction sequence number of application system a is: m | N; the transaction sequence number of the application system B is N | K. The same transaction sequence number for application systems a and B is N. The position of the N field in the transaction journal of the application system A is as follows: in the transaction journal of application B, the following are: before. Then it can be determined that the same transaction pipeline sequence number N is the pipeline child node generated by application system B, M is the pipeline child node generated by application system a, and K is the pipeline child node generated by the next application system invoked by application system B. It can be judged that the application system a calls the application system B. In some embodiments of the present description, the field position of the parent pipelining child node in the transaction pipelining sequence number in the application system may also be set to be before the pipelining child node in the application system. It should be noted that the present application does not limit the field location of the transaction sequence number.
And step 304, generating a calling link of the transaction according to the serial link relation of the application system. Specifically, according to the result of determining that the two analyzed transaction flow logs have the chain relationship in step 303, the calling and called relationships of the two application systems are further determined according to the field positions of the same transaction flow sequence number in the transaction flow logs.
Fig. 4 is a flowchart illustrating a method for updating a transaction link topology according to an embodiment of the disclosure. The method specifically comprises the following steps:
In some embodiments of the present description, the transaction journal for each transaction may be obtained according to preset rules. The preset rules include, but are not limited to: a preset sampling interval, a preset sampling time window, etc. For example, the preset sampling interval is 2 hours and the preset sampling time window is 10 minutes. The query may be performed every 2 hours, querying the transaction journal data within the last 10 minutes. The 10 minute transaction journal data includes transaction journal of multiple transactions under multiple transaction scenarios.
Fig. 5 is a flow diagram illustrating another method for determining a transaction link topology according to an embodiment of the disclosure. The method specifically comprises the following steps:
Fig. 6 is a flowchart of a method for generating a transaction link topology according to an embodiment of the present disclosure, which specifically includes the following steps:
Fig. 7 is a schematic structural diagram of an automatic transaction link topology generation apparatus according to an embodiment of the present disclosure, where a basic structure of the automatic transaction link topology generation apparatus is described in this diagram, functional units and modules of the automatic transaction link topology generation apparatus may be implemented in a software manner, or implemented by a general chip or a specific chip, so as to implement automatic transaction link topology generation, where the apparatus specifically includes:
a transaction running log obtaining unit 701, configured to obtain a transaction running log of each transaction from each application system according to a transaction code, where the transaction running log of each transaction includes a transaction identifier and a transaction running sequence number;
an application system call link determining unit 702, configured to determine an application system call link for each transaction according to the transaction identifier and the transaction serial number;
the application system call link identification unit 703 is configured to identify an application system call link of the same type of transaction according to the transaction code;
and the transaction link topology determining unit 704 is configured to perform integration processing on the application system call links of the same type of transaction to obtain the transaction link topology of the same type of transaction.
The scheme can visually monitor the health state of all systems through which the transaction passes according to the transaction scene, and the transaction scene is monitored; when a certain transaction fails, a system with a decreased success rate can be quickly identified from a link topological graph of the transaction, so that the problem troubleshooting efficiency is improved; and a transaction topological graph is automatically generated based on the log, manual maintenance is not needed, and the accuracy and the real-time performance of the graph are ensured.
As an embodiment herein, reference may also be made to a schematic structural diagram of the transaction link topology automatic generation apparatus shown in fig. 8.
As an embodiment herein, the application system call link determining unit 702 further includes:
the chaining module 7021 is configured to use every two analyzed transaction journal as a transaction journal group, compare transaction journal serial numbers in the transaction journal group, and determine that a chaining relationship exists in an application system corresponding to the transaction journal group if the same transaction journal serial number exists;
as an embodiment herein, the transaction link topology determination unit 704 further includes:
the transaction link topology updating module 7041 is configured to determine the transaction link topology again by identifying whether the transaction journal corresponds to the new application system and identifying a timestamp of the transaction journal of the application system within a preset time;
and the monitoring index calculation module 7042 is configured to calculate a monitoring index of the transaction flow log of each application system.
Fig. 9 is a schematic diagram illustrating a transaction link topology according to an embodiment of the disclosure. The transaction link topology corresponding to the transaction code can be queried according to the transaction code. All application systems invoked by the service party under the transaction scenario corresponding to the transaction code are shown in fig. 9, which includes: a channel system, an application system A, an application system B and an application system G. As can be seen from the figure, the channel system calls application system a and application system B. The application system A calls the application system C; and the application system B calls the application system D and the application system E at the same time. Application system E has invoked both application system F and application system G. In the transaction link topology of the application system in fig. 9, each application system also displays transaction monitoring indicators corresponding to the application system, including transaction success rate, average response time, and transaction amount. Taking application system B as an example, the transaction monitoring indexes include 6 transaction amount, 0.45ms average transaction response time, 100% transaction success rate, and 28 alarm times. The application system calls the link and combines the way that demonstrates with the monitoring index, can monitor the health condition of all systems that the trade passes according to the scene of the trade visually, monitor the scene of the trade; and when a certain transaction fails, an application system with a reduced success rate can be quickly positioned from a link topological graph of the transaction, so that the problem troubleshooting efficiency is improved.
As shown in fig. 10, for a computer device provided for embodiments herein, the computer device 1002 may include one or more processors 1004, such as one or more Central Processing Units (CPUs), each of which may implement one or more hardware threads. The computer device 1002 may also include any memory 1006 for storing any kind of information, such as code, settings, data, etc. For example, and without limitation, the memory 1006 may include any one or more of the following in combination: any type of RAM, any type of ROM, flash memory devices, hard disks, optical disks, etc. More generally, any memory may use any technology to store information. Further, any memory may provide volatile or non-volatile retention of information. Further, any memory may represent fixed or removable components of computer device 1002. In one case, when the processor 1004 executes the associated instructions, which are stored in any memory or combination of memories, the computer device 1002 can perform any of the operations of the associated instructions. The computer device 1002 also includes one or more drive mechanisms 1008, such as a hard disk drive mechanism, an optical disk drive mechanism, or the like, for interacting with any memory.
Corresponding to the methods in fig. 1 to 6, the embodiments herein also provide a computer-readable storage medium having stored thereon a computer program, which, when executed by a processor, performs the steps of the above-described method.
Embodiments herein also provide computer readable instructions, wherein when executed by a processor, a program thereof causes the processor to perform the method as shown in fig. 1-6.
Also disclosed herein are computer program products comprising computer programs which, when executed by a processor, implement the methods as shown in fig. 1-6.
It should be understood that, in various embodiments herein, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments herein.
It should also be understood that, in the embodiments herein, the term "and/or" is only one kind of association relation describing an associated object, meaning that three kinds of relations may exist. For example, a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided herein, it should be understood that the disclosed system, apparatus, and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purposes of the embodiments herein.
In addition, functional units in the embodiments herein may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present invention may be implemented in a form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The principles and embodiments of this document are explained herein using specific examples, which are presented only to aid in understanding the methods and their core concepts; meanwhile, for the general technical personnel in the field, according to the idea of this document, there may be changes in the concrete implementation and the application scope, in summary, this description should not be understood as the limitation of this document.
Claims (10)
1. A method for automatically generating a transaction link topology, the method comprising:
acquiring a transaction flow log of each transaction from each application system according to the transaction code, wherein the transaction flow log of each transaction comprises a transaction identifier and a transaction flow sequence number;
determining an application system calling link of each transaction according to the transaction identification and the transaction serial number;
identifying an application system calling link of the same type of transaction according to the transaction code;
and integrating the application system call links of the same type of transaction to obtain the transaction link topology of the same type of transaction.
2. The method of claim 1, wherein the step of generating a transaction journal for each transaction by each application system comprises:
receiving a transaction code and a transaction identifier of the transaction sent by a first application system and a transaction serial number generated by the previous application system for the transaction, wherein different transaction scenes correspond to different transaction codes, and each transaction has a unique transaction identifier;
generating a transaction sequence number of the transaction;
and recording the transaction running sequence number, the transaction running sequence number generated by the last application system for the transaction, the transaction code of the transaction and the transaction identification in an original log of the transaction, and generating the transaction running log of the application system for the transaction.
3. The method of claim 2, wherein determining the application system call link for each transaction according to the transaction identifier and the transaction serial number comprises:
acquiring a transaction journal corresponding to the same transaction identifier according to the transaction identifier;
analyzing the transaction flow log corresponding to the same transaction identifier into a structured field;
taking every two analyzed transaction journal logs as a transaction journal log group, comparing transaction journal serial numbers in the transaction journal log group, and if the same transaction journal serial numbers exist, determining that the application systems corresponding to the transaction journal log group have a serial-chain relationship, otherwise, determining that the serial-chain relationship does not exist;
and generating a transaction calling link according to the serial link relation of the application system.
4. The method of claim 3, wherein generating the transaction link topology further comprises:
identifying the transaction journal to determine whether a new application system exists, and if so, re-determining the transaction link topology;
identifying a timestamp of a transaction journal of each application system in the transaction link topology within preset time, and if the timestamp is not changed, deleting the application system in the transaction link topology; and if the time stamp changes, updating the time stamp of the application system in the transaction link topology.
5. The method of automatically generating a transaction link topology of claim 4, further comprising:
calculating monitoring indexes of transaction flow logs of each application system, wherein the monitoring indexes comprise transaction success rate, transaction amount and average response time;
and adding the monitoring indexes of the application systems into the transaction link topology as leaf nodes of the corresponding application systems.
6. The method of automatically generating a transaction link topology of claim 1, further comprising:
receiving an inquiry request sent by a client, wherein the inquiry request comprises a transaction code;
acquiring a transaction link topology according to the transaction code in the query request;
and sending the transaction link topology to a client so as to display the transaction link topology by the client.
7. An apparatus for automatically generating a transaction link topology, comprising:
the transaction running log acquiring unit is used for acquiring the transaction running log of each transaction from each application system according to the transaction code, wherein the transaction running log of each transaction comprises a transaction identifier and a transaction running sequence number;
the application system call link determining unit is used for determining an application system call link of each transaction according to the transaction identification and the transaction serial number;
the application system calling link identification unit is used for identifying the application system calling links of the same type of transaction according to the transaction codes;
and the transaction link topology determining unit is used for integrating the application system call links of the same type of transaction to obtain the transaction link topology of the same type of transaction.
8. A computer arrangement comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of any of claims 1-6 when executing the computer program.
9. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the method of any one of claims 1-6.
10. A computer program product, characterized in that the computer program product comprises a computer program which, when being executed by a processor, carries out the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210410555.8A CN114706827A (en) | 2022-04-19 | 2022-04-19 | Automatic generation method and device for transaction link topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210410555.8A CN114706827A (en) | 2022-04-19 | 2022-04-19 | Automatic generation method and device for transaction link topology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114706827A true CN114706827A (en) | 2022-07-05 |
Family
ID=82174306
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210410555.8A Pending CN114706827A (en) | 2022-04-19 | 2022-04-19 | Automatic generation method and device for transaction link topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114706827A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115904872A (en) * | 2022-12-01 | 2023-04-04 | 深圳市雁联计算系统有限公司 | Transaction link monitoring method, system and storage medium |
| CN116452208A (en) * | 2023-06-20 | 2023-07-18 | 建信金融科技有限责任公司 | Method, device, equipment and medium for determining change transaction code |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111724158A (en) * | 2020-05-25 | 2020-09-29 | 中国建设银行股份有限公司 | Transaction path generation method and system, and related computer device and storage medium |
| CN112433913A (en) * | 2020-11-23 | 2021-03-02 | 中国建设银行股份有限公司 | Transaction path generation method, system, computer device and storage medium |
| CN112882994A (en) * | 2021-03-30 | 2021-06-01 | 中信银行股份有限公司 | Log extraction method and device |
-
2022
- 2022-04-19 CN CN202210410555.8A patent/CN114706827A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111724158A (en) * | 2020-05-25 | 2020-09-29 | 中国建设银行股份有限公司 | Transaction path generation method and system, and related computer device and storage medium |
| CN112433913A (en) * | 2020-11-23 | 2021-03-02 | 中国建设银行股份有限公司 | Transaction path generation method, system, computer device and storage medium |
| CN112882994A (en) * | 2021-03-30 | 2021-06-01 | 中信银行股份有限公司 | Log extraction method and device |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115904872A (en) * | 2022-12-01 | 2023-04-04 | 深圳市雁联计算系统有限公司 | Transaction link monitoring method, system and storage medium |
| CN115904872B (en) * | 2022-12-01 | 2024-03-12 | 深圳市雁联计算系统有限公司 | Transaction link monitoring method, system and storage medium |
| CN116452208A (en) * | 2023-06-20 | 2023-07-18 | 建信金融科技有限责任公司 | Method, device, equipment and medium for determining change transaction code |
| CN116452208B (en) * | 2023-06-20 | 2023-09-22 | 建信金融科技有限责任公司 | Method, device, equipment and medium for determining change transaction code |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3373516B1 (en) | Method and device for processing service calling information | |
| CN109344170B (en) | Stream data processing method, system, electronic device and readable storage medium | |
| US8156172B2 (en) | Monitoring and reporting enterprise data using a message-based data exchange | |
| CN114706827A (en) | Automatic generation method and device for transaction link topology | |
| US8825798B1 (en) | Business event tracking system | |
| US20020178035A1 (en) | Performance management system and method | |
| WO2009036187A1 (en) | Systems and methods for dynamic quote generation | |
| US20180046956A1 (en) | Warning About Steps That Lead to an Unsuccessful Execution of a Business Process | |
| WO2019118305A1 (en) | Enterprise data services cockpit | |
| US20200175522A1 (en) | Predicting online customer service requests based on clickstream key patterns | |
| CN105608517B (en) | Business transaction performance management and visualization method and device based on flow | |
| CN113536054A (en) | Business monitoring method, device, equipment and storage medium based on graph data | |
| KR101989330B1 (en) | Auditing of data processing applications | |
| CN111915316B (en) | Method and device for monitoring suspicious transactions, computer equipment and storage medium | |
| CN113205402A (en) | Account checking method and device, electronic equipment and computer readable medium | |
| US20220292006A1 (en) | System for Automatically Generating Insights by Analysing Telemetric Data | |
| WO2017007981A1 (en) | Action correlation framework | |
| US20220156173A1 (en) | System and method for assessing performance of software release | |
| CN117708108A (en) | Client multidimensional information verification method and device | |
| CN116974805A (en) | Root cause determination method, apparatus and storage medium | |
| JP4790573B2 (en) | A computer system that estimates the credibility of telephone subscribers based on telephone numbers | |
| US9529860B2 (en) | Keyword frequency analysis system | |
| CN112926877A (en) | Health condition judgment method, device, equipment and storage medium for batch processing business | |
| CN111369370A (en) | Estimation table processing method, device, server and storage medium | |
| CN111179088A (en) | Information processing method and device |
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 |