WO2020211358A1

WO2020211358A1 - Database scheduling method and apparatus, and computer device and storage medium

Info

Publication number: WO2020211358A1
Application number: PCT/CN2019/118039
Authority: WO
Inventors: 李家捷
Original assignee: 平安普惠企业管理有限公司
Priority date: 2019-04-15
Filing date: 2019-11-13
Publication date: 2020-10-22
Also published as: CN110147270A

Abstract

A database scheduling method and apparatus, and a computer device and a storage medium. The method comprises: calculating a plurality of paths contained in a triggered operation series (S301); calculating time required for executing each path according to a step to be executed required by each path (S302); and finally, performing database scheduling, and preferentially executing said step of the path that takes the longest time in a database scheduling process (S303). By introducing a key path method into a database scheduling design, a computer can obtain the key steps of the key path in the database scheduling process by means of calculation and give a higher priority to the key steps, so that computer resources can be preferentially used in the key steps of the key path, thereby implementing the optimization of the overall scheduling timeliness, and reducing the overall delay of the computer scheduling process.

Description

Database scheduling method, device, computer equipment and storage medium

This application requires the priority of the Chinese patent application submitted to the Chinese Patent Office on April 15, 2019. The patent name is "Database scheduling method, device, computer equipment and storage medium", and the application number is 201910300315.0. Incorporated in this application by reference.

Technical field

This application relates to the field of scheduling and application of database platforms, and in particular to a database scheduling method, device, computer equipment, and storage medium.

Background technique

Database scheduling is to perform a series of operations in order. At present, the inventor found that in database scheduling, priority settings are often only performed for scheduling jobs, and there is no optimization method for scheduling jobs themselves, and the overall scheduling time is longer.

Summary of the invention

In view of this, this application proposes a database scheduling method, device, computer equipment, and storage medium, which can optimize the scheduling timeliness of jobs in the database scheduling process.

First of all, in order to achieve the above object, this application proposes a database scheduling method, the method includes: calculating a plurality of paths included in a triggered operation series; wherein, the operation series includes a plurality of steps to be executed; The to-be-executed steps required by the path calculate the time required to execute each path; database scheduling is performed, and the to-be-executed steps of the path with the longest time required are preferentially executed in the database scheduling process.

To achieve the above objective, the present application also provides a database scheduling device, which includes: a path calculation module adapted to calculate multiple paths included in a triggered operation series; wherein the operation series includes a plurality of steps to be executed; The time calculation module is adapted to calculate the time required to execute each path according to the to-be-executed steps required for each path; the scheduling module is adapted to perform database scheduling, and in the database scheduling process, the execution of the longest time required The steps to be executed on the path.

In order to achieve the foregoing objective, the present application also provides a computer device, including a memory, a processor, and computer-readable instructions stored in the memory and capable of running on the processor. The processor executes the computer-readable instructions when the computer-readable instructions are executed. The above database scheduling method.

To achieve the foregoing objective, the present application also provides a non-volatile computer-readable storage medium having computer-readable instructions stored thereon, and the computer-readable instructions implement the foregoing database scheduling method when executed by a processor.

In the database scheduling method, device, computer equipment, and storage medium proposed in this application, by introducing the critical path method into the database scheduling design, the computer can calculate the key steps of the critical path in the database scheduling process and give it higher Priority allows computer resources to be used first on the key steps of the critical path, thereby optimizing the overall scheduling timeliness and reducing the overall delay of the computer scheduling process.

Description of the drawings

FIG. 1 is a diagram of an optional application environment of the database scheduling method of each embodiment of the present application;

Figure 2 is a topological diagram of a set of operation series in the database of each embodiment of the present application;

3 is a schematic flowchart of the database scheduling method according to the first embodiment of the present application;

FIG. 4 is a schematic flow chart of determining key steps in the database scheduling method of the first embodiment of the present application;

FIG. 5 is a schematic flowchart of another critical step in the database scheduling method of the first embodiment of the present application;

FIG. 6 is a schematic diagram of the process of judging the critical path in the database scheduling method of the first embodiment of the present application;

FIG. 7 is a schematic diagram of program modules of the database scheduling device according to the second embodiment of the present application;

FIG. 8 is a schematic diagram of the hardware structure of the computer device according to the third embodiment of the present application.

The realization, functional characteristics, and advantages of the purpose of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings.

detailed description

In order to make the purpose, technical solutions, and advantages of this application clearer, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the application, and not used to limit the application. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of this application.

It should be noted that the descriptions related to "first", "second", etc. in this application are only for descriptive purposes, and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of technical features indicated. . Therefore, the features defined with "first" and "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but it must be based on what can be achieved by a person of ordinary skill in the art. When the combination of technical solutions is contradictory or cannot be achieved, it should be considered that such a combination of technical solutions does not exist. , Not within the scope of protection required by this application.

