CN114048236A - Data information query method and device, electronic equipment and readable storage medium - Google Patents

Data information query method and device, electronic equipment and readable storage medium Download PDF

Info

Publication number
CN114048236A
CN114048236A CN202111360188.7A CN202111360188A CN114048236A CN 114048236 A CN114048236 A CN 114048236A CN 202111360188 A CN202111360188 A CN 202111360188A CN 114048236 A CN114048236 A CN 114048236A
Authority
CN
China
Prior art keywords
task
target
execution result
identification information
target association
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111360188.7A
Other languages
Chinese (zh)
Inventor
谢环球
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhongdian Jinxin Software Co Ltd
Original Assignee
Zhongdian Jinxin Software Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhongdian Jinxin Software Co Ltd filed Critical Zhongdian Jinxin Software Co Ltd
Priority to CN202111360188.7A priority Critical patent/CN114048236A/en
Publication of CN114048236A publication Critical patent/CN114048236A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/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
    • 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/248—Presentation of query results

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Stored Programmes (AREA)

Abstract

The application provides a data information query method, a data information query device, an electronic device and a readable storage medium, wherein the method comprises the following steps: receiving a query request for querying data information of a target task associated with a current task in at least one first task required for completing a financial transaction; when the target association degree comprises information representing the dependent execution sequence, determining a first target association relation corresponding to the target association degree; when the target association degree comprises information representing the dependence execution result, determining a second target association relation corresponding to the target association degree; determining a target task from at least one first task and a second task triggered when the execution result of the first task is failure according to the first target incidence relation or the second target incidence relation; and taking the execution result and/or the transaction information of the target task as data information. The method can conveniently realize the purposes of duplication of financial transactions or error checking in links and the like.

Description

