Information processing method, device and computer equipment

Abstract

The present application proposes an information processing method, apparatus and computer equipment, wherein the method comprises: obtaining multiple transaction information with sorting numbers, executing a query process according to any prior transaction information, the query process comprising determining candidate transaction information according to the size of the sorting number, and querying subsequent transaction information that meets set conditions from the candidate transaction information, updating the subsequent transaction information to the prior transaction information, repeating the query process until no subsequent transaction information is found, then stopping the query process, generating a transaction path according to the prior transaction information used in the first query process and the subsequent transaction information found in each query process, and executing a cyclic query process on the transaction information according to the size of the sequence number of the sorted transaction information and the set conditions, thereby reducing the query amount in the query process, screening out the subsequent transaction information that does not meet the set conditions, and improving the efficiency and accuracy of transaction path generation.

Description

Technical Field

[0001] The present application relates to the field of information processing technology, and in particular to an information processing method, apparatus and computer equipment. Background Art

[0002] The rise of Internet payment has enabled people to conduct money transactions through various channels online, such as purchasing goods through Alipay and transferring money through WeChat Pay. In the field of financial risk control and security, how to use massive transfer data to efficiently find suspicious transaction paths and track and analyze fund transfer paths is of great significance to the risk and security management of the platform. Summary of the invention

[0003] The present application aims to solve one of the technical problems in the related art at least to some extent.

[0004] To this end, the first objective of the present application is to propose an information processing method to improve the efficiency and reliability of transaction path determination.

[0005] The second objective of the present application is to provide an information processing device.

[0006] The third objective of the present application is to provide a computer device.

[0007] A fourth object of the present application is to provide a non-transitory computer-readable storage medium.

[0008] A fifth object of the present application is to provide a computer program product.

[0009] To achieve the above objectives, the first embodiment of the present application proposes an information processing method, including:

[0010] Acquire multiple pieces of transaction information with sorting sequence numbers, wherein each piece of transaction information is sorted in order of transaction time;

[0011] Taking any transaction information among the multiple transaction information as the prior transaction information;

[0012] According to the prior transaction information, a query process is performed; wherein the query process includes querying the candidate transaction information whose ranking sequence number is greater than the ranking sequence number of the prior transaction information, and querying the subsequent transaction information that meets the set conditions from the candidate transaction information;

[0013] Updating the subsequent transaction information to the prior transaction information, and repeatedly executing the query process until no subsequent transaction information is found, and then stopping executing the query process;

[0014] A transaction path is generated based on the prior transaction information used in the first query process and the subsequent transaction information queried in each query process.

[0015] To achieve the above-mentioned purpose, the second embodiment of the present application proposes an information processing device, including:

[0016] An acquisition module, used to acquire multiple pieces of transaction information with sorting serial numbers, wherein each piece of transaction information is sorted in order of transaction time;

[0017] A processing module, used for taking any transaction information among the multiple transaction information as the prior transaction information;

[0018] A first execution module is used to execute a query process according to the prior transaction information; wherein the query process includes querying the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the prior transaction information, and querying the subsequent transaction information that meets the set conditions from the candidate transaction information;

[0019] A second execution module, configured to update the subsequent transaction information to the prior transaction information, and repeatedly execute the query process until no subsequent transaction information is found, and then stop executing the query process;

[0020] The generation module is used to generate a transaction path based on the previous transaction information used in the first query process and the subsequent transaction information queried in each query process.

[0021] In order to achieve the above-mentioned objectives, the third aspect of the present application proposes a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the information processing method described in the first aspect is implemented.

[0022] In order to achieve the above-mentioned objectives, the fourth aspect of the present application proposes a non-temporary computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the information processing method described in the first aspect.

[0023] In order to achieve the above-mentioned purpose, the fifth aspect of the present application proposes a computer program product. When the instructions in the computer program product are executed by a processor, the information processing method described in the first aspect is executed.

[0024] The technical solution provided by this embodiment has the following beneficial effects:

[0025] Acquire multiple transaction information with sorting numbers, take any transaction information among the multiple transaction information as prior transaction information, and execute a query process according to the prior transaction information, wherein the query process includes querying candidate transaction information with a sorting number greater than the sorting number of the prior transaction information, and querying subsequent transaction information that meets set conditions from the candidate transaction information, updating the subsequent transaction information as the prior transaction information, and repeatedly executing the query process until the subsequent transaction information is not found, then stopping the query process, and generating a transaction path according to the prior transaction information used in the first query process and the subsequent transaction information found in each query process. In the present application, the transaction information is sorted, and a cyclic query process is executed on the transaction information according to the size of the sorting number and the set conditions, thereby reducing the query amount in the query process and improving the efficiency and accuracy of transaction path generation.

[0026] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0028] Figure 1 A flowchart of an information processing method provided in an embodiment of the present application;

[0029] Figure 2 A flowchart of another information processing method provided in an embodiment of the present application;