Refer to Figure 1, which is a schematic diagram of an optional application environment for database scheduling. The business system 20 communicates with the database 10 in a wired or wireless manner. The user can interact with the business system 20 to make the business system 20 perform all operations. Required database scheduling tasks. The business system 20 may be in the form of hardware with computing capabilities such as computers, mobile phones, tablet computers, and servers.

In the following embodiments, the database 10 can be a private resource for users to use alone. Of course, in more cases, the database 10 is a shared resource that can be used by multiple users. The database 10 can provide multiple resources including access data. The user can also customize a series of operations including multiple operations. This series of operations includes multiple steps to be performed. The steps to be performed include trigger conditions that trigger one or more other steps to be performed, that is, these steps to be performed There is a dependency relationship in the steps, and the execution of some steps depends on other steps being executed first. Once the series of operations including these steps to be executed are triggered to be executed, the steps to be executed will be executed in order, which is equivalent to that one operation can Multiple operations were performed.

For example, when a user is shopping online, after the payment operation step is successfully executed, multiple subsequent scheduling steps involving the database may be executed. The database needs to store the customer's order information, and the database needs to update the inventory quantity of the product. .

Please refer to Figure 2. In each embodiment of the present application, the database call includes 7 steps S1, S2, S3, S4, S5, S6, S7, where step S1 includes trigger conditions for triggering steps S2 and S3. S2 includes the trigger conditions for triggering step S4, step S3 includes the trigger conditions for triggering steps S4 and S6, step S4 includes the trigger conditions for triggering step S5, and both steps S5 and S6 include the trigger conditions for triggering step S7.

First embodiment

Refer to Figure 3, which is a flowchart of an embodiment of a database scheduling method of the present application. The method includes the following steps S301-S303:

Step S301: Calculate multiple paths included in the triggered operation series.

Wherein, the path is an orderly execution chain formed by a series of multiple steps to be executed in the series of operations. Specifically in the database 10 of this embodiment, each step to be executed may include conditions that trigger the execution of multiple steps. , So there may be multiple paths in database scheduling, and each path requires different time.

For example, step S1 includes conditions for triggering the execution of steps S2 and S3. After step S1 is executed, this trigger condition is triggered, and then steps S2 and S3 are executed. Steps S2 and S3 both include the trigger conditions that trigger the execution of step S4. Therefore, there are two execution paths from steps S1-S4, which are steps S1-S2-S4 and steps S1-S3-S4, because steps S2 and S3 The required time is not used, so the paths S1-S2-S4 and paths S1-S3-S4 take different time.

In this step, the method for calculating the multiple paths included in the triggered operation series specifically includes steps S301a-S301b:

Step S301a: Form the topological relationship between all the steps to be executed according to all the trigger conditions; specifically, determine in turn whether each step to be executed contains a trigger condition, if the step to be executed contains a trigger condition, The trigger condition obtains the sequence number of each to-be-executed step that depends on the to-be-executed step, and establishes the topological relationship between the to-be-executed step and the triggered to-be-executed step.

Step S301b, generating all the orderly execution chains composed of the steps to be executed according to the topological relationship, and these orderly execution chains are the paths.

Step S302: Calculate the time required to execute each path according to the to-be-executed steps required for each path.

The steps required for different paths are not the same. Some paths may not require specific steps. For example, when a user makes an online purchase, if the user fails to make a payment, he only needs to save the user's payment information to the database instead of updating it in the database. The inventory quantity of the product.

Referring to FIG. 3, in this embodiment, during the database scheduling process, the following paths are included.

L1: S1-S2-S4-S5-S7;

L2: S1-S3-S4-S5-S7;

L3: S1-S3-S6-S7;

For example, in this embodiment, the time required to load each step in step S1 to step S7 is t1 to t7, and the time required to load each step is specifically as follows: t1=1 second, t2=1 second, t3= 2 seconds, t4=2 seconds, t5=1 second, t6=5 seconds, t7=1 second. Then, the total time T1, T2, and T3 of the above paths L1, L2, and L3 are respectively:

T1=t1+t2+t4+t5+t7=1+1+2+1+1=6 seconds;

T2=t1+t3+t4+t5+t7=1+2+2+1+1=7 seconds;

T3=t1+t3+t6+t7=1+2+5+1=8 seconds.