Data information query method and device, electronic equipment and readable storage medium
Technical Field
The present application relates to the field of information processing, and in particular, to a method and an apparatus for querying data information, an electronic device, and a readable storage medium.
Background
In the financial field, completing a financial transaction often requires the completion of multiple tasks. For example, in an international letter of credit establishment transaction in the context of an international task, there is the following task flow: the issuing applicant can continue to initiate the credit to the bill task (task two) through the required bill sent by the other party after applying for issuing the certificate (task one), and then can initiate the credit payment task (task three), which is the shortest flow process. That is, at least three or more tasks are required to complete the transaction in such a task scenario.
For purposes such as duplication, link debugging, etc., it is often necessary to analyze data information for the various tasks involved after the financial transaction is completed. In some application scenarios, for example, data information such as transaction amount, transaction user, transaction time, and the like corresponding to each task may be analyzed to determine an analysis task such as a task flow that has an error or can be improved.
However, in the related art, only the purpose of querying the data information of the current task or the latest task can be achieved, so that the data information of a plurality of related tasks cannot be queried at the same time, which is not beneficial to the data analysis work.
Disclosure of Invention
An object of the embodiments of the present application is to provide a method and an apparatus for querying data information, an electronic device, and a readable storage medium, which are used to find a target history task that meets a query requirement.
In a first aspect, an embodiment of the present application provides a method for querying data information, where the method includes: receiving a query request for querying data information of a target task associated with a current task in at least one first task required for completing a financial transaction; the query request comprises current identification information of the current task and a target association degree between the target task and the current task; when the target association degree comprises information representing a dependent execution sequence, determining a first target association relation corresponding to the target association degree; when the target association degree comprises information representing a dependence execution result, determining a second target association relation corresponding to the target association degree; determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target incidence relation or the second target incidence relation; and taking the execution result and/or the transaction information of the target task as the data information. Therefore, the target task can be found by utilizing the target association degree between the current task and the target task. And then, the target task and the data information corresponding to the current task can be analyzed simultaneously, so that the purposes of duplication of financial transactions or error checking in links and the like are realized.
Optionally, the method further includes establishing a first association relationship and a second association relationship between the identification information corresponding to the first task and the second task in advance based on the following steps: storing the preorder identification information corresponding to the received preorder task; storing subsequent identification information respectively corresponding to the received at least one subsequent task; wherein the subsequent task is executed depending on an execution result of the preceding task, or the subsequent task is located after the preceding task in an execution order; establishing the first association relationship between the preorder identification information and the subsequent identification information according to the precedence relationship between the preorder task and at least one subsequent task in the execution sequence; or establishing the second association relationship between the preorder identification information and the subsequent identification information according to the dependency relationship between the preorder task and at least one subsequent task on the execution result. Therefore, the first incidence relation or the second incidence relation between the preorder identification information and the subsequent identification information can be established based on the dependency relation of the preorder task and the subsequent task on the execution sequence or the execution result, so that the corresponding target task can be conveniently found based on the identification information, and the method is convenient and quick.
Optionally, the target association degree further includes an execution sequence interval number; determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target association relation or the second target association relation, wherein the determining comprises the following steps: and searching out tasks with execution sequences positioned before or after the current task and corresponding to the interval number of the execution sequences from the first task and the second task as the target tasks according to the first target association relation. Thus, the corresponding target task can be accurately found according to the known execution sequence interval number.
Optionally, when the number of the execution sequence intervals corresponds to a plurality of tasks, and all the tasks executed by the preambles of the tasks are successful, the task is taken as the target task. Therefore, the corresponding target task can be conveniently and accurately found in the first task.
Optionally, the target association degree further includes an execution result interval number; determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target association relation or the second target association relation, wherein the determining comprises the following steps: and according to the second target association relation, searching for the task depending on the execution result of the current task from the first task and the second task, or taking the task corresponding to the interval number of the execution result as the target task from the tasks depending on the execution result of the current task. Therefore, the corresponding target task can be accurately searched according to the known execution result interval number.
Optionally, the determining, by the target association degree including target identification information, a target task from the at least one first task and a second task triggered when an execution result of the first task is a failure according to the first target association relationship or the second target association relationship includes: and according to the first target incidence relation or the second target incidence relation, taking a task between the task corresponding to the target identification information and the current task from the first task and the second task as the target task. Therefore, all tasks between the task corresponding to the target identification information and the current task can be used as target tasks to be searched, and the target tasks can be conveniently searched in batches.
Optionally, the method for querying data information further includes: presenting the at least one target task; and when the selection operation of any one target task is detected, displaying the transaction information content and the execution result corresponding to the target task by using a preset display template. Therefore, on one hand, a user can quickly find the corresponding information content based on the familiar preset display template, and on the other hand, the management of the information content of the task can be facilitated. Therefore, when the task information is stored, only the information content which is required to be displayed in the preset display template needs to be stored, and the display form of the information content is not concerned, so that the typesetting pressure of the user on the information content is reduced to a certain extent.
In a second aspect, an embodiment of the present application provides an apparatus for querying data information, where the apparatus includes: the receiving module is used for receiving a query request for querying data information associated with a current task in at least one first task required for completing the financial transaction; wherein the query request includes current identification information of the current task, a target association degree between the at least one first task and the current task;
the first determining module is used for determining a first target association relation corresponding to the target association degree when the target association degree comprises information representing a dependent execution sequence; a second determining module, configured to determine, when the target association degree includes information characterizing a dependent execution result, a second target association relationship corresponding to the target association degree; a third determining module, configured to determine, according to the first target association relationship or the second target association relationship, a target task from the at least one first task and a second task triggered when an execution result of the first task is a failure; and the feedback module is used for taking the execution result and/or the transaction information of the target task as the data information.
In a third aspect, an embodiment of the present application provides an electronic device, including a processor and a memory, where the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the steps in the method as provided in the first aspect are executed.
In a fourth aspect, embodiments of the present application provide a readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, performs the steps in the method as provided in the first aspect.
Additional features and advantages of the present application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the embodiments of the present application. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments of the present application will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and that those skilled in the art can also obtain other related drawings based on the drawings without inventive efforts.
Fig. 1 is a flowchart of a data information query method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a preset display template according to an embodiment of the present disclosure;
fig. 3 is a block diagram illustrating a structure of an apparatus for querying data information according to an embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of an electronic device for executing a data information query method 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.
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. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.
In the related technology, the data information of a plurality of related tasks cannot be simultaneously inquired, and the problem that the data analysis work corresponding to the financial transaction where the tasks are located is not facilitated exists; in order to solve the problem, the application provides a method and a device for querying data information, electronic equipment and a readable storage medium; further, the method can inquire the data information of the target task with the target association degree with the current task according to the received inquiry request; in the query process, query can be performed based on the execution sequence or the execution result among tasks, and the execution result or the transaction information of the queried target task can be fed back to the query object as the query result, so that the query object performs data analysis work, and the purposes such as disk recovery, link error checking and the like are achieved.
In some application scenarios, the above query method for data information may be applied to a terminal device. Specifically, the query object may input a query request in the terminal device, and the terminal device may query the data information of the relevant task according to the query request. And then, the terminal equipment can also display the query object. Further, the terminal device may include, for example, a mobile phone, a computer, and other devices that can substantially perform information query. In other application scenarios, the above query method for data information may be applied to a server. Specifically, the query object may input a query request through the terminal device, then the terminal device may send the query request to the server, and after receiving the query request, the server may query data information of a related task and may send the queried data information to the terminal device. And then, the server can also instruct the terminal equipment to display the data information to the query object. Illustratively, the present application explains the query method of the data information by taking the application to the terminal device as an example.
The above solutions in the related art are all the results of practical and careful study of the inventor, and therefore, the discovery process of the above problems and the solutions proposed by the following embodiments of the present invention to the above problems should be the contribution of the inventor to the present invention in the course of the present invention.
Referring to fig. 1, a flowchart of a method for querying data information according to an embodiment of the present application is shown. As shown in fig. 1, the method for querying data information includes the following steps 101 to 105.
Step 101, receiving a query request for querying data information of a target task associated with a current task in at least one first task required for completing a financial transaction; the query request comprises current identification information of the current task and a target association degree between the target task and the current task;
the current identification information may be used to characterize identity information of the current task. Which may include words, numbers, symbols, or combinations thereof, and the like.
In some application scenarios, completing a financial transaction requires completing a plurality of first tasks. The association relationship can exist between the first tasks, so that the terminal equipment can inquire the data information of the related tasks according to the association degree between the current task and the target. For example, task B needs to be dependent on the execution result of task a to proceed; task C needs to be performed after task B is completed.
The terminal device can receive a query request input by a user, wherein the query request can be used for indicating data information of a target task with the target association degree with the current task. In some application scenarios, the terminal device may present a first input box for entering the query request, and the user may then enter the query request in this first input box. In other application scenarios, the terminal device may further respectively display a second input box for inputting the current identification information and a selection box for representing the target association degree, and then the user may input the current identification information in the second input box and perform a selection operation on the target selection box corresponding to the target association degree, thereby achieving the purpose of inputting the query request.
Step 102, when the target association degree comprises information representing a dependent execution sequence, determining a first target association relation corresponding to the target association degree;
after receiving the query request, the terminal device may detect information included in the target association degree.
In some application scenarios, if it is detected that the target association degree includes information characterizing the dependency execution order, a first target association relationship corresponding to the target association degree may be determined. That is, the target association degree may be used to characterize the dependency relationship between the current task and the target task in the execution order. For example, when the target association degree includes information that the current task is executed at the third position after the target task, the execution order relationship that the current task is located at the third position after the target task may be determined as the first target association relationship.
103, when the target association degree comprises information representing a dependence execution result, determining a second target association relation corresponding to the target association degree;
in other application scenarios, if it is detected that the target association degree includes information characterizing the dependent execution result, a second target association relationship corresponding to the target association degree may be determined. That is, the target association degree may be used to characterize the dependency relationship between the current task and the target task on the execution result. For example, when the target association degree includes information that the current task can be executed depending on the execution result of the target task, the execution result dependency relationship between the current task and the target task may be determined as the second target association relationship.
104, determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target incidence relation or the second target incidence relation;
after the first target association relationship or the second target association relationship corresponding to the target association degree is determined, the target task can be determined according to the first target association relationship or the second target association relationship.
In some application scenarios, if the determined target association degree is the first target association relationship, the target task may be determined according to the execution sequence, for example, the first target association relationship represents that the task a is executed second after the current task B, and the task a may be determined as the current target task.
In other application scenarios, if the determined current association degree is the second target association relationship, the target task may be determined according to the execution result, for example, the second target association relationship represents that the task a is executed depending on the execution result of the current task B, and the task a may be determined as the current target task. The second task here may be triggered when the result of the first task is a failure. For example, at least three first tasks, task a, task B, and task C, are required to complete a financial transaction; if the task B fails to execute, at this time, the task D may be triggered, and the task D may be regarded as a second task.
And 105, taking the execution result and/or the transaction information of the target task as the data information.
After the target task is determined, the execution result and/or the transaction information of the target task can be used as a query result. The execution result may include, for example, data content obtained after the target task is executed, or a result of normal execution or abnormal execution of the target task. The transaction information may include information such as transaction amount, transaction time, transaction user, etc. involved in the target task, for example.
In this embodiment, through the steps 101 to 105, the target task can be found by using the target association degree between the current task and the target task. And then, the target task and the data information corresponding to the current task can be analyzed simultaneously, so that the purposes of duplication of financial transactions or error checking in links and the like are realized.
In some optional implementation manners, the method for querying data information further includes establishing a first association relationship and a second association relationship between identification information corresponding to the first task and the second task in advance based on the following steps:
step 1, storing the preorder identification information corresponding to the received preorder task;
in some application scenarios, corresponding identification information may be configured for each task in advance, for example, identification information "001" may be configured for task a; the identification information "002" can be configured for the task B. Further, the association relationship between the identifications can be established among the tasks. The association relationship here may be a first association relationship based on the execution order or a second association relationship based on the execution result.
In some application scenarios, preamble identification information corresponding to a preamble task may be stored when it is received. For example, when identification information of a first task a is received, the first task a may be regarded as a received pre-heading of a second task B, and the identification information of the first task a may be regarded as pre-heading identification information of the second task B.
Step 2, storing the received at least one piece of subsequent identification information corresponding to the subsequent task; wherein the subsequent task is executed depending on an execution result of the preceding task, or the subsequent task is located after the preceding task in an execution order;
in some application scenarios, subsequent identification information corresponding to a subsequent task may be stored when it is received. For example, the second task B may be regarded as a task subsequent to the first task a, and the identification information of the second task B may be regarded as subsequent identification information corresponding to the last first task a.
In these application scenarios, the subsequent task may be executed depending on the execution result of the preceding task. For example, the subsequent task may be a loan task, the preceding task may be a collection of user information, the loan task may be handled for the user only after the collection of the user information is completed, and the subsequent task may be performed after the preceding task. For example, the subsequent task is to collect transaction currency information and the preceding task may be to collect transaction amount information.
Step 3, establishing the first association relationship between the preorder identification information and the subsequent identification information according to the precedence relationship between the preorder task and at least one subsequent task in the execution sequence;
in some application scenarios, the first association relationship may be established according to an execution sequence between a preceding task and a subsequent task. For example, if the identification information of the task a is "001" and the identification information of the task B is "002", and the task a can start to execute after the execution of the task B is finished, a first association relationship between the identification information "001" and the identification information "002" in the execution order can be established, that is, the identification information "002" is the next-bit identification information of the identification information "001", and the identification information "001" is the first-bit identification information of the identification information "002".
And 4, establishing the second association relationship between the preorder identification information and the subsequent identification information according to the dependency relationship between the preorder task and at least one subsequent task on the execution result.
In some application scenarios, the second association relationship may be established according to a dependency relationship between the preceding task and the subsequent task on the execution result. For example, if the identification information of task a is "001" and the identification information of task B is "002", and task a can be executed only depending on the execution result of task B (for example, task B is a loan task, task a can be a collection user information, and only after the collection of the user information is completed, the user can transact the loan task), a second association relationship between the identification information "001" and the identification information "002" in the execution result can be established, that is, the identification information "002" is the next-order identification information of the identification information "001", and the identification information "001" is the first-order identification information of the identification information "002".
Through the steps 1 to 4, the first association relationship or the second association relationship between the preorder identification information and the subsequent identification information can be established based on the dependency relationship between the preorder task and the subsequent task in the execution sequence or the execution result, so that the corresponding target task can be conveniently found based on the identification information, and the method is convenient and quick.
In some optional implementations, the target association degree further includes an execution sequence interval number, and the step 104 may include: and searching out tasks with execution sequences positioned before or after the current task and corresponding to the interval number of the execution sequences from the first task and the second task as the target tasks according to the first target association relation.
The execution sequence interval number can be regarded as the interval bit number of the target task and the current task in the execution sequence.
In some application scenarios, the target task may be determined according to the number of execution sequence intervals. For example, task a is the first task to be executed, task B is the second task to be executed, and task C is the third task to be executed, and if the current task is task a and the number of execution sequence intervals is 2, the target task may be task C. If the current task is task B and the number of execution sequence intervals is 1, the target task may be task a or task C. Thus, the corresponding target task can be accurately found according to the known execution sequence interval number.
In some optional implementation manners, when the number of the execution sequence intervals corresponds to a plurality of tasks, and all the tasks executed in the preambles of the tasks are successful, the task is taken as the target task.
In some application scenarios, if the number of execution sequence intervals corresponds to a plurality of tasks and the tasks executed in the preambles of the tasks are successful, the task may be considered as a target task. For example, task a is the first task to be executed, task B is the second task to be executed, task C is the second task to be executed, task D is the third task to be executed, and if the current task is task a, the number of execution sequence intervals is 2. If both task B and task C are successfully executed, task D may be considered as the target task. Therefore, the corresponding target task can be conveniently and accurately found in the first task.
In some optional implementations, the target association degree further includes an execution result interval number, and step 104 may include: and according to the second target association relation, searching for the task depending on the execution result of the current task from the first task and the second task, or taking the task corresponding to the interval number of the execution result as the target task from the tasks depending on the execution result of the current task.
The number of the execution result intervals can be regarded as the number of the interval bits between the target task and the current task in the execution result sequence.
In some application scenarios, the target task may be determined according to the number of execution result intervals. For example, task a is the first task to be executed, task B needs to be executed depending on the execution result of task a, and task C needs to be executed depending on the execution result of task B, and if the current task is task a and the number of execution result intervals is 2, the target task may be task C. If the current task is task B and the number of execution sequence intervals is 1, the target task may be task a. Therefore, the corresponding target task can be accurately searched according to the known execution result interval number.
In some optional implementations, the target association degree includes target identification information, and step 104 may include: and according to the first target incidence relation or the second target incidence relation, taking a task between the task corresponding to the target identification information and the current task from the first task and the second task as the target task.
The target identification information may be regarded as identification information of the target task.
In some application scenarios, the target task may be determined according to the target identification information. For example, after the target task of the target identification information "001" to be searched is determined, if the identification information of the current task is "002", the task a corresponding to the identification information arranged as "001" may be determined as the target task.
In other application scenarios, a task between the task corresponding to the target identification information and the current task may also be used as the target task. For example, after a task between a task corresponding to target identification information "003" to be searched and the current task is determined as a target task, if the identification information of the current task is "007", the configurations of "004", "005" and "006" may be determined as target tasks. Therefore, all tasks between the task corresponding to the target identification information and the current task can be used as target tasks to be searched, and the target tasks can be conveniently searched in batches.
In some optional implementations, the method for querying data information further includes:
106, displaying the at least one target task;
in some application scenarios, the terminal device may present multiple target tasks. For example, if the found target task is task a, task B, and task C, the information content of task a may be displayed in the first display frame, the information content of task B may be displayed in the second display frame, the information content of task C may be displayed in the third display frame, and the three display frames may be sequentially arranged in the display interface.
And 107, when the selection operation of any one target task is detected, displaying the transaction information content and the execution result corresponding to the target task by using a preset display template.
After the terminal device displays the target task, the user can perform selection operation based on the displayed target task. The selection operation herein may include, for example, an operation of performing a click or a long press with a mouse electrically connected to the terminal device.
After detecting that a user performs a selection operation on a certain target task, the terminal device may display corresponding information content by using a preset display template.
The preset presentation template may include, for example, a template for presenting task information content in a fixed format. Referring to fig. 2, fig. 2 is a schematic diagram illustrating a preset display template. The preset display template is named by identification information, a task purpose is displayed in a first text box, task object information is displayed in a second text box, the current state (such as an examination and approval state, a completion state and the like) is displayed in a third text box, and creation time is displayed in a fourth text box. The letters "a", "x", "y" in the drawings may represent any descriptive words or descriptive numbers or the like in the text boxes to which they pertain.
Through the steps 106 to 107, the corresponding information content can be displayed by using the preset display template according to the selection operation of the target task. On one hand, the user can quickly find the corresponding information content based on the familiar preset display template, and on the other hand, the management of the information content of the task can be facilitated. Therefore, when the task information is stored, only the information content which is required to be displayed in the preset display template needs to be stored, and the display form of the information content is not concerned, so that the typesetting pressure of the user on the information content is reduced to a certain extent.
Referring to fig. 3, a block diagram of a data information query apparatus provided in an embodiment of the present application is shown, where the data information query apparatus may be a module, a program segment, or a code on an electronic device. It should be understood that the apparatus corresponds to the above-mentioned embodiment of the method of fig. 1, and can perform various steps related to the embodiment of the method of fig. 1, and the specific functions of the apparatus can be referred to the description above, and the detailed description is appropriately omitted here to avoid redundancy.
Optionally, the querying device of the data information may include a receiving module 301, a first determining module 302, a second determining module 303, a third determining module 304, and a feedback module 305. The receiving module 301 is configured to receive a query request for querying data information associated with a current task in at least one first task required for completing a financial transaction; wherein the query request includes current identification information of the current task, a target association degree between the at least one first task and the current task; a first determining module 302, configured to determine, when the target association degree includes information characterizing a dependent execution order, a first target association relationship corresponding to the target association degree; a second determining module 303, configured to determine, when the target association degree includes information characterizing a dependency execution result, a second target association relationship corresponding to the target association degree; a third determining module 304, configured to determine, according to the first target association relationship or the second target association relationship, a target task from the at least one first task and a second task triggered when an execution result of the first task is a failure; a feedback module 305, configured to use the execution result of the target task and/or the transaction information as the data information.
Optionally, the apparatus for querying data information further includes a first association relationship and a second association relationship between identification information corresponding to the first task and the second task, respectively, that are established in advance based on the following steps: storing the preorder identification information corresponding to the received preorder task; storing subsequent identification information respectively corresponding to the received at least one subsequent task; wherein the subsequent task is executed depending on an execution result of the preceding task, or the subsequent task is located after the preceding task in an execution order; establishing the first association relationship between the preorder identification information and the subsequent identification information according to the precedence relationship between the preorder task and at least one subsequent task in the execution sequence; or establishing the second association relationship between the preorder identification information and the subsequent identification information according to the dependency relationship between the preorder task and at least one subsequent task on the execution result.
Optionally, the target association degree further includes an execution sequence interval number; the third determination module 304 is further configured to: and searching out tasks with execution sequences positioned before or after the current task and corresponding to the interval number of the execution sequences from the first task and the second task as the target tasks according to the first target association relation.
Optionally, when the number of the execution sequence intervals corresponds to a plurality of tasks, and all the tasks executed by the preambles of the tasks are successful, the task is taken as the target task.
Optionally, the target association degree further includes an execution result interval number; the third determination module 304 is further configured to: and according to the second target association relation, searching for the task depending on the execution result of the current task from the first task and the second task, or taking the task corresponding to the interval number of the execution result as the target task from the tasks depending on the execution result of the current task.
Optionally, the target association degree includes target identification information, and the third determining module 304 is further configured to: and according to the first target incidence relation or the second target incidence relation, taking a task between the task corresponding to the target identification information and the current task from the first task and the second task as the target task.
Optionally, the apparatus for querying data information further includes a display module, where the display module is configured to: presenting the at least one target task; and when the selection operation of any one target task is detected, displaying the transaction information content and the execution result corresponding to the target task by using a preset display template.
It should be noted that, for the convenience and brevity of description, the specific working procedure of the above-described apparatus may refer to the corresponding procedure in the foregoing method embodiment, and the description is not repeated herein.
Referring to fig. 4, fig. 4 is a schematic structural diagram of an electronic device for executing a data information query method according to an embodiment of the present application, where the electronic device may include: at least one processor 401, e.g., a CPU, at least one communication interface 402, at least one memory 403 and at least one communication bus 404. Wherein the communication bus 404 is used for realizing direct connection communication of these components. The communication interface 402 of the device in the embodiment of the present application is used for performing signaling or data communication with other node devices. The memory 403 may be a high-speed RAM memory, or may be a non-volatile memory (e.g., at least one disk memory). The memory 403 may optionally be at least one memory device located remotely from the aforementioned processor. The memory 403 stores computer readable instructions, and when the computer readable instructions are executed by the processor 401, the electronic device can execute the method process shown in fig. 1.
It will be appreciated that the configuration shown in fig. 4 is merely illustrative and that the electronic device may include more or fewer components than shown in fig. 4 or may have a different configuration than shown in fig. 4. The components shown in fig. 4 may be implemented in hardware, software, or a combination thereof.
Embodiments of the present application provide a readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the computer program may perform the method processes performed by an electronic device in the method embodiment shown in fig. 1.
The present embodiment discloses a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the method provided by the above-mentioned method embodiments, for example, the method may comprise: receiving a query request for querying data information associated with a current task in at least one first task required for completing a financial transaction; wherein the query request includes current identification information of the current task, a target association degree between the at least one first task and the current task; when the target association degree comprises information representing a dependent execution sequence, determining a first target association relation corresponding to the target association degree; when the target association degree comprises information representing a dependence execution result, determining a second target association relation corresponding to the target association degree; determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target incidence relation or the second target incidence relation; and taking the execution result and/or the transaction information of the target task as the data information.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
In addition, units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
Furthermore, the functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
In this document, 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.
The above description is only an example of the present application and is not intended to limit the scope of the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims (10)