[0030] Figure 3 A schematic diagram of sorting transaction information provided in an embodiment of the present application;

[0031] Figure 4 A flowchart of another information processing method provided in an embodiment of the present application;

[0032] Figure 5 A flowchart of another information processing method provided in an embodiment of the present application;

[0033] Figure 6 A schematic diagram of a transaction path visualization provided in an embodiment of the present application;

[0034] Figure 7 A schematic diagram of the structure of an information processing device provided in an embodiment of the present application;

[0035] Figure 8 A block diagram of an exemplary computer device according to an embodiment of the present application. DETAILED DESCRIPTION

[0036] Embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present application, and should not be construed as limiting the present application.

[0037] The following describes the information processing method, apparatus, and computer device of the embodiments of the present application with reference to the accompanying drawings.

[0038] Figure 1 A flowchart of an information processing method provided in an embodiment of the present application.

[0039] like Figure 1 As shown, the method comprises the following steps:

[0040] Step 101, obtaining multiple pieces of transaction information with sorting serial numbers, wherein each piece of transaction information is sorted in order of transaction time.

[0041] Among them, transaction information, in the Internet payment scenario, refers to payment transaction information, for example, transaction information of transactions completed through Alipay, or transaction information of transactions completed through online banking, which are not listed here one by one.

[0042] In this embodiment, a large amount of transaction information is sorted according to the transaction time sequence, and the sorted multiple transaction information are sorted according to the time sequence number to generate multiple transaction information with sorting sequence numbers.

[0043] As shown in Table 1 below:

[0044] Table 1

[0045] Transaction Information Transaction time (hours: minutes: seconds) Sorting Transaction information 1 17:28:14 1 Transaction information 2 17:33:17 2 Transaction information 3 17:39:36 3 ······ ······ ······ Transaction InformationN T:M:S N

[0046] Step 102: taking any transaction information among the multiple transaction information as the prior transaction information.

[0047] In this embodiment, any one of the multiple transaction information is selected as the prior transaction information. For example, based on Table 1, the transaction information 1 ranked as 1 is selected as the prior transaction information, so that the transaction information 1 is the prior transaction information used in the first query process; or the transaction information ranked as 3 is selected as the prior transaction information, so that the transaction information 3 is the prior transaction information used in the first query process. In other words, any one of the multiple transaction information in this embodiment can be used as the first prior transaction information in the repeated query process of executing the subsequent steps, that is, the prior transaction information used in the first query process.

[0048] Step 103, executing a query process according to the prior transaction information; wherein the query process includes querying candidate transaction information whose ranking sequence number is greater than the ranking sequence number of the prior transaction information, and querying subsequent transaction information that meets the set conditions from the candidate transaction information.

[0049] In this embodiment, according to the sorting sequence number of the prior transaction information, candidate transaction information with a sorting sequence number greater than the sorting sequence number of the prior transaction information is searched from multiple transaction information sorted in chronological order, that is, from the ordered array, transaction information with a sorting sequence number greater than the first sorting sequence number of the prior transaction information is searched, and then the transaction information with the first sorting sequence number found and the transaction information thereafter are used as candidate transaction information. Compared with searching from the beginning of the transaction information and traversing all the transaction information in the transaction information each time, the query complexity is reduced and the query efficiency is improved. For example, there are 6 pieces of transaction information, which are numbered 1, 2, 3, 4, 5 and 6 in chronological order, and it is determined that the sequence number of the prior transaction information searched for the first time is 3, then the transaction information with a sorting sequence number greater than the sequence number 3 of the prior transaction information is found to be ranked 4, 5 and 6.

[0050] Further, the subsequent transaction information that meets the set conditions is searched from the candidate transaction information. The set conditions are pre-generated, the transaction information includes the transfer-in account information and the transfer-out account information, and the set conditions include that the transfer-in account information of the prior transaction information is the same as the transfer-out account information of the subsequent transaction information; the time interval between the transaction time of the prior transaction information and the transaction time of the subsequent transaction information is less than or equal to the threshold time length; the difference between the transaction amount of the prior transaction information and the transaction amount of the subsequent transaction information is less than or equal to the difference threshold, and further screening is performed through the set conditions, thereby improving the accuracy of determining the subsequent transaction path after the prior transaction path.

[0051] Step 104, updating the subsequent transaction information to the prior transaction information, and repeating the query process until no subsequent transaction information is found, then stopping the query process.

[0052] In this embodiment, after determining the subsequent transaction information after the prior transaction information used in the first query process, the subsequent transaction information is updated to the prior transaction information, and the query process in step 103 is repeated until the subsequent transaction information is not found, and the query process is stopped.

[0053] Step 105, generating a transaction path based on the previous transaction information used in the first query process and the subsequent transaction information queried in each query process.

[0054] In this embodiment, a transaction path is generated based on the prior transaction information used in the first query process and the subsequent transaction information queried in each query process, and a transaction path starting from the prior transaction information used in the first query process is determined. The transaction path can be one or more.