In this step, the time required to load each step to be executed can be manually entered in the database, but preferably, the following step is included before this step is executed: separately loading all the steps to be executed included in the operation series , Record the loading time required to load each step to be executed. Here, the individual loading process of the steps to be executed is a trial execution of the steps to be executed, that is, each step to be executed is individually loaded into the CPU cache of the business system 20, and the computing resources required to execute each step to be executed separately can be known according to the loading time. It can provide a basis for optimizing the use of computing resources during the subsequent execution of the entire series of operations. In this way, before calculating the total time of each path, the time required for each step to be executed can be known by preloading and entered into the database 10. During the implementation of this step, each path included Add the loading time of all the steps to be executed to get the time required to execute each path.

In step S303, database scheduling is performed, and the steps to be executed of the path with the longest time required are preferentially executed in the database scheduling process.

In the database scheduling process, the series of operations including multiple steps to be executed are either not executed or all executed. In the prior art, due to lack of optimization and priority allocation, each different path is automatically based on trigger conditions. A certain key step of the path that takes a long time to be executed may take a long time, but it is executed later. At this time, computer resources are already occupied by other steps, resulting in a long overall time.

In the database scheduling process, the steps to be executed in the path that takes the longest time to be executed first can be embodied as: if a previous step to be executed contains the trigger conditions of the other two steps to be executed, the previous step to be executed runs After completion, the next step will give priority to the steps to be executed on the path that takes a longer time.

In another embodiment, in the database scheduling process, the steps to be executed of the path with the longest time required to be executed first can also be embodied as: each step of the path with the longest time in the database scheduling process is assigned higher The priority of each step on this path will be executed first, and the steps of the path with less time will be executed after the path with the longest time is executed, so as to ensure that the computer resources are given priority to execute these time On the critical path, thereby reducing the overall delay.

For example, in this embodiment, if there is no optimization, in the process of executing database scheduling, in paths L2 and L3, steps S4 and S6 are executed at the same time, the time will be greater than 2+5=7 seconds, and the overall delay will be greater than 13 second.

After optimization, steps S1, S3, S6, and S7 in the longest path L3 are assigned a higher priority. In database scheduling, steps S1, S3, S6, and S7 are executed first to ensure the priority use of computer resources In the critical steps of the critical path, the overall delay of the database scheduling process can be reduced.

In a further embodiment, in addition to the priority optimization for the steps to be executed on the path with the longest running time, for other paths, the priority can be set according to the length of the running time, that is, the path with the longer running time is required The steps to be executed are assigned a higher priority, and the steps to be executed with a shorter running time are assigned a lower priority. Taking the above three paths L1, L2, and L3 as an example, the order of the running time of the three paths is T3> T2>T1, based on this, in addition to assigning higher priority to the steps to be executed on the L3 path, the steps to be executed on the L2 path are assigned the next level of priority, and the steps to be executed on the L1 path have the lowest priority. There are two forms of priority here: First, the priority of each step to be executed on the path with higher priority is higher. Taking the above three paths of L1, L2, and L3 as examples, the priority of L3 path is executed. Steps S1, S3, S6, S7 included, and then steps S4, S5, S7 included in the L2 path (where steps S1, S3 overlap with the L3 path), and finally steps S2, S4, S5, and S5 included in the L1 path are executed. S7 (where step S1 coincides with the path L2 and L3). The second type is to exercise priority only between multiple to-be-executed steps that rely on the same to-be-executed step. For example, in paths L2 and L3, step S3 includes the triggering conditions of step S4 and step S6, due to the time required to load path L3 It is longer than the time required for the loading of path L2, so the priority of step S6 is higher than the priority of step S4, and step S6 is executed first.

In another embodiment, in an operation series that includes multiple steps to be executed, there may be the following situation: the running time of one or more of all the paths included is not the longest, but among them The included steps to be executed are more critical. According to the scheduling method of the first embodiment, the key steps to be executed in these paths are ignored, and computing resources are preferentially allocated to the path with the longest running time. In order to avoid the above situation, you can In the database 10, individual weights are preset for specific steps to be executed in several paths. Thus, in the above step S303, referring to FIG. 4, the following steps S401-S402 are executed first in the database scheduling process, and the time required to execute the first step is the longest. Steps to be executed for the long path:

Step S401, sequentially determining whether each path includes a step to be executed with a separate weight;

In step S402, among the multiple to-be-executed steps that rely on the same to-be-executed step, priority is given to sequentially execute the weighted to-be-executed steps according to their weights, or to assign and The weight corresponds to the priority.

In this step, in the first case, in the database scheduling process, if multiple subsequent steps to be executed rely on the same prior step to be executed, then according to the weight, the higher weight of the subsequent step to be executed will be executed first. Then execute the next step with lower weight. Taking the above three paths L1, L2, and L3 as an example, if step S4 in path L2 and step S6 in path L3 have separate weights, set the weight of step S4 in path L2 to 0.7, and step S6 in path L3 The weight of is 0.3. In the database scheduling process, since step S3 includes the triggering conditions of step S4 and step S6, when step S3 is executed, since the weight of step S4 is higher than that of step S6, step S4 is executed first. The execution of other steps to be executed is still carried out according to the priority assigned according to the time required for path execution.