1. A method for querying data information is characterized by comprising the following steps:
receiving a query request for querying data information of a target task associated with a current task in at least one first task required for completing a financial transaction; the query request comprises current identification information of the current task and a target association degree between the target task and the current task;
when the target association degree comprises information representing a dependent execution sequence, determining a first target association relation corresponding to the target association degree;
when the target association degree comprises information representing a dependence execution result, determining a second target association relation corresponding to the target association degree;
determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target incidence relation or the second target incidence relation;
and taking the execution result and/or the transaction information of the target task as the data information.
2. The method according to claim 1, further comprising establishing a first association relationship and a second association relationship between the identification information corresponding to the first task and the second task in advance based on the following steps:
storing the preorder identification information corresponding to the received preorder task;
storing subsequent identification information respectively corresponding to the received at least one subsequent task; wherein the subsequent task is executed depending on an execution result of the preceding task, or the subsequent task is located after the preceding task in an execution order;
establishing the first association relationship between the preorder identification information and the subsequent identification information according to the precedence relationship between the preorder task and at least one subsequent task in the execution sequence; or
And establishing the second association relationship between the preorder identification information and the subsequent identification information according to the dependency relationship between the preorder task and at least one subsequent task on the execution result.
3. The method of claim 1, wherein the target degree of association further comprises a number of execution order intervals;
determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target association relation or the second target association relation, wherein the determining comprises the following steps:
and searching out tasks with execution sequences positioned before or after the current task and corresponding to the interval number of the execution sequences from the first task and the second task as the target tasks according to the first target association relation.
4. The method according to claim 3, wherein when the number of the execution sequence intervals corresponds to a plurality of tasks, and all the tasks executed in the preface of the task are successful, the task is taken as the target task.
5. The method of claim 1, wherein the target degree of correlation further comprises a number of execution result intervals;
determining a target task from the at least one first task and a second task triggered when the execution result of the first task is failure according to the first target association relation or the second target association relation, wherein the determining comprises the following steps:
and according to the second target association relation, searching for the task depending on the execution result of the current task from the first task and the second task, or taking the task corresponding to the interval number of the execution result as the target task from the tasks depending on the execution result of the current task.
6. The method according to claim 1, wherein the target association degree includes target identification information, and determining a target task from the at least one first task and a second task triggered when an execution result of the first task is a failure according to the first target association relationship or the second target association relationship, includes:
and according to the first target incidence relation or the second target incidence relation, taking a task between the task corresponding to the target identification information and the current task from the first task and the second task as the target task.
7. The method of claim 1, further comprising:
presenting the at least one target task;
and when the selection operation of any one target task is detected, displaying the transaction information content and the execution result corresponding to the target task by using a preset display template.
8. An apparatus for querying data information, comprising:
the receiving module is used for receiving a query request for querying data information associated with a current task in at least one first task required for completing the financial transaction; wherein the query request includes current identification information of the current task, a target association degree between the at least one first task and the current task;
the first determining module is used for determining a first target association relation corresponding to the target association degree when the target association degree comprises information representing a dependent execution sequence;
a second determining module, configured to determine, when the target association degree includes information characterizing a dependent execution result, a second target association relationship corresponding to the target association degree;
a third determining module, configured to determine, according to the first target association relationship or the second target association relationship, a target task from the at least one first task and a second task triggered when an execution result of the first task is a failure;
and the feedback module is used for taking the execution result and/or the transaction information of the target task as the data information.
9. An electronic device comprising a processor and a memory, the memory storing computer readable instructions that, when executed by the processor, perform the method of any of claims 1-7.
10. A readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-7.
CN202111360188.7A 2021-11-17 2021-11-17 Data information query method and device, electronic equipment and readable storage medium Pending CN114048236A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111360188.7A CN114048236A (en) 2021-11-17 2021-11-17 Data information query method and device, electronic equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111360188.7A CN114048236A (en) 2021-11-17 2021-11-17 Data information query method and device, electronic equipment and readable storage medium