[0055] It should be noted that after step 102 to step 105 are executed, a transaction path generated by taking one of the multiple transaction information as the prior transaction information is queried. Further, by repeating the above steps 102 to step 105 multiple times, a transaction path generated by taking other transaction information among the multiple transaction information as the prior transaction information can be queried, thereby realizing traversal of multiple transaction information and improving the accuracy of transaction path screening.

[0056] In the information processing method of the present embodiment, a plurality of transaction information with sorting numbers are obtained, and a query process is executed according to any prior transaction information. The query process includes determining candidate transaction information according to the size of the sorting number, and querying subsequent transaction information that meets the set conditions from the candidate transaction information, updating the subsequent transaction information to the prior transaction information, and repeating the query process until the subsequent transaction information is not found, then stopping the query process, and generating a transaction path according to the prior transaction information used in the first query process and the subsequent transaction information found in each query process. In the present application, the transaction information is sorted, and a cyclic query process is executed on the transaction information according to the size of the sorting number and the set conditions, thereby reducing the query amount in the query process, screening out the subsequent transaction information that does not meet the set conditions, and improving the efficiency and accuracy of transaction path generation.

[0057] Based on the previous embodiment, this embodiment provides another information processing method. Figure 2 A flowchart of another information processing method provided in an embodiment of the present application.

[0058] like Figure 2 As shown, the method may include the following steps:

[0059] Step 201, obtaining multiple pieces of transaction information with sorting serial numbers, wherein each piece of transaction information is sorted in order of transaction time.

[0060] Each piece of transaction information includes the transfer-out account information and the transfer-in account information.

[0061] In this embodiment, a transfer transaction scenario is used as an example for explanation. Since the card account of the transfer data is unique, the massive transfer transaction information of multiple trading platforms is cleaned and aligned, and meaningless transaction information is eliminated, such as transaction information of illegal card accounts and transaction information with an amount below a certain amount, to determine multiple transaction information, and then sort each transaction information in order of transaction time and number it to determine the sorting sequence.

[0062] Figure 3 A schematic diagram of sorting transaction information provided in an embodiment of the present application, such as Figure 3 As shown, in Table 2 and Table 3, the outgoing account information and the incoming account information in each row correspond to one transaction information. In Table 2, the transaction information is not sorted in chronological order, and the transaction information does not have a sorting sequence number. The transaction information in Table 3 is sorted in chronological order, and the sorting sequence number of each transaction information is determined according to the chronological order. That is to say, each transaction information sorted in chronological order is uniquely identified by the sorting sequence number, so that each transaction information has a corresponding digital sequence number corresponding to it.

[0063] Step 202: grouping multiple pieces of transaction information according to the transfer-out account information of each piece of transaction information to obtain multiple groups of transaction information.

[0064] Among them, each transaction information in the same group has the same transfer-out account information.

[0065] Step 203: Store each group of transaction information in a corresponding adjacency table.

[0066] In this embodiment, according to the transfer-out account information of multiple transaction information, each transaction information with the same transfer-out account information is divided into the same group to obtain multiple groups of transaction information, so that multiple transaction information are grouped according to the corresponding transfer-out account information, and each group of transaction information is stored in a corresponding adjacency table, that is, each group has a corresponding adjacency table, and the transaction information with the same transfer-out account information is stored in the corresponding adjacency table. Figure 3 Take Table 3 in as an example, for example, in adjacency table X1, the outgoing account information of the stored transaction information is all account A, for example, the outgoing account information is account A, and the incoming account information is account D; the outgoing account information is account A, and the incoming account information is account B. In adjacency table X2, the outgoing account information of the stored transaction information is all account B, for example, the outgoing account information is account B, and the incoming account information is account L; the outgoing account information is account B, and the incoming account information is account M; the outgoing account information is account B, and the incoming account information is account G; the outgoing account information is account B, and the incoming account information is account C. For other adjacency tables, the principle is the same, and they are not listed one by one in this example.

[0067] Step 204: taking any transaction information among the multiple transaction information as the prior transaction information.

[0068] Step 205: Determine, based on the prior transaction information, an adjacency list corresponding to the transfer-in account information of the prior transaction information.

[0069] The adjacency list includes one group of transaction information among the multiple groups of transaction information, one group of transaction information has the same transfer-out account information, and the transfer-out account information of one group of transaction information is the same as the transfer-in account information of the previous transaction information.

[0070] In this embodiment, based on the transfer-in account information of the previous transaction information, the transfer-out account information of each transaction information in the stored group is determined from multiple adjacency tables, and the adjacency table whose transfer-out account information of the stored transaction information is the same as the transfer-in account information of the previous transaction information is used as the adjacency table corresponding to the transfer-in account information of the previous transaction information. Since the adjacency table stores transaction information for the same transfer-out account information, the amount of transaction information in each group is reduced through grouping, which can improve the efficiency of subsequent queries.

