CN115393087A - Data processing method, device and equipment and readable storage medium - Google Patents
Data processing method, device and equipment and readable storage medium Download PDFInfo
- Publication number
- CN115393087A CN115393087A CN202211019452.5A CN202211019452A CN115393087A CN 115393087 A CN115393087 A CN 115393087A CN 202211019452 A CN202211019452 A CN 202211019452A CN 115393087 A CN115393087 A CN 115393087A
- Authority
- CN
- China
- Prior art keywords
- node
- processed
- historical
- task
- transaction
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- General Business, Economics & Management (AREA)
- Technology Law (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Software Systems (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a data processing method, a data processing device, data processing equipment and a readable storage medium, which can be applied to the financial field or other fields. The method includes the steps that a node identification of a node to be processed is obtained, and the node to be processed is any task node of a transaction task to be processed. And acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identification of the nodes to be processed. Judging whether the historical transaction data of the node to be processed meets preset conditions at least according to the transaction data of the node to be processed, wherein the preset conditions comprise: and the transaction data of the node to be processed meets the matching rule. And if the historical transaction data of the node to be processed meets the preset conditions, taking the historical processing result of the node to be processed as the processing result of the node to be processed. And acquiring a transaction result of the transaction task according to the processing result of each node to be processed. The method reduces repeated calculation, saves calculation resources and improves the efficiency of transaction processing.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a data processing method, apparatus, device, and readable storage medium.
Background
In the process of executing transaction by the data processing system, under the condition that any task node fails, the transaction result of the whole transaction is failed, and the data processing system needs to re-obtain the transaction information of each task node and then re-calculate the transaction result of each task node according to the transaction information of each task node in sequence. Therefore, after the transaction enters the transaction flow again, a large amount of repeated calculation is needed, a large amount of calculation resources are consumed, and the transaction processing efficiency is low.
Disclosure of Invention
The application provides a data processing method, a device, equipment and a readable storage medium, and the following steps are provided:
a method of data processing, comprising:
acquiring a node identifier of a node to be processed, wherein the node to be processed is any task node of a transaction task to be processed;
acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, wherein the cache database comprises the node identifiers, the transaction data and the processing results of the historical task nodes;
judging whether the historical transaction data of the node to be processed meets a preset condition at least according to the transaction data of the node to be processed, wherein the preset condition comprises the following steps: the transaction data of the node to be processed and the transaction data of the node to be processed meet a matching rule;
if the historical transaction data of the node to be processed meets the preset condition, taking the historical processing result of the node to be processed as the processing result of the node to be processed;
and acquiring a transaction result of the transaction task according to the processing result of each node to be processed.
Optionally, the method further comprises:
if any transaction task fails to be executed, taking the transaction task as a historical transaction task;
acquiring node identification, transaction data and processing results of historical task nodes, wherein the historical task nodes comprise at least one task node of the historical transaction task;
and correspondingly storing the node identification, the transaction data and the processing result of the historical task node into the cache database.
Optionally, the method further comprises:
inquiring the storage time of the node data of the historical task nodes in the cache database according to a preset period;
and deleting the node data of the historical task nodes with the storage time exceeding a preset time threshold.
Optionally, obtaining historical transaction data and historical processing results of the task node from a preset cache database according to the node identifier of the task node, including:
querying a historical task node which is the same as the node identifier of the target task node in the cache database to serve as the target historical task node;
acquiring transaction data corresponding to the node identification of the target historical task node from the cache database as historical transaction data of the task node;
and acquiring a processing result corresponding to the node identification of the target historical task node from the cache database as a historical processing result of the task node.
Optionally, the method further comprises:
if the historical transaction data of the node to be processed does not meet the preset condition, deleting the historical transaction data and the historical processing result of the node to be processed from the cache database;
and inputting the transaction data of the node to be processed into a target model to obtain a processing result of the node to be processed output by the target model, wherein the target model is a calculation model corresponding to the node to be processed.
Optionally, the preset conditions further include: the storage time length is not more than a preset time length threshold value.
Optionally, after the obtaining, according to the node identifier of the node to be processed, the historical transaction data and the historical processing result of the node to be processed from a preset cache database, the method further includes:
backfilling the historical transaction data of the node to be processed to a preset task interface corresponding to the node to be processed;
and displaying the historical processing result of the node to be processed on the task interface.
A data processing apparatus comprising:
the system comprises an identification acquisition unit, a transaction processing unit and a transaction processing unit, wherein the identification acquisition unit is used for acquiring a node identification of a node to be processed, and the node to be processed is any task node of a transaction task to be processed;
the historical data acquisition unit is used for acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, and the cache database comprises the node identifiers, the transaction data and the processing results of historical task nodes;
a condition determining unit, configured to determine whether historical transaction data of the node to be processed meets a preset condition at least according to the transaction data of the node to be processed, where the preset condition includes: the transaction data of the node to be processed and the transaction data of the node to be processed meet a matching rule;
a processing result obtaining unit, configured to take a historical processing result of the node to be processed as a processing result of the node to be processed if the historical transaction data of the node to be processed meets the preset condition;
and the transaction result acquisition unit is used for acquiring the transaction result of the transaction task according to the processing result of each node to be processed.
A data processing apparatus comprising: a memory and a processor;
the memory is used for storing programs;
the processor is used for executing the program and realizing each step of the data processing method.
A readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the data processing method.
It can be seen from the foregoing technical solutions that, in the data processing method, apparatus, device, and readable storage medium provided in the embodiments of the present application, the node identifier of the node to be processed is obtained, and the node to be processed is any task node of the transaction task to be processed. And acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, wherein the cache database comprises the node identifiers of the historical task nodes, the transaction data and the processing results. Judging whether the historical transaction data of the node to be processed meets preset conditions at least according to the transaction data of the node to be processed, wherein the preset conditions comprise: and the transaction data of the node to be processed meets the matching rule. And if the historical transaction data of the node to be processed meets the preset conditions, taking the historical processing result of the node to be processed as the processing result of the node to be processed. And acquiring a transaction result of the transaction task according to the processing result of each node to be processed. According to the method, under the condition that the transaction data and the historical transaction data of the node to be processed meet the preset conditions, the historical processing result of the node to be processed is used as the processing result of the node to be processed, repeated calculation is reduced, calculation resources are saved, and the transaction processing efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a specific implementation of a data processing method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a data processing method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the data processing method, the data processing device, the data processing equipment and the readable storage medium provided by the invention can be used in the financial field or other fields.
The data processing method provided by the embodiment of the application is applied to but not limited to a process that a data processing system executes a transaction task and acquires a transaction result according to transaction data. The data processing system includes, but is not limited to, an anti-money laundering monitoring and analyzing system, a money transfer system, a security verification system, and the like in a bank system, and this implementation does not limit this.
One optional specific application scenario of the present application is: and under the condition that the execution flow of the transaction task is re-entered after the execution of the transaction task fails, the data processing system executes the transaction task according to the re-submitted transaction data to obtain a transaction result.
Specifically, the data processing system is communicatively coupled to the teller-front-end system and is configured to obtain, from the teller-front-end system, transaction data input by a user (e.g., a teller or a customer) via an input device of the teller-front-end system. Data processing systems generally include at least one task node for a transaction task, and generally transactions tend to include multiple task nodes, each of which may be processed in a different subsystem. For example, the first transaction task includes a task node: the system comprises a background transaction system, a transaction data processing system, an authorization system and a popup system, wherein the transaction data processing system, the authorization system and the popup system are respectively connected with the background transaction system and the cash register. And when the processing result of at least one task node is failed, the transaction result of the transaction task is failed. Taking the first transaction task as an example, the processing results of the in-process check, the transaction data processing, and the popup are successful, but the authorized processing result is failure, and then the processing result of the first transaction is failure.
It should be noted that the method for acquiring the processing result of any task node includes: and inputting the transaction data of the task node into a calculation model matched with the task node to obtain a processing result output by the calculation model. In this embodiment, the matching relationship between the calculation model and the task node is configured in advance. The method for obtaining the computation model matched with the task node and the configuration of the computation model include various methods, particularly referring to the prior art.
In a conventional data processing method, transaction data of each task node (including in-process inspection, transaction data processing, authorization, and popup) needs to be obtained again, and a processing result of each task node is obtained through sequential calculation, that is, after a transaction task fails to be executed, an execution flow of the transaction task needs to be repeated, that is, calculation of each task node needs to be repeatedly executed. Therefore, when the processing result of the task node is successful and the transaction flow is re-entered, and the transaction data for acquiring the task node is the same as the historical transaction data, the traditional transaction re-entry method re-calculates the task node, which wastes computing resources, so that the transaction efficiency is low and the transaction time is long.
In view of this, according to the data processing method provided in the embodiment of the present application, the transaction data and the processing result of the task node are cached after the execution of the transaction task fails, and when the transaction flow is re-entered, whether the transaction data of the re-acquired task node is matched with the cached transaction data is compared, and if the transaction data is matched with the cached transaction data, the processing result corresponding to the cached transaction data is directly called as the processing result of the task node. The aim is to save computing resources, improve transaction processing efficiency and shorten transaction duration.
Fig. 1 is a specific implementation flow of a data processing method provided in an embodiment of the present application, and as shown in fig. 1, the method specifically includes:
and S101, responding to the execution failure of the transaction task, and acquiring and storing the node data of the historical task node.
In this embodiment, that the execution of the transaction task fails means that the transaction result of the transaction task is a failure or the transaction task is suspended.
The historical task node includes at least one task node of the historical transaction task (i.e., the transaction task that failed to be executed), and optionally, the historical task node includes a first task node and a second task node, where the first task node includes a task node whose processing result is successful. The second task node includes a task node whose processing result is failure. The node data of any one task node comprises a node identifier, transaction data and a processing result, the transaction data of the task node comprises values of at least one data item of the task node, and the data item of the task node at least comprises a data item (marked as a key data item) participating in the calculation of the task node, namely at least comprises an input data item of a calculation model of the task node.
Optionally, the method for saving node data of the task node includes: and correspondingly storing the node identification, the transaction data and the processing result into a preset cache database in a preset data format. It should be noted that, if the node identifier of the task node exists in the cache database, the transaction data and the processing result corresponding to the node identifier are updated, and the coverage processing can ensure that the node data in the cache database is the latest transaction data and data result corresponding to the node identifier.
Optionally, in this step, the node data of the task node is directly acquired and stored after the execution of the transaction task to be processed fails, or the node data of the task node is acquired and stored after a preset storage instruction is received.
It should be noted that, after the execution of the transaction task to be processed fails, a transaction failure instruction is issued, a failure prompt of the transaction task to be processed is displayed on the display device of the front-end system, and optionally, a processing result of each task node is displayed. The user can send out a storage instruction by clicking a preset storage button, the storage instruction is used for indicating the node data of the task node to be stored, and submitting a preset reentry instruction, and the reentry instruction is used for indicating the re-entry of the execution flow of the transaction task to be processed. And the transaction system acquires and stores the node data of the task node after receiving the storage instruction.
It should be further noted that, in response to receiving the reentry instruction, the reentry process of the transaction task to be processed is entered, that is, for each node to be processed (i.e., the task node of the transaction task to be processed), the processing result of the task node is obtained according to the cache database, the transaction data, and the calculation model. Taking a target task node (any node to be processed) as an example, the reentrant flow includes:
s102, after receiving the processing instruction of the target task node, acquiring the node identification of the target task node.
In this embodiment, the processing instruction of the target task node may be triggered manually or may be triggered automatically after the processing of the previous task node of the target task node is finished. This embodiment is not limited to this.
In this embodiment, the node identifier of the task node is generated according to the identification data item and the task node, and uniquely indicates the task node with the identification data item, where the identification data item includes at least one preset data item.
S103, inquiring a cache database and acquiring historical transaction data and historical processing results of the target task node according to the node identification of the target task node.
In this embodiment, a historical task node in the cache database, which has the same node identifier as the target task node, is first queried as the target historical task node (for clarity of description, all task nodes in the cache database are referred to as historical task nodes, the same applies below). And extracting transaction data of the target historical task node as historical transaction data of the target task node, and extracting a processing result of the target historical task node as a historical processing result of the target task node.
S104, correspondingly filling values of data items in the historical transaction data of the target task node into a task interface, and displaying the historical processing result of the target task node on the task interface.
In this embodiment, the task interface is a transaction data input interface displayed on a display device of the front-end system.
It can be understood that the historical transaction data of the target task node is used as the transaction data of the target task node, the data item is automatically backfilled, the value of the data item input last time is displayed for the user, time waste caused by repeated input of the user is avoided, meanwhile, the user is informed whether the value of the data item input last time needs to be modified or not through the display processing result, and obviously, the prompt function is added, so that the speed and the accuracy of submitting the transaction data again by the user are improved.
It should be noted that, if there is no historical transaction data of the target task node (there is no historical task node with the same node identifier as the target task node or no transaction data in the node data of the target historical task node), the task interface is directly displayed and the user is prompted to input the transaction data of the task node.
And S105, responding to a preset submitting instruction, and acquiring the transaction data of the target task node.
In this embodiment, the transaction data submitted by the user is acquired from the front-end system. Optionally, the submit instruction is triggered by the user clicking a preset submit button.
And S106, judging whether the historical transaction data of the target task node meets a preset condition.
In this embodiment, the preset condition includes that the transaction data of the target task node and the historical transaction data satisfy the matching rule. It should be noted that, the matching rule is preconfigured according to the calculation model corresponding to the target task node, and the configuration principle is as follows: and after the two sets of transaction data meeting the matching rules are respectively input into the calculation model, the output results are the same. For example, the text similarity is greater than the similarity threshold, and for example, the numerical difference is less than the preset numerical threshold. It should be noted that the matching rules for different calculation models may be different. See the prior art for a specific configuration method.
And S107, if the processing result meets the requirement, taking the historical processing result of the target task node as the processing result of the target task node.
And S108, if the data do not meet the requirements, inputting the transaction data of the target task node into a calculation model corresponding to the target task node to obtain a processing result of the target task node output by the calculation model.
In this embodiment, each task node in the transaction task to be processed executes the reentry procedure.
And S109, acquiring a transaction result of the transaction task to be processed according to the processing result of each task node.
In this embodiment, there are multiple methods for obtaining the transaction result of the transaction task to be processed according to the processing result of each task node, which may be specifically referred to in the prior art, for example, an optional method for obtaining the transaction result of the transaction task to be processed includes determining that the transaction result of the transaction task to be processed is a failure if the processing result of the target task node is a failure, and exiting the execution flow of the transaction task to be processed.
According to the technical scheme, the node data of the historical node task with the successful processing result is stored in the cache database in advance, and for the node to be processed with the historical transaction data and the historical processing result, the historical processing result of the node to be processed is used as the processing result of the node to be processed under the condition that the historical transaction data and the transaction data of the node to be processed meet the matching rule, so that repeated calculation is reduced, computing resources are saved, and the transaction processing efficiency is improved. And for the node to be processed without the historical transaction data and the historical processing result, or under the condition that the historical transaction data and the transaction data of the node to be processed do not meet the matching rule, the processing result of the node to be processed is obtained by using the calculation model and the transaction data, so that the accuracy of the processing result of the node to be processed is ensured.
For example, in the application scenario mentioned in this embodiment, after the execution of the transaction task fails, the execution flow of the transaction task needs to be repeated, that is, the calculation of each task node (including the check in the event, the transaction data processing, the authorization, and the pop-up window) needs to be repeatedly executed. Specifically, the transaction data of each task node re-entered by the user in the task interface is obtained, the transaction data is input into the corresponding calculation model, and the processing result of the task node is re-obtained through the calculation model. Therefore, each task node needs to repeatedly calculate transaction data to obtain a processing result.
Obviously, the method can reduce the time for the user to manually input transaction data, thereby improving the efficiency of transaction on the counter, reducing the loss of failed transaction resources, accelerating the transaction processing speed and optimizing the transaction processing mechanism.
It should be noted that fig. 1 is only a specific implementation flow of an optional data processing method provided in the embodiment of the present application, and the present application also includes specific implementations of other optional data processing methods.
For example, the method further comprises at least one of:
1. and inquiring the storage time of the node data in the cache database according to a preset period, and deleting the node data of the task node if the storage time exceeds a preset time threshold.
2. The preset condition further includes that the storage duration is not greater than the preset duration threshold, that is, S106 further includes: and judging the storage time length T1 of the historical transaction data of the target task node, and determining that the preset condition is not met under the condition that the storage time length (the time interval of the current time and the distance T1) is not more than a preset time length threshold value. And if the storage duration is longer than the duration threshold, deleting the node data of the target historical task node.
The purposes of the above 1 and 2 are to improve the accuracy of node data of a target task node, and to delete expired data periodically and release storage space.
For another example: the method also comprises the following steps: in response to receiving the transaction data of the task node, firstly, judging whether the value of the key data item in the transaction data is null or not, and if so, determining that the processing result of the task node is failure. The method aims to recognize the condition that key data items in transaction data of task nodes are missing in advance, avoid wasting computing resources and further improve the transaction execution speed.
For another example, in S101, node data of the first task node is acquired and saved. That is, only the node data of the task node whose processing is successful is recorded.
In summary, a data processing method provided in the embodiment of the present application is summarized as a flow shown in fig. 2, and as shown in fig. 2, the method includes:
s201, acquiring a node identifier of a node to be processed.
In this embodiment, the node to be processed is any task node of the transaction task to be processed. The node identifier uniquely identifies the node to be processed. The method for acquiring the node identifier of the node to be processed refers to the prior art.
S202, acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed.
In this embodiment, the cache database includes node identifiers of the historical task nodes, transaction data, and processing results. Optionally, in response to a failure in executing the transaction task, node data of the historical task node is acquired and saved in the cache database. For a specific storage method of the node data of the historical task node, reference is made to the above embodiment, which is not described herein again.
In this embodiment, the historical transaction data of the node to be processed is the transaction data corresponding to the historical task node with the same node identifier as the node to be processed, and the historical processing result of the node to be processed is the processing result corresponding to the historical task node with the same node identifier as the node to be processed.
S203, judging whether the historical transaction data of the node to be processed meets a preset condition at least according to the transaction data of the node to be processed.
In this embodiment, the preset conditions include: and the transaction data of the node to be processed meet a preset matching rule.
It should be noted that, the matching rule is preconfigured according to the calculation model corresponding to the target task node, and the configuration principle is as follows: and after the two sets of transaction data meeting the matching rules are respectively input into the calculation model, the output results are the same. In general, matching rules of different calculation models may be different, and a specific configuration method is referred to in the prior art.
And S204, if the historical transaction data of the node to be processed meets the preset conditions, taking the historical processing result of the node to be processed as the processing result of the node to be processed.
And S205, acquiring a transaction result of the transaction task according to the processing result of each node to be processed.
In this embodiment, the processing result of each to-be-processed node is obtained according to S201 to S204, and the method for obtaining the transaction result of the to-be-processed transaction task in this step includes multiple methods, which may be specifically referred to in the prior art.
According to the technical scheme, the data processing method, the data processing device, the data processing equipment and the readable storage medium, which are provided by the embodiment of the application, obtain the node identification of the node to be processed, wherein the node to be processed is any task node of the transaction task to be processed. And acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, wherein the cache database comprises the node identifiers of the historical task nodes, the transaction data and the processing results. Judging whether the historical transaction data of the node to be processed meets preset conditions at least according to the transaction data of the node to be processed, wherein the preset conditions comprise: and the transaction data of the node to be processed meets the matching rule. And if the historical transaction data of the node to be processed meets the preset conditions, taking the historical processing result of the node to be processed as the processing result of the node to be processed. And acquiring a transaction result of the transaction task according to the processing result of each node to be processed. According to the method, under the condition that the transaction data and the historical transaction data of the node to be processed meet the preset conditions, the historical processing result of the node to be processed is used as the processing result of the node to be processed, repeated calculation is reduced, calculation resources are saved, and the transaction processing efficiency is improved.
Fig. 3 is a schematic structural diagram of a data processing apparatus provided in an embodiment of the present application, and as shown in fig. 3, the apparatus may include:
an identifier obtaining unit 301, configured to obtain a node identifier of a node to be processed, where the node to be processed is any task node of a transaction task to be processed;
a historical data obtaining unit 302, configured to obtain historical transaction data and a historical processing result of the node to be processed from a preset cache database according to the node identifier of the node to be processed, where the cache database includes the node identifier of the historical task node, the transaction data, and the processing result;
a condition determining unit 303, configured to determine, at least according to the transaction data of the node to be processed, whether the historical transaction data of the node to be processed meets a preset condition, where the preset condition includes: the transaction data of the node to be processed and the transaction data of the node to be processed meet a matching rule;
a processing result obtaining unit 304, configured to take a historical processing result of the node to be processed as a processing result of the node to be processed if the historical transaction data of the node to be processed meets the preset condition;
a transaction result obtaining unit 305, configured to obtain a transaction result of the transaction task according to a processing result of each node to be processed.
Optionally, the apparatus further comprises: the storage unit is used for taking any transaction task as a historical transaction task if the execution of any transaction task fails; acquiring node identification, transaction data and processing results of historical task nodes, wherein the historical task nodes comprise at least one task node of the historical transaction task; and correspondingly storing the node identification, the transaction data and the processing result of the historical task node into the cache database.
Optionally, the apparatus further comprises: the updating unit is used for inquiring the storage time of the node data of the historical task nodes in the cache database according to a preset period; and deleting the node data of the historical task nodes with the storage time exceeding a preset time threshold.
Optionally, the historical data obtaining unit is configured to obtain the historical transaction data and the historical processing result of the task node from a preset cache database according to the node identifier of the task node, and includes: the history data acquisition unit is specifically configured to:
querying a historical task node which is the same as the node identifier of the target task node in the cache database to serve as the target historical task node;
acquiring transaction data corresponding to the node identification of the target historical task node from the cache database as historical transaction data of the task node;
and acquiring a processing result corresponding to the node identification of the target historical task node from the cache database as a historical processing result of the task node.
Optionally, the processing result obtaining unit is further configured to:
if the historical transaction data of the node to be processed does not meet the preset condition, deleting the historical transaction data and the historical processing result of the node to be processed from the cache database;
and inputting the transaction data of the node to be processed into a target model to obtain a processing result of the node to be processed output by the target model, wherein the target model is a calculation model corresponding to the node to be processed.
Optionally, the preset conditions further include: the storage duration is not greater than a preset duration threshold.
Optionally, the backfilling unit is configured to backfill the historical transaction data of the node to be processed to a preset task interface corresponding to the node to be processed after the historical transaction data and the historical processing result of the node to be processed are obtained from a preset cache database according to the node identifier of the node to be processed; and displaying the historical processing result of the node to be processed on the task interface.
Fig. 4 shows a schematic structural diagram of the data processing apparatus, which may include: at least one processor 401, at least one communication interface 402, at least one memory 403 and at least one communication bus 404;
in the embodiment of the present application, the number of the processor 401, the communication interface 402, the memory 403, and the communication bus 404 is at least one, and the processor 401, the communication interface 402, and the memory 403 complete communication with each other through the communication bus 404;
the memory 403 may include a high-speed RAM memory, and may further include a non-volatile memory (non-volatile memory) or the like, such as at least one disk memory;
the memory stores a program, and the processor can execute the program stored in the memory, so as to realize the steps of the data processing method provided by the embodiment of the application, as follows:
a method of data processing, comprising:
acquiring a node identifier of a node to be processed, wherein the node to be processed is any task node of a transaction task to be processed;
acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, wherein the cache database comprises the node identifiers of the historical task nodes, the transaction data and the processing results;
judging whether the historical transaction data of the node to be processed meets a preset condition at least according to the transaction data of the node to be processed, wherein the preset condition comprises the following steps: the transaction data of the node to be processed and the transaction data of the node to be processed meet a matching rule;
if the historical transaction data of the node to be processed meets the preset condition, taking the historical processing result of the node to be processed as the processing result of the node to be processed;
and acquiring a transaction result of the transaction task according to the processing result of each node to be processed.
Optionally, the method further comprises:
if any transaction task fails to be executed, taking the transaction task as a historical transaction task;
acquiring node identification, transaction data and processing results of historical task nodes, wherein the historical task nodes comprise at least one task node of the historical transaction task;
and correspondingly storing the node identification, the transaction data and the processing result of the historical task node into the cache database.
Optionally, the method further comprises:
inquiring the storage time of the node data of the historical task nodes in the cache database according to a preset period;
and deleting the node data of the historical task nodes with the storage time exceeding a preset time threshold.
Optionally, obtaining historical transaction data and historical processing results of the task node from a preset cache database according to the node identifier of the task node, including:
querying a historical task node which is the same as the node identifier of the target task node in the cache database to serve as the target historical task node;
acquiring transaction data corresponding to the node identification of the target historical task node from the cache database as historical transaction data of the task node;
and acquiring a processing result corresponding to the node identification of the target historical task node from the cache database as a historical processing result of the task node.
Optionally, the method further comprises:
if the historical transaction data of the node to be processed does not meet the preset condition, deleting the historical transaction data and the historical processing result of the node to be processed from the cache database;
and inputting the transaction data of the node to be processed into a target model to obtain a processing result of the node to be processed output by the target model, wherein the target model is a calculation model corresponding to the node to be processed.
Optionally, the preset conditions further include: the storage duration is not greater than a preset duration threshold.
Optionally, after the obtaining, according to the node identifier of the node to be processed, the historical transaction data and the historical processing result of the node to be processed from a preset cache database, the method further includes:
backfilling the historical transaction data of the node to be processed to a preset task interface corresponding to the node to be processed;
and displaying the historical processing result of the node to be processed on the task interface.
An embodiment of the present application further provides a readable storage medium, where the readable storage medium may store a computer program suitable for being executed by a processor, and when the computer program is executed by the processor, the computer program implements the steps of the data processing method provided in the embodiment of the present application, as follows:
a method of data processing, comprising:
acquiring a node identifier of a node to be processed, wherein the node to be processed is any task node of a transaction task to be processed;
acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, wherein the cache database comprises the node identifiers, the transaction data and the processing results of the historical task nodes;
judging whether the historical transaction data of the node to be processed meets a preset condition at least according to the transaction data of the node to be processed, wherein the preset condition comprises the following steps: the transaction data of the node to be processed and the transaction data of the node to be processed meet a matching rule;
if the historical transaction data of the node to be processed meets the preset condition, taking the historical processing result of the node to be processed as the processing result of the node to be processed;
and acquiring a transaction result of the transaction task according to the processing result of each node to be processed.
Optionally, the method further comprises:
if any transaction task fails to be executed, taking the transaction task as a historical transaction task;
acquiring node identification, transaction data and processing results of historical task nodes, wherein the historical task nodes comprise at least one task node of the historical transaction task;
and correspondingly storing the node identification, the transaction data and the processing result of the historical task node into the cache database.
Optionally, the method further comprises:
inquiring the storage time of the node data of the historical task nodes in the cache database according to a preset period;
and deleting the node data of the historical task nodes with the storage time exceeding a preset time threshold.
Optionally, obtaining historical transaction data and historical processing results of the task node from a preset cache database according to the node identifier of the task node, including:
querying a historical task node which is the same as the node identifier of the target task node in the cache database to serve as the target historical task node;
acquiring transaction data corresponding to the node identification of the target historical task node from the cache database as historical transaction data of the task node;
and acquiring a processing result corresponding to the node identification of the target historical task node from the cache database as a historical processing result of the task node.
Optionally, the method further comprises:
if the historical transaction data of the node to be processed does not meet the preset condition, deleting the historical transaction data and the historical processing result of the node to be processed from the cache database;
and inputting the transaction data of the node to be processed into a target model to obtain a processing result of the node to be processed output by the target model, wherein the target model is a calculation model corresponding to the node to be processed.
Optionally, the preset conditions further include: the storage duration is not greater than a preset duration threshold.
Optionally, after the obtaining, according to the node identifier of the node to be processed, the historical transaction data and the historical processing result of the node to be processed from a preset cache database, the method further includes:
backfilling the historical transaction data of the node to be processed to a preset task interface corresponding to the node to be processed;
and displaying the historical processing result of the node to be processed on the task interface.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising a … …" does not exclude the presence of another identical element in a process, method, article, or apparatus that comprises the element.
In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method of data processing, comprising:
acquiring a node identifier of a node to be processed, wherein the node to be processed is any task node of a transaction task to be processed;
acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, wherein the cache database comprises the node identifiers of the historical task nodes, the transaction data and the processing results;
judging whether the historical transaction data of the node to be processed meets a preset condition at least according to the transaction data of the node to be processed, wherein the preset condition comprises the following steps: the transaction data of the node to be processed and the transaction data of the node to be processed meet a matching rule;
if the historical transaction data of the node to be processed meets the preset condition, taking the historical processing result of the node to be processed as the processing result of the node to be processed;
and acquiring a transaction result of the transaction task according to the processing result of each node to be processed.
2. The method of claim 1, further comprising:
if any transaction task fails to be executed, taking the transaction task as a historical transaction task;
acquiring node identification, transaction data and processing results of historical task nodes, wherein the historical task nodes comprise at least one task node of the historical transaction task;
and correspondingly storing the node identification, the transaction data and the processing result of the historical task node into the cache database.
3. The method of claim 2, further comprising:
inquiring the storage time of the node data of the historical task nodes in the cache database according to a preset period;
and deleting the node data of the historical task nodes with the storage time exceeding a preset time threshold.
4. The method according to claim 1, wherein the obtaining of the historical transaction data and the historical processing result of the task node from a preset cache database according to the node identifier of the task node comprises:
querying a historical task node which is the same as the node identifier of the target task node in the cache database to serve as the target historical task node;
acquiring transaction data corresponding to the node identification of the target historical task node from the cache database as historical transaction data of the task node;
and acquiring a processing result corresponding to the node identification of the target historical task node from the cache database as a historical processing result of the task node.
5. The method of claim 1, further comprising:
if the historical transaction data of the node to be processed does not meet the preset condition, deleting the historical transaction data and the historical processing result of the node to be processed from the cache database;
and inputting the transaction data of the node to be processed into a target model to obtain a processing result of the node to be processed output by the target model, wherein the target model is a calculation model corresponding to the node to be processed.
6. The method according to claim 1 or 5, wherein the preset condition further comprises: the storage duration is not greater than a preset duration threshold.
7. The method according to claim 1, wherein after the obtaining of the historical transaction data and the historical processing result of the node to be processed from the preset cache database according to the node identifier of the node to be processed, the method further comprises:
backfilling the historical transaction data of the node to be processed to a preset task interface corresponding to the node to be processed;
and displaying the historical processing result of the node to be processed on the task interface.
8. A data processing apparatus, comprising:
the system comprises an identification acquisition unit, a transaction processing unit and a transaction processing unit, wherein the identification acquisition unit is used for acquiring a node identification of a node to be processed, and the node to be processed is any task node of a transaction task to be processed;
the historical data acquisition unit is used for acquiring historical transaction data and historical processing results of the nodes to be processed from a preset cache database according to the node identifiers of the nodes to be processed, and the cache database comprises the node identifiers, the transaction data and the processing results of historical task nodes;
a condition determining unit, configured to determine whether historical transaction data of the node to be processed meets a preset condition at least according to the transaction data of the node to be processed, where the preset condition includes: the transaction data of the node to be processed and the transaction data of the node to be processed meet a matching rule;
a processing result obtaining unit, configured to take a historical processing result of the node to be processed as a processing result of the node to be processed if the historical transaction data of the node to be processed meets the preset condition;
and the transaction result acquisition unit is used for acquiring the transaction result of the transaction task according to the processing result of each node to be processed.
9. A data processing apparatus, characterized by comprising: a memory and a processor;
the memory is used for storing programs;
the processor, which executes the program, implements each step of the data processing method according to any one of claims 1 to 7.
10. A readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the data processing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211019452.5A CN115393087A (en) | 2022-08-24 | 2022-08-24 | Data processing method, device and equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211019452.5A CN115393087A (en) | 2022-08-24 | 2022-08-24 | Data processing method, device and equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115393087A true CN115393087A (en) | 2022-11-25 |
Family
ID=84120376
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211019452.5A Pending CN115393087A (en) | 2022-08-24 | 2022-08-24 | Data processing method, device and equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115393087A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115695432A (en) * | 2023-01-04 | 2023-02-03 | 河北华通科技股份有限公司 | Load balancing method and device, electronic equipment and storage medium |
-
2022
- 2022-08-24 CN CN202211019452.5A patent/CN115393087A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115695432A (en) * | 2023-01-04 | 2023-02-03 | 河北华通科技股份有限公司 | Load balancing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108647357B (en) | Data query method and device | |
| CN109241067B (en) | Transaction data management method and device | |
| CN109472577B (en) | Account crediting method, account crediting device, computer equipment and storage medium | |
| CN112988812B (en) | Inventory data processing method, device, equipment and storage medium | |
| CN111367904A (en) | Service processing method and device and server | |
| CN115393087A (en) | Data processing method, device and equipment and readable storage medium | |
| CN110070440A (en) | A kind of business data processing method, device, equipment and storage medium | |
| CN111027984A (en) | Business order processing method and system, electronic equipment and computer storage medium | |
| CN104951306A (en) | Data processing method and system based on real-time calculation frame | |
| PH12016000002A1 (en) | Proactive duplicate identification | |
| US20240290128A1 (en) | Document analysis to identify document characteristics and appending the document characteristics to a record | |
| CN116167860A (en) | Account checking processing method and device, electronic equipment and storage medium | |
| CN108959514B (en) | Data processing method and device | |
| CN107169767B (en) | Transaction processing method and system | |
| WO2021129005A1 (en) | Blockchain state change-based transaction tracking method and device | |
| CN112598428A (en) | Transaction data processing method and device, computer equipment and storage medium | |
| CN111582878A (en) | Transaction risk prediction method, device and system | |
| CN110457272B (en) | Bill batch processing method and device | |
| EP3285179A1 (en) | Data transfer method and device | |
| CN111260460A (en) | Bank note box management method, device, equipment and medium | |
| CN115858668A (en) | Distributed transaction processing method, device, electronic device and storage medium | |
| CN113177671A (en) | Data processing method, device and equipment and readable storage medium | |
| CN112418848A (en) | Order processing method and device, computer equipment and storage medium | |
| JP6224669B2 (en) | Payment application system, payment application method, and program | |
| CN117172901A (en) | Transaction processing method and device, storage medium and electronic equipment |
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 |