Publications (1)

Publication Number Publication Date
CN114048236A true CN114048236A (en) 2022-02-15

Family

ID=80209673

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111360188.7A Pending CN114048236A (en) 2021-11-17 2021-11-17 Data information query method and device, electronic equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN114048236A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110609740A (en) * 2019-09-19 2019-12-24 深圳前海微众银行股份有限公司 Method and device for determining dependency relationship between tasks
CN111125444A (en) * 2019-12-10 2020-05-08 中国平安财产保险股份有限公司 Big data task scheduling management method, device, equipment and storage medium
WO2020263723A1 (en) * 2019-06-28 2020-12-30 General Electric Company Machine-learning and combinatorial optimization framework for managing tasks of a dynamic system with limited resources
CN112581018A (en) * 2020-12-28 2021-03-30 北京世纪互联宽带数据中心有限公司 Process task management method, system, device and storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020263723A1 (en) * 2019-06-28 2020-12-30 General Electric Company Machine-learning and combinatorial optimization framework for managing tasks of a dynamic system with limited resources
CN110609740A (en) * 2019-09-19 2019-12-24 深圳前海微众银行股份有限公司 Method and device for determining dependency relationship between tasks
CN111125444A (en) * 2019-12-10 2020-05-08 中国平安财产保险股份有限公司 Big data task scheduling management method, device, equipment and storage medium
CN112581018A (en) * 2020-12-28 2021-03-30 北京世纪互联宽带数据中心有限公司 Process task management method, system, device and storage medium