[0071] For example, the transfer-out account information of the prior transaction information 1 is A, and the transfer-in account information is B. If the transfer-out account information of a group of transaction information stored in the adjacency table K1 is C, and the transfer-out account information of a group of transaction information stored in the adjacency table K2 is B, then the adjacency table K2 is the adjacency table corresponding to the transfer-in account information B of the prior transaction information 1.

[0072] Step 206: In the adjacency list, a query process is performed to search for candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information.

[0073] In the embodiment of the present application, a group of transaction information is arranged in an adjacency table according to a sequence number sorted in time order. As a possible implementation method, in the adjacency table, a binary search method is used to search for candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information. Specifically, in the adjacency table, each transaction information belonging to a group is arranged in ascending order according to the sequence number sorted in time order, and the sequence number of the transaction information in the middle position of the table is compared with the sorting sequence number of the current previous transaction information. If the sorting sequence numbers are the same, the search is successful. If the sorting sequence numbers are different, the adjacency table is divided into two sub-tables, front and back, according to the sequence number of the transaction information in the middle position. For the convenience of distinction, they are called the first sub-table and the second sub-table. If the sequence number of the transaction information in the middle position is greater than the sequence number of the previous transaction information, the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information is searched from the latter sub-table, that is, the second sub-table. Otherwise, the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information is searched from the first sub-table. Through the binary search method, the complexity of the query time is reduced and the efficiency of the query is improved.

[0074] Step 207, and querying the subsequent transaction information that meets the set conditions from the candidate transaction information.

[0075] The setting conditions include:

[0076] The transfer-in account information of the prior transaction information is the same as the transfer-out account information of the subsequent transaction information;

[0077] The time interval between the transaction time of the previous transaction information and the transaction time of the subsequent transaction information is less than or equal to the threshold time length;

[0078] The difference between the transaction amount of the prior transaction information and the transaction amount of the subsequent transaction information is less than or equal to the difference threshold.

[0079] For example, Figure 3 Table 3 in Table 3, taking the transaction information with the sorting sequence number of 5 in the multiple transaction information in Table 3 as the prior transaction information as an example, the transaction information with the sorting sequence number of 5 is recorded as R5 (A, B, t5, m5), where A represents the transfer-out account information A, B represents the transfer-out account information B, t5 represents the transaction time, and m5 represents the transaction amount. Then, the transaction information with the sorting sequence numbers of 6, 7, 8, 9, 10 and 11 are all determined as candidate transaction information because their sorting sequence numbers are all greater than 5. Then, the candidate transaction information is further screened according to the set conditions. First, it is determined that the transfer-in account information of the prior transaction information is the same as the transfer-out account information of the subsequent transaction information. According to Figure 3 From Table 3 in , we can see that the outgoing account information of the candidate transaction information with sorting numbers 6, 7 and 8 is the same as the incoming account information of the transaction information R5 with sorting number 6. Then, the transaction time is used as a constraint, that is, the time interval between the transaction time of the previous transaction information and the transaction time of the subsequent transaction information is determined to be less than or equal to the threshold time. For example, in the financial payment scenario, according to UnionPay data analysis, many suspicious transaction behaviors in the financial field are often concentrated in the time dimension, that is, the time span between two adjacent transaction information in the fund transfer path is small, so the threshold time can be set to 10 minutes. Thus, according to Figure 3 As shown in Table 3, the time interval between the transaction time of the prior transaction information R5 and the transaction time of the subsequent transaction information with the order number 6 is 2 minutes and 55 seconds, which is less than the threshold time of 10 minutes. The candidate transaction information with the order number 6 is still the subsequent transaction information. Similarly, the candidate records with the order numbers 7 and 8 are still the subsequent transaction information. Further, the constraint is imposed based on the transaction amount, that is, the difference between the transaction amount of the prior transaction information and the transaction amount of the subsequent transaction information is determined to be less than or equal to the difference threshold. For example, the difference threshold is 500 yuan. Figure 3It can be seen from Table 3 that the difference between the transaction amount of the prior transaction information R5 and the transaction amount of the subsequent transaction information with a sorting number of 6 is 1,400 yuan, that is, the amount of loss between the two transaction information is relatively large, so the subsequent transaction information with a sorting number of 6 does not meet the set conditions and is excluded; similarly, it is determined that the subsequent transaction information with sorting numbers 7 and 8 meet all the above-mentioned set conditions and are determined to be the subsequent transaction information.

[0080] Step 208, updating the subsequent transaction information to the prior transaction information, and repeating the query process until no subsequent transaction information is found, then stopping the query process.