In the latter case, the priority corresponding to the weight is assigned to each step to be executed in the path where the step to be executed with a higher weight is located, so that the entire path where the key step to be executed is located is executed first. Taking the above three paths L1, L2, and L3 as an example, since the weight of step S4 in L2 is greater than the weight of step S6 in path L3, all the steps to be executed in path L2 are assigned the highest priority, and in path L1 and In path L3, since the time required to execute path L3 is greater than the time required to execute path L1, the priority of path L3 is higher than that of path L1.

By setting individual weights for the critical steps of the critical path, the calculated critical path can be made more scientific and reasonable.

In another embodiment, in an operation series that includes multiple steps to be executed, there may be the following situation: the running time of one or more of all the paths included is not the longest, but among them The included steps to be executed are more critical. According to the scheduling method of the first embodiment, the key steps to be executed in these paths are ignored, and computing resources are preferentially allocated to the path with the longest running time. In order to avoid the above situation, you can The database 10 presets special priorities for specific steps to be executed in several paths. In the above step S303, referring to FIG. 5, the following steps S501-S502 are executed first in the database scheduling process. Steps to be executed for the long path:

Step S501: sequentially determine whether each path includes a step to be executed with a special priority;

Step S502 is to preferentially execute a to-be-executed step with a special priority among multiple to-be-executed steps that rely on the same to-be-executed step, or assign each to-be-executed step in the path where the to-be-executed step with a special priority is located priority.

The above step S502 can ensure that when relying on the same previous step to be executed, the next step to be executed with a special priority is executed first, or the entire critical path with key steps is executed first. Taking the above three paths L1, L2, and L3 as an example, if a special priority is set for step S4 in step L2, in the former case, in the database scheduling process, since step S3 includes the trigger conditions of step S4 and step S6, When step S3 is executed, because step S4 has a special priority, step S4 is executed first, and the execution of other steps to be executed is still executed according to the priority allocated according to the time required for path execution; in the latter case, in the database In the scheduling process, since step S4 in path L2 has a special priority, each step to be executed in path L2 is assigned the highest priority. In path L1 and path L3, the time required to execute path L3 is longer than the execution time. The path L1 takes time, so the priority of the path L3 is higher than the priority of the path L1.

In another embodiment, in an operation series that includes multiple steps to be executed, there may be a situation where one or more of all the paths included are more critical, and according to the scheduling of the first embodiment In this way, these critical paths are ignored, and computing resources are assigned to the path with the longest running time. In order to avoid the above situation, the critical path can be assigned a preset priority. As shown in Figure 6, priority is given to the database scheduling process. Perform the following steps S601-S602, and then prioritize the execution of the pending steps of the path that takes the longest time:

Step S601: Determine whether each path has priority in turn;

In step S602, each step to be executed on the path with priority is executed first.

If multiple paths have priority, the steps with priority are executed in sequence according to the priority level.

Still taking the above three paths L1, L2, and L3 as an example, if path L1 has a preset priority, steps S1, S2, S4, S5, and S7 of path L1 will be executed first in the database scheduling process, and the remaining path L2 In path L3, since the time required to execute path L3 is greater than the time required to execute path L2, the priority of path L3 is higher than that of path L2. After the steps of path L1 are executed, step S3 of path L3 is executed. , S6, S7, and finally execute steps S4, S5, S7 of path L2. If path L1 has the preset highest priority and path L2 has the preset second highest priority, then in the database scheduling process, the execution order of the three paths is: L1, L2, L3.

Second embodiment

Please refer to FIG. 7, which shows a schematic diagram of program modules of a database scheduling apparatus 700 according to a second embodiment of the present application. In this embodiment, the database scheduling device 700 may include or be divided into one or more program modules, and the one or more program modules are stored in a storage medium and executed by one or more processors to complete this Apply, and implement the above database scheduling method. The program module referred to in the embodiments of the present application refers to a series of computer-readable instruction segments that can complete specific functions, and is more suitable for describing the execution process of the database scheduling method in the storage medium than the program itself. The following description will specifically introduce the functions of each program module in this embodiment:

The path calculation module 701 is adapted to calculate multiple paths included in the triggered operation series.

For example, step S1 includes the conditions that trigger the execution of steps S2 and S3. After step S1 is executed, this trigger condition is triggered, and then steps S2 and S3 are executed. Steps S2 and S3 both include the trigger conditions that trigger the execution of step S4. Therefore, there are two execution paths from steps S1-S4, which are steps S1-S2-S4 and steps S1-S3-S4, because steps S2 and S3 The required time is not used, so the paths S1-S2-S4 and paths S1-S3-S4 take different time.