Similar Documents

Publication Publication Date Title
CN112052111B (en) Processing method, device and equipment for server abnormity early warning and storage medium
CN110113200A (en) The correlating method of chain-circuit system and log system, device and storage medium
CN111177005A (en) Service application testing method, device, server and storage medium
CN109241014B (en) Data processing method and device and server
CN110636106B (en) Information pushing method and device, computer equipment and storage medium
CN110069413B (en) Test data communication, test method, device, equipment and storage medium
CN109766483B (en) Regular expression generation method, device, computer equipment and storage medium
CN108614742B (en) Report data verification method, system and device
CN107133233B (en) Processing method and device for configuration data query
CN108073707B (en) Financial business data updating method and device and computer readable storage medium
CN113312260B (en) Interface test method, device, equipment and storage medium
CN110969417A (en) Government affair item synchronization method, device, system, computer equipment and storage medium
CN110688305A (en) Test environment synchronization method, device, medium and electronic equipment
CN111985930A (en) Client number generation method and device
CN110232013B (en) Test method, test device, controller and medium
CN106708869B (en) Group data processing method and device
CN114048236A (en) Data information query method and device, electronic equipment and readable storage medium
CN116340172A (en) Data collection method and device based on test scene and test case detection method
CN112419052B (en) Transaction testing method, device, electronic equipment and readable storage medium
CN111145002A (en) Mobile terminal cloud tax implementation method and device
CN113657817A (en) Transaction processing method and device, electronic equipment and readable storage medium
CN104239475A (en) Method and device for analyzing time series data
CN114020642A (en) Big data task testing method and device, storage medium and electronic equipment
CN110348984B (en) Automatic credit card data input method and related equipment under different transaction channels
CN111857679B (en) Method and device for generating script program and script program processing system

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20220215