[0081] For example, the subsequent transaction information with the order number 7 is updated to the prior transaction information, and the above query process is repeated. No subsequent transaction information that meets the set conditions is found. The subsequent transaction information with the order number 8 is updated to the prior transaction information, and the above query process is repeated. The subsequent transaction information that meets the set conditions is found to be the order number 10, that is, R10(G, J, t 10 ,m 10 ), as shown in Table 3, G is the outgoing account information, J is the incoming account information, t 10 The transaction time is 17:52:54, m 10 The transaction amount is 2000 yuan. Then, the subsequent transaction information with the sorting number 10 is updated as the prior transaction information, and the query process is repeated. The subsequent candidate transaction information is found to be the transaction information with the sorting number 11. Since the transaction information does not meet the set conditions and cannot be used as the subsequent transaction information, the query process with the transaction information with the sorting number 5 as the prior transaction information is stopped.

[0082] Step 209, generating a transaction path based on the previous transaction information used in the first query process and the subsequent transaction information queried in each query process.

[0083] For example, based on the prior transaction information R5 used in the first query process, two transaction paths are generated based on the subsequent transaction information queried in each query process, namely, transaction path R5→R7 and transaction path R5→R8→R9. 10 , if represented by the outgoing account information and incoming account information of the transaction path, the transaction path is A→B→L and A→B→G→J.

[0084] Similarly, based on other prior transaction information, the transaction paths can be determined to be D→H→K and A→E→G→J.

[0085] In the information processing method of the present embodiment, multiple transaction information are sorted in the order of transaction time, and a sorting sequence number is determined for each transaction information in the sorting, and then the multiple transaction information are grouped according to the transfer account information of each transaction information to obtain multiple groups of transaction information, and each group of transaction information is respectively stored in a corresponding adjacency table, so that according to each determined prior transaction information, a query process is executed, that is, a binary search method is used in the adjacency table to determine candidate records, and then, according to preset conditions, subsequent transaction information that meets the conditions is determined, and by repeatedly executing the above query process, a transaction path is finally generated, so that the abnormal transaction path caused by abnormal behavior can be found in the massive transaction information, and the efficiency and accuracy of the query are improved.

[0086] Based on the previous embodiment, this embodiment provides another information processing method. Figure 4 A flowchart of another information processing method provided in an embodiment of the present application.

[0087] like Figure 4 As shown, the method may include the following steps:

[0088] Step 401, obtaining multiple pieces of transaction information with sorting serial numbers, wherein each piece of transaction information is sorted in order of transaction time.

[0089] Step 402, grouping multiple pieces of transaction information according to the transfer-out account information of each piece of transaction information to obtain multiple groups of transaction information.

[0090] Step 403: Store each group of transaction information into a corresponding adjacency table.

[0091] For details, please refer to the explanations in the aforementioned embodiments, which will not be described in detail in this embodiment.

[0092] Step 404: any transaction information without a target mark added thereto among the plurality of transaction information is taken as the prior transaction information, and a target mark is added to the prior transaction information.

[0093] In this embodiment, in order to avoid repeatedly using any transaction information among multiple transaction information as prior transaction information, any transaction information among the multiple transaction information without a target mark is used as the prior transaction information, and a target mark is added to the prior transaction information, thereby avoiding repeated execution and improving execution efficiency.

[0094] Step 405: Determine, based on the prior transaction information, an adjacency list corresponding to the transfer-in account information of the prior transaction information.

[0095] For details, please refer to the explanations in the aforementioned embodiments, which will not be described in detail in this embodiment.

[0096] Step 406: Perform a query process in the adjacency list to query the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information among the transaction information without the target tag.

[0097] Step 407, executing a query process to query the subsequent transaction information that meets the set conditions from the candidate transaction information, and adding a target mark to the subsequent transaction information.

[0098] Step 408, the subsequent transaction information is updated to the prior transaction information, and the query process is repeated until no subsequent transaction information is found, and then the query process is stopped.

[0099] In the embodiment of the present application, in the process of repeatedly executing the query, the previous transaction information used in the first query process is added with a target tag, and the subsequent transaction information queried in each query process is added with a target tag, and the target tag indicates that the corresponding transaction information has been queried. When executing the query process in the adjacency table, in the transaction information without the target tag, the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information is queried, which can avoid repeatedly querying the transaction information that has been queried during the query process to enter an infinite loop, and in this embodiment, by adding the target tag, the efficiency of the query is improved.

[0100] Step 409, generating a transaction path based on the previous transaction information used in the first query process and the subsequent transaction information queried in each query process.

[0101] In an example of the present embodiment, if the length of the transaction path generated based on the prior transaction information adopted in the first query process and the subsequent transaction information queried in each query process is less than the set length, for example, 2, the target mark of the transaction information previously added with the target mark is removed, so that when other prior transaction information is used as the prior transaction information adopted in the first query process, that is, the starting transaction information, it can continue to be queried, thereby improving the accuracy of the query.

[0102] In the information processing method of this embodiment, during repeated query execution, a target mark is added to the previous transaction information used in the first query process, and a target mark is added to the subsequent transaction information queried in each query process. The target mark indicates that the corresponding transaction information has been queried, thereby improving the efficiency of the query.