Here, the method for the path calculation module 701 to calculate the multiple paths included in the triggered operation series specifically includes steps S301a-S301b:

In step S301a, the path calculation module 701 forms the topological relationship between all the steps to be executed according to all the trigger conditions; specifically, it sequentially determines whether each step to be executed includes a trigger condition, and if the step to be executed includes The trigger condition is to obtain the sequence number of each to-be-executed step dependent on the to-be-executed step according to the triggering condition, and establish the topological relationship between the to-be-executed step and the triggered to-be-executed step.

In step S301b, the path calculation module 701 generates all the orderly execution chains composed of the steps to be executed according to the topological relationship, and these orderly execution chains are the paths.

The time calculation module 702 is adapted to calculate the time required to execute each path according to the to-be-executed steps required for each path.

L1: S1-S2-S4-S5-S7;

L2: S1-S3-S4-S5-S7;

L3: S1-S3-S6-S7;

T1=t1+t2+t4+t5+t7=1+1+2+1+1=6 seconds;

T2=t1+t3+t4+t5+t7=1+2+2+1+1=7 seconds;

T3=t1+t3+t6+t7=1+2+5+1=8 seconds.

In this step, the time required to load each step to be executed may be manually entered in the database, but preferably, the following step is included before the execution of this step: the time calculation module 702 performs all the steps to be executed included in the operation series The steps are loaded individually, and the loading time required to load each step to be executed is recorded. Here, the separate loading process of the time calculation module 702 for the steps to be executed is a trial execution of the steps to be executed, that is, the time calculation module 702 individually loads each step to be executed into the CPU cache of the business system 20, and can know that each step is executed separately according to the loading time. The computing resources required for each step to be executed can provide a basis for optimizing the use of computing resources during the subsequent execution of the entire series of operations. In this way, before calculating the respective total time of each path, the time calculation module 702 can know the time required for each step to be executed separately by preloading and enter it into the database 10, and respectively record all the paths contained in each path. The loading time of the steps to be executed is added to obtain the time required to execute each path.

The scheduling module 703 performs database scheduling, and in the database scheduling process, the to-be-executed steps of the path with the longest time required are preferentially executed.

For example, in this embodiment, if there is no optimization, when the scheduling module 703 executes database scheduling, in paths L2 and L3, steps S4 and S6 are executed simultaneously, and the time required will be greater than 2+5=7 seconds, and the overall delay Will be greater than 13 seconds.

After optimization, the scheduling module 703 assigns higher priority to steps S1, S3, S6, and S7 in the longest path L3. In database scheduling, steps S1, S3, S6, and S7 are executed first to ensure that the computer The resources are prioritized in the key steps of the critical path, which can reduce the overall delay of the database scheduling process.

In a further embodiment, in addition to the priority optimization of the scheduling module 703 for the steps to be executed on the path with the longest running time, for other paths, the priority can be set according to the length of the running time, that is, the required running time is longer The steps to be executed in the long path are assigned a higher priority, and the steps to be executed with a shorter running time are assigned a lower priority. Taking the above three paths L1, L2, and L3 as an example, the order of the running time of the three paths For T3>T2>T1, in addition to assigning a higher priority to the steps to be executed on the L3 path, the steps to be executed on the L2 path are assigned the next level of priority, and the steps to be executed on the L1 path have priority The lowest level. There are two forms of priority here: First, the priority of each step to be executed on the path with higher priority is higher. Taking the above three paths of L1, L2, and L3 as examples, the priority of L3 path is executed. Steps S1, S3, S6, S7 included, and then steps S4, S5, S7 included in the L2 path (where steps S1, S3 overlap with the L3 path), and finally steps S2, S4, S5, and S5 included in the L1 path are executed. S7 (where step S1 coincides with the path L2 and L3). The second type is to exercise priority only between multiple to-be-executed steps that rely on the same to-be-executed step. For example, in paths L2 and L3, step S3 includes the triggering conditions of step S4 and step S6, due to the time required to load path L3 It is longer than the time required for the loading of path L2, so the priority of step S6 is higher than the priority of step S4, and step S6 is executed first.

In another embodiment, in an operation series that includes multiple steps to be executed, there may be the following situation: the running time of one or more of all the paths included is not the longest, but among them The included steps to be executed are more critical. According to the scheduling method of the first embodiment, the scheduling module 703 ignores the key steps to be executed in these paths, and preferentially allocates computing resources to the path with the longest running time, in order to avoid the above situation. In the database 10, individual weights can be preset for specific to-be-executed steps in several paths, so in the above step S303, referring to FIG. 4, the scheduling module 703 preferentially executes the following steps S401-S402 during the database scheduling process. Then give priority to the steps to be executed on the path that takes the longest time:

Step S401: The scheduling module 703 sequentially determines whether each path includes a step to be executed with a separate weight;

Step S402, the scheduling module 703, among the multiple to-be-executed steps that depend on the same step-to-be-executed, preferentially executes the weighted to-be-executed steps according to the weights, or each path in which the weighted to-be-executed steps are located. The steps are assigned a priority corresponding to the weight.

In this step, in the first scenario, in the database scheduling process of the scheduling module 703, if multiple subsequent steps to be executed rely on the same prior to be executed step to be executed, according to the weight, the higher priority is given to the later to be executed. Execute the step, and then execute the next step with lower weight. Taking the above three paths L1, L2, and L3 as an example, if step S4 in path L2 and step S6 in path L3 have separate weights, set the weight of step S4 in path L2 to 0.7, and step S6 in path L3 The weight of is 0.3. In the database scheduling process, since step S3 includes the triggering conditions of step S4 and step S6, when step S3 is executed, since the weight of step S4 is higher than that of step S6, step S4 is executed first. The execution of other steps to be executed is still carried out according to the priority assigned according to the time required for path execution.

In another embodiment, in an operation series that includes multiple steps to be executed, there may be the following situation: the running time of one or more of all the paths included is not the longest, but among them The included steps to be executed are more critical. According to the scheduling method of the first embodiment, the scheduling module 703 ignores the key steps to be executed in these paths, and preferentially allocates computing resources to the path with the longest running time, in order to avoid the above situation. In the database 10, special priorities may be preset for specific steps to be executed in several paths. In the above step S303, referring to FIG. 5, the scheduling module 703 preferentially executes the following steps S501-S502 during the database scheduling process. Then give priority to the steps to be executed on the path that takes the longest time:

Step S501: The scheduling module 703 sequentially determines whether each path includes a step to be executed with a special priority;

In step S502, the scheduling module 703 preferentially executes the to-be-executed steps with a special priority among multiple to-be-executed steps that rely on the same to-be-executed step, or for each of the paths where the to-be-executed steps with special priority are located. Prioritize execution steps.

Step S601, the scheduling module 703 sequentially determines whether each path has a priority;

In step S602, if yes, the scheduling module 703 preferentially executes each to-be-executed step on the path with priority.

Still taking the above three paths L1, L2, and L3 as an example, if path L1 has a preset priority, the scheduling module 703 will give priority to executing steps S1, S2, S4, S5, and S7 of path L1 in the database scheduling process, and the rest In path L2 and path L3, since the time required to execute path L3 is greater than the time required to execute path L2, the priority of path L3 is higher than that of path L2. After the steps of path L1 are executed, path L3 is executed again Steps S3, S6, S7 of path L2, and finally steps S4, S5, S7 of path L2 are executed. If the path L1 has the preset highest priority, and the path L2 has the preset second highest priority, the scheduling module 703 performs the order of the three paths in the database scheduling process: L1, L2, L3.

The third embodiment

Refer to FIG. 8, which is a schematic diagram of the hardware architecture of the computer device 800 according to the third embodiment of the present application. In this embodiment, the computer device 800 is a device that can automatically perform numerical calculation and/or information processing according to pre-set or stored instructions. As shown in the figure, the computer equipment 800 at least includes, but is not limited to, a memory 801, a processor 802, a network interface 803, and a database scheduling device 804 that can communicate with each other through a system bus. among them:

In this embodiment, the memory 801 includes at least one type of non-volatile computer-readable storage medium. The readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), Random access memory (RAM), static random access memory (SRAM), read only memory (ROM), electrically erasable programmable read only memory (EEPROM), programmable read only memory (PROM), magnetic memory, magnetic disk, optical disk Wait. In some embodiments, the memory 801 may be an internal storage unit of the computer device 800, such as a hard disk or memory of the computer device 800. In other embodiments, the memory 801 may also be an external storage device of the computer device 800, for example, a plug-in hard disk, a smart media card (SMC), and a secure digital (Secure Digital, SD card, Flash Card, etc. Of course, the memory 801 may also include both an internal storage unit of the computer device 800 and an external storage device thereof. In this embodiment, the memory 801 is generally used to store the operating system and various application software installed in the computer device 800, such as the program code of the database scheduling device 804. In addition, the memory 801 can also be used to temporarily store various types of data that have been output or will be output.

In some embodiments, the processor 802 may be a central processing unit (Central Processing Unit, CPU), a controller, a microcontroller, a microprocessor, or other data processing chips. The processor 802 is generally used to control the overall operation of the computer device 800. In this embodiment, the processor 802 is used to run the program code or process data stored in the memory 801, for example, to run the database scheduling device 804, to implement the database scheduling method in the first embodiment.

The network interface 803 may include a wireless network interface or a wired network interface, and the network interface 803 is usually used to establish a communication connection between the computer device 800 and other electronic devices. For example, the network interface 803 is used to connect the computer device 800 with an external terminal through a network, and establish a data transmission channel and a communication connection between the computer device 800 and the external terminal. The network may be Intranet, Internet, Global System of Mobile Communication (GSM), Wideband Code Division Multiple Access (WCDMA), 4G network, 5G Network, Bluetooth (Bluetooth), Wi-Fi and other wireless or wired networks.

It should be pointed out that FIG. 8 only shows a computer device 800 with components 801-804, but it should be understood that it is not required to implement all the components shown, and more or fewer components may be implemented instead.

In this embodiment, the database scheduling device 804 stored in the memory 801 may also be divided into one or more program modules. The one or more program modules are stored in the memory 801 and are composed of one or more program modules. Are executed by two processors (the processor 802 in this embodiment) to complete the database scheduling method of this application.

Fourth embodiment

This embodiment also provides a non-volatile computer-readable storage medium, such as flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), random access memory (RAM), static random access memory ( SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, server, App application mall, etc., on which storage There are computer-readable instructions, and the corresponding functions are realized when the program is executed by the processor. The non-volatile computer-readable storage medium of this embodiment is used to store the database scheduling device 700 or 804, and when executed by a processor, the database scheduling method of this application is implemented.

The serial numbers of the foregoing embodiments of the present application are for description only, and do not represent the superiority of the embodiments.

Through the description of the above embodiments, those skilled in the art can clearly understand that the method of the above embodiments can be implemented by means of software plus the necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases the former is better.的实施方式。 Based on this understanding, the technical solution of this application essentially or the part that contributes to the existing technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk, The optical disc) includes several instructions to enable a terminal device (which can be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the method described in each embodiment of the present application.

The above are only preferred embodiments of this application, and do not limit the scope of this application. Any equivalent structure or equivalent process transformation made using the content of the description and drawings of this application, or directly or indirectly used in other related technical fields , The same reason is included in the scope of patent protection of this application.

Claims

A database scheduling method, the method includes:

Calculate multiple paths included in the triggered operation series; wherein, the operation series includes multiple steps to be executed;

Calculate the time required to execute each path according to the steps to be executed required for each path;

Perform database scheduling, and prioritize the execution of the steps to be executed on the path that takes the longest time in the database scheduling process.
The database scheduling method according to claim 1, wherein a number of the steps to be executed include a trigger condition, the trigger condition can trigger at least one other step to be executed, and the calculation of multiple paths included in the triggered operation series include:

Forming a topological relationship between all the steps to be executed according to all the trigger conditions;

According to the topological relationship, all the orderly execution chains composed of the steps to be executed form a path.
The database scheduling method according to claim 1, wherein before calculating the multiple paths included in the triggered operation series, the method further comprises:

All the steps to be executed included in the operation series are individually loaded, and the loading time required to load each step to be executed is recorded;

The calculating the time required to execute each path according to the to-be-executed steps required by each path specifically includes:

The loading times of all the steps to be executed included in each path are respectively added to obtain the time required to execute each path.
The database scheduling method according to claim 1, after calculating the time required to execute each path according to the steps to be executed required for each path, the method further comprises:

Assign a priority to each step to be executed on the path that takes the longest time.
The database scheduling method according to claim 1, wherein the specific to-be-executed steps in the several paths have preset individual weights, and before the to-be-executed steps of the path with the longest time required for priority execution, the method further comprises:

Sequentially determine whether each of the paths includes steps to be executed with separate weights;

If yes, among the multiple to-be-executed steps that rely on the same step to be executed, priority is given to execute the weighted steps to be executed in sequence according to the weight, or each step to be executed in the path where the weighted step to be executed is assigned corresponding to the weight priority.
The database scheduling method according to claim 1, wherein the specific to-be-executed steps in several of the paths have preset special priorities, and before the to-be-executed steps of the path with the longest time required for priority execution, the method further comprises:

Sequentially determine whether each path includes a step to be executed with a special priority;

If yes, among multiple to-be-executed steps that depend on the same to-be-executed step, priority is given to the to-be-executed step with special priority, or priority is assigned to each to-be-executed step in the path where the to-be-executed step with special priority is located.
5. The database scheduling method according to claim 1, wherein a number of the paths have preset priorities, and before the step to be executed for the path with the longest time required for priority execution, the method further comprises:

Judge whether each path has priority in turn;

If yes, each step to be executed on the path with priority is executed first.
A database scheduling device, which includes:

The path calculation module is suitable for calculating multiple paths included in the triggered operation series; wherein, the operation series includes multiple steps to be executed;

The time calculation module is adapted to calculate the time required to execute each path according to the to-be-executed steps required by each path;

The scheduling module is suitable for database scheduling, and in the database scheduling process, the steps to be executed of the path with the longest time required are preferentially executed.
A computer device includes a memory, a processor, and computer-readable instructions stored on the memory and capable of running on the processor. The method for implementing database scheduling when the processor executes the computer-readable instructions includes:

Calculate multiple paths included in the triggered operation series; wherein, the operation series includes multiple steps to be executed;

Calculate the time required to execute each path according to the steps to be executed required for each path;

Perform database scheduling, and prioritize the execution of the steps to be executed on the path that takes the longest time in the database scheduling process.
The computer device according to claim 9, wherein a number of the steps to be executed include a trigger condition, and the trigger condition can trigger at least one other step to be executed, and the multiple paths included in the series of operations triggered by the calculation include :

Forming a topological relationship between all the steps to be executed according to all the trigger conditions;

According to the topological relationship, all the orderly execution chains composed of the steps to be executed form a path.
9. The database scheduling method according to claim 9, before calculating the multiple paths included in the triggered operation series, the method further comprises:

All the steps to be executed included in the operation series are individually loaded, and the loading time required to load each step to be executed is recorded;

The calculating the time required to execute each path according to the to-be-executed steps required by each path specifically includes:

The loading times of all the steps to be executed included in each path are respectively added to obtain the time required to execute each path.
9. The computer device according to claim 9, after calculating the time required to execute each path according to the steps to be executed required for each path, further comprising:

Assign a priority to each step to be executed on the path that takes the longest time.
9. The computer device according to claim 9, wherein the specific steps to be executed in the several paths have preset individual weights, and before the steps to be executed of the path with the longest time required for priority execution, the method further comprises:

Sequentially determine whether each of the paths includes steps to be executed with separate weights;

If yes, among the multiple to-be-executed steps that rely on the same step to be executed, priority is given to execute the weighted steps to be executed in sequence according to the weight, or each step to be executed in the path where the weighted step to be executed is assigned corresponding to the weight priority.
9. The computer device according to claim 9, wherein the specific to-be-executed steps in several of the paths have preset special priorities, and before the to-be-executed steps of the path with the longest time required for priority execution, the method further comprises:

Sequentially determine whether each path includes a step to be executed with a special priority;

If yes, among multiple to-be-executed steps that depend on the same to-be-executed step, the to-be-executed step with a special priority is preferentially executed, or a priority is assigned to each to-be-executed step in the path where the to-be-executed step with special priority is located.
9. The computer device according to claim 9, wherein a number of the paths have a preset priority, and before the steps to be executed for the path with the longest time required for priority execution, the method further comprises:

Judge whether each path has priority in turn;

If yes, each step to be executed on the path with priority is executed first.
A non-volatile computer-readable storage medium having computer-readable instructions stored thereon. The method for implementing database scheduling when the computer-readable instructions are executed by a processor includes:

Calculate multiple paths included in the triggered operation series; wherein, the operation series includes multiple steps to be executed;

Calculate the time required to execute each path according to the steps to be executed required for each path;

Perform database scheduling, and prioritize the execution of the steps to be executed on the path that takes the longest time in the database scheduling process.
The computer-readable storage medium according to claim 16, wherein a number of the steps to be executed include a trigger condition, and the trigger condition can trigger at least one other step to be executed, and the calculation is triggered by multiple steps included in the sequence of operations. The paths include:

Forming a topological relationship between all the steps to be executed according to all the trigger conditions;

According to the topological relationship, all the orderly execution chains composed of the steps to be executed form a path.
16. The computer-readable storage medium of claim 16, wherein the calculation of the multiple paths included in the triggered operation series further comprises:

All the steps to be executed included in the operation series are individually loaded, and the loading time required to load each step to be executed is recorded;

The calculating the time required to execute each path according to the to-be-executed steps required by each path specifically includes:

The loading time of all the steps to be executed included in each path are added to obtain the time required to execute each path.
15. The computer-readable storage medium according to claim 16, after calculating the time required to execute each path according to the steps to be executed required for each path, further comprising:

Assign a priority to each step to be executed on the path that takes the longest time.
The computer-readable storage medium according to claim 16, wherein a specific step to be executed in a plurality of the paths has a preset individual weight, and the step to be executed of the path with the longest time required for priority execution further includes :

Sequentially determine whether each of the paths includes steps to be executed with separate weights;

If yes, among the multiple to-be-executed steps that rely on the same step to be executed, priority is given to execute the weighted steps to be executed in sequence according to the weight, or each step to be executed in the path where the weighted step to be executed is assigned corresponding to the weight priority.