[0103] Based on the above embodiments, this embodiment provides an information processing method. Figure 5 A flowchart of another information processing method provided in an embodiment of the present application is shown as follows: Figure 5 As shown, the above steps 105, 209 and 409 include the following steps:

[0104] Step 501, generating a tree diagram according to the transaction path.

[0105] Step 502: Visually display the tree diagram.

[0106] Each node in the tree diagram represents an account in the transaction path. Two nodes connected by a line in the tree diagram belong to the transfer-in account information and the transfer-out account information in the same transaction information, and the line points to the transfer-in account information.

[0107] like Figure 6 As shown in Table 3, after executing the query process, four transaction paths are determined, namely D→H→K, A→B→L, A→B→G→J and A→E→G→J. Then, the transaction paths are generated into a tree diagram and visualized, as shown in the figure. Figure 6 The tree diagram shown on the right side of the middle diagram enables an intuitive display of transaction paths that may have abnormalities.

[0108] In the information processing method of this embodiment, the generated transaction path is visualized in a tree diagram, which reflects the intuitive effect of transfers between different accounts in the transaction information, facilitates the analysis and tracking of the flow of transaction funds in the transaction path, and improves the readability and display effect of the transaction path.

[0109] In order to implement the above embodiments, the present application also proposes an information processing device.

[0110] Figure 7 A schematic diagram of the structure of an information processing device provided in an embodiment of the present application.

[0111] like Figure 7 As shown, the device comprises:

[0112] The acquisition module 71 is used to acquire multiple pieces of transaction information with sorting serial numbers, wherein each piece of transaction information is sorted in order of transaction time.

[0113] The processing module 72 is used to use any transaction information among the multiple transaction information as the previous transaction information.

[0114] The first execution module 73 is used to execute a query process according to the prior transaction information; wherein the query process includes querying the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the prior transaction information, and querying the subsequent transaction information that meets the set conditions from the candidate transaction information.

[0115] The second execution module 74 is used to update the subsequent transaction information to the prior transaction information, and repeatedly execute the query process until no subsequent transaction information is found, and then stop executing the query process.

[0116] The generating module 75 is used to generate a transaction path according to the previous transaction information used in the first query process and the subsequent transaction information queried in each query process.

[0117] Furthermore, in a possible implementation of the embodiment of the present application, each piece of the transaction information includes transfer-out account information and transfer-in account information; the plurality of pieces of transaction information are divided into a plurality of groups of transaction information, and each group of transaction information is stored in a corresponding adjacency table; the first execution module 73 includes:

[0118] a determining unit, configured to determine an adjacency list corresponding to the transfer-in account information of the prior transaction information, wherein the adjacency list includes a group of transaction information among the multiple groups of transaction information, the group of transaction information has the same transfer-out account information, and the transfer-out account information of the group of transaction information is the same as the transfer-in account information of the prior transaction information;

[0119] The query unit is used to query the adjacency table for candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information.

[0120] In a possible implementation manner of the embodiment of the present application, a group of transaction information is arranged in the adjacency table according to the sorting sequence number; the query unit is specifically used to:

[0121] In the adjacency table, a binary search method is used to search for candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information.

[0122] In a possible implementation manner of the embodiment of the present application, the device further includes:

[0123] A grouping module, used for grouping the plurality of transaction information according to the transfer-out account information of each transaction information to obtain a plurality of groups of transaction information, wherein each transaction information in the same group has the same transfer-out account information;

[0124] The storage module is used to store each group of transaction information in the corresponding adjacency table.

[0125] In a possible implementation of the embodiment of the present application, the device further includes:

[0126] The marking module is used to add a target mark to the previous transaction information used in the first query process and the subsequent transaction information queried in each query process during repeated execution of the query process.

[0127] Therefore, the first execution module 73 is specifically used for:

[0128] In the transaction information to which the target mark is not added, candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information is searched.

[0129] In a possible implementation of the embodiment of the present application, the processing module 72 is specifically configured to:

[0130] Any transaction information among the plurality of transaction information that is not added with the target mark is used as the previous transaction information.

[0131] In a possible implementation of the embodiment of the present application, the setting condition includes:

[0132] The transfer-in account information of the prior transaction information is the same as the transfer-out account information of the subsequent transaction information;

[0133] The time interval between the transaction time of the prior transaction information and the transaction time of the subsequent transaction information is less than or equal to the threshold time length;

[0134] The difference between the transaction amount of the prior transaction information and the transaction amount of the subsequent transaction information is less than or equal to the difference threshold.

[0135] In a possible implementation manner of the embodiment of the present application, the device further includes:

[0136] A generating module, configured to generate a tree diagram according to the transaction path, wherein each node in the tree diagram represents an account in the transaction path, two nodes connected by a line in the tree diagram are transfer-in account information and transfer-out account information in the same transaction information, and the line points to the transfer-in account information;

[0137] A display module is used to visually display the tree diagram.

[0138] It should be noted that the above explanation of the method embodiment is also applicable to the device of this embodiment, and will not be repeated here.

[0139] In the information processing device of the embodiment of the present application, multiple transaction information with sorting numbers are obtained, and a query process is performed according to any prior transaction information. The query process includes determining candidate transaction information according to the size of the sorting number, and querying subsequent transaction information that meets the set conditions from the candidate transaction information, updating the subsequent transaction information to the prior transaction information, and repeating the query process until the subsequent transaction information is not found, then stopping the query process, and generating a transaction path based on the prior transaction information used in the first query process and the subsequent transaction information found in each query process. In the present application, the transaction information is sorted, and a cyclic query process is performed on the transaction information according to the size of the sorting number and the set conditions, thereby reducing the query amount in the query process, screening out the subsequent transaction information that does not meet the set conditions, and improving the efficiency and accuracy of transaction path generation.

[0140] In order to implement the above embodiments, the embodiments of the present application propose a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the information processing method described in the above method embodiments is implemented.

[0141] In order to implement the above-mentioned embodiment, the embodiment of the present application proposes a non-temporary computer-readable storage medium, on which a computer program is stored. When the program is executed by a processor, the information processing method described in the above-mentioned method embodiment is implemented.

[0142] In order to implement the above embodiment, the embodiment of the present application proposes a computer program product. When the instructions in the computer program product are executed by a processor, the information processing method described in the above method embodiment is executed.

[0143] Figure 8 A block diagram of an exemplary computer device according to an embodiment of the present application. Figure 8 The computer device 12 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0144] like Figure 8 As shown, the computer device 12 is in the form of a general-purpose computing device. The components of the computer device 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 that connects various system components (including the system memory 28 and the processing unit 16).

[0145] The bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor or a local bus using any of a variety of bus structures. For example, these architectures include but are not limited to Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, Enhanced ISA bus, Video Electronics Standards Association (VESA) local bus and Peripheral Component Interconnection (PCI) bus.

[0146] The computer device 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the computer device 12, including volatile and non-volatile media, removable and non-removable media.

[0147] The memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The computer device 12 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media ( Figure 8 not shown, usually called a "hard drive"). Although Figure 8 Not shown, a disk drive for reading and writing a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing a removable non-volatile optical disk (e.g., a compact disc read only memory (CD-ROM), a digital versatile disc read only memory (DVD-ROM), or other optical media) may be provided. In these cases, each drive may be connected to the bus 18 via one or more data medium interfaces. The memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present application.

[0148] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in the memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. The program modules 42 generally perform the functions and / or methods of the embodiments described herein.

[0149] The computer device 12 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), one or more devices that enable a user to interact with the computer device 12, and / or any device that enables the computer device 12 to communicate with one or more other computing devices (e.g., network card, modem, etc.). Such communication may be performed through an input / output (I / O) interface 22. In addition, the computer device 12 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 20. As shown, the network adapter 20 communicates with other modules of the computer device 12 through the bus 18. It should be understood that although Figure 8 Not shown, other hardware and / or software modules may be used in conjunction with computer device 12, including but not limited to microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0150] The processing unit 16 executes various functional applications and data processing by running programs stored in the system memory 28, such as implementing the methods mentioned in the above embodiments.

[0151] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0152] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In the description of this application, the meaning of "plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0153] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, fragment or portion of code comprising one or more executable instructions for implementing the steps of a custom logical function or process, and the scope of the preferred embodiments of the present application includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present application belong.

[0154] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purpose of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or processing in other suitable ways if necessary, and then stored in a computer memory.

[0155] It should be understood that the various parts of the present application can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0156] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.

[0157] In addition, each functional unit in each embodiment of the present application may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0158] The storage medium mentioned above may be a read-only memory, a magnetic disk or an optical disk, etc. Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limiting the present application. A person of ordinary skill in the art may change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. An information processing method, characterized in that: The following steps are involved: Acquire multiple pieces of transaction information with sorting sequence numbers, wherein each piece of transaction information is sorted in order of transaction time; Taking any transaction information among the multiple transaction information as the prior transaction information; According to the prior transaction information, a query process is performed; wherein the query process includes querying the candidate transaction information whose ranking sequence number is greater than the ranking sequence number of the prior transaction information, and querying the subsequent transaction information that meets the set conditions from the candidate transaction information; Updating the subsequent transaction information to the prior transaction information, and repeatedly executing the query process until no subsequent transaction information is found, and then stopping executing the query process; Generate a transaction path based on the prior transaction information used in the first query process and the subsequent transaction information queried in each query process; The method further comprises: in the process of repeatedly executing the query, adding a target mark to the prior transaction information used in the first query process and the subsequent transaction information queried in each query process; The taking any transaction information among the multiple transaction information as the prior transaction information includes: taking any transaction information among the plurality of transaction information without the target mark added thereto as the prior transaction information; Each piece of the transaction information includes transfer-out account information and transfer-in account information; the multiple pieces of transaction information are divided into multiple groups of transaction information, and each group of transaction information is stored in a corresponding adjacency table; the querying of the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information includes: Determine an adjacency list corresponding to the transfer-in account information of the prior transaction information, wherein the adjacency list includes a group of transaction information among the multiple groups of transaction information, the group of transaction information has the same transfer-out account information, and the transfer-out account information of the group of transaction information is the same as the transfer-in account information of the prior transaction information; In the adjacency list, candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information is searched.

2. The information processing method according to claim 1, characterized in that: The group of transaction information in the adjacency table is arranged according to the sorting sequence number; the step of searching the adjacency table for candidate records whose sorting sequence number is greater than the sorting sequence number of the prior transaction information includes: In the adjacency table, a binary search method is used to search for candidate records whose sorting numbers are greater than the sorting number of the prior transaction information.

3. The information processing method according to claim 1, characterized in that: After obtaining the plurality of transaction information with the sorting sequence numbers, the method further includes: According to the transfer-out account information of each piece of transaction information, the plurality of transaction information are grouped to obtain a plurality of groups of transaction information, wherein each piece of transaction information in the same group has the same transfer-out account information; Each group of transaction information is stored in the corresponding adjacency table.

4. The information processing method according to any one of claims 1 to 3, characterized in that: The querying of the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the prior transaction information includes: In the transaction information to which the target mark is not added, candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information is searched.

5. The information processing method according to any one of claims 1 to 3, characterized in that: The setting conditions include: The transfer-in account information of the prior transaction information is the same as the transfer-out account information of the subsequent transaction information; The time interval between the transaction time of the prior transaction information and the transaction time of the subsequent transaction information is less than or equal to the threshold time length; The difference between the transaction amount of the prior transaction information and the transaction amount of the subsequent transaction information is less than or equal to the difference threshold.

6. The information processing method according to any one of claims 1 to 3, characterized in that: After the transaction path is generated, the following steps are also included: Generate a tree diagram according to the transaction path, wherein each node in the tree diagram represents an account in the transaction path, two nodes connected by a line in the tree diagram belong to the transfer-in account information and the transfer-out account information in the same transaction information, and the line points to the transfer-in account information; The tree diagram is visually displayed.

7. An information processing device, characterized in that: include: An acquisition module, used to acquire multiple pieces of transaction information with sorting serial numbers, wherein each piece of transaction information is sorted in order of transaction time; A processing module, used for taking any transaction information among the multiple transaction information as the prior transaction information; A first execution module is used to execute a query process according to the prior transaction information; wherein the query process includes querying the candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the prior transaction information, and querying the subsequent transaction information that meets the set conditions from the candidate transaction information; A second execution module, configured to update the subsequent transaction information to the prior transaction information, and repeatedly execute the query process until no subsequent transaction information is found, and then stop executing the query process; A generation module, used to generate a transaction path based on the prior transaction information used in the first query process and the subsequent transaction information queried in each query process; Wherein, in the process of repeatedly executing the query, the prior transaction information used in the first query process and the subsequent transaction information queried in each query process are added with a target mark; The taking any transaction information among the plurality of transaction information as the prior transaction information includes: taking any transaction information among the plurality of transaction information without the target mark added thereto as the prior transaction information; Each piece of the transaction information includes outgoing account information and incoming account information; the plurality of transaction information are divided into a plurality of groups of transaction information, and each group of transaction information is stored in a corresponding adjacency table; The first execution module includes: a determining unit, configured to determine an adjacency list corresponding to the transfer-in account information of the prior transaction information, wherein the adjacency list includes a group of transaction information among the multiple groups of transaction information, the group of transaction information has the same transfer-out account information, and the transfer-out account information of the group of transaction information is the same as the transfer-in account information of the prior transaction information; The query unit is used to query the adjacency table for candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information.

8. The information processing device according to claim 7, characterized in that: The group of transaction information in the adjacency table is arranged according to the sorting sequence number; the query unit is specifically used to: In the adjacency table, a binary search method is used to search for candidate transaction information whose sorting sequence number is greater than the sorting sequence number of the previous transaction information.

9. The information processing device according to claim 7, characterized in that: The device further comprises: A grouping module, used for grouping the plurality of transaction information according to the transfer-out account information of each transaction information to obtain a plurality of groups of transaction information, wherein each transaction information in the same group has the same transfer-out account information; The storage module is used to store each group of transaction information in the corresponding adjacency table.

10. A computer device, characterized in that: The invention comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the information processing method according to any one of claims 1 to 6 is implemented.

11. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the information processing method according to any one of claims 1 to 6 is implemented.

12. A computer program product, characterized in that When the instructions in the computer program product are executed by a processor, the information processing method according to any one of claims 1 to 6 is performed.

Images