Execution method of database plan task, medium, product and equipment

Abstract

The invention provides a database plan task execution method, a medium, a product and equipment. The method comprises the steps of obtaining a to-be-executed scheduled task, wherein the scheduled task is a task at a preset starting moment; determining target lock state information required by execution according to the to-be-executed plan task; searching a transaction which is running at the starting moment and transaction lock state information corresponding to the transaction in a database; and determining an execution strategy of the to-be-executed plan task and transaction according to the target lock state information and the transaction lock state information. By means of the method, the execution strategy of the to-be-executed plan task and the to-be-executed plan task and the to-be-executed plan transaction can be automatically determined according to the actual situation, so that negative influences generated by the plan task and the to-be-executed plan transaction are avoided, and the applicability of the plan task function in the high-concurrency environment is improved.

Description

Technical Field

[0001] The present invention relates to the field of database technology, and in particular to a method, medium, product and device for executing a database planning task. Background Art

[0002] Most of the current mainstream relational databases have a scheduled task function. This function allows users to specify a certain time or time interval to execute a task. For example, if you create a scheduled task: insert data 1 into table t1 at 10:10:10 every day, the execution time of the task depends entirely on the user's input. However, when the task is executed, it may affect other transactions in the current database, or be affected by other transactions, causing the current task or other transactions in the database to fail. Summary of the invention

[0003] In view of the above problems, the present invention proposes a method, medium, product and device for executing database planning tasks that overcome the above problems or at least partially solve the above problems.

[0004] An object of the present invention is to adaptively adjust the execution strategy between planned tasks and transactions.

[0005] A further object of the present invention is to improve the applicability of the task planning function in a high concurrency environment.

[0006] Another further object of the present invention is to avoid negative impacts on both scheduled tasks and transactions.

[0007] In particular, the present invention provides a method for executing a database planning task, comprising:

[0008] Get the scheduled tasks to be executed. The scheduled tasks are tasks with a preset start time.

[0009] Determine the target lock status information required for execution according to the planned tasks to be executed;

[0010] Search the database for the transactions that are running at the startup time and the transaction lock status information corresponding to the transactions;

[0011] The execution strategy of the planned tasks and transactions to be executed is determined based on the target lock status information and the transaction lock status information.

[0012] Optionally, the step of determining target lock state information required for execution according to the planned task to be executed includes:

[0013] Test run the planned tasks to be executed;

[0014] Record the target lock status information obtained during the trial run of the scheduled task to be executed.

[0015] Optionally, the step of determining the execution strategy of the planned task and transaction to be executed according to the target lock state information and the transaction lock state information includes:

[0016] The correlation between the planned task to be executed and the transaction is calculated based on the target lock status information and the transaction lock status information;

[0017] Obtain the preset adjustment strategy, which is used to specify the execution priority of the planned tasks and transactions to be executed;

[0018] According to the relevance, the corresponding execution priority is selected from the preset adjustment strategies to determine the execution strategy.

[0019] Optionally, the target lock state information includes: the object lock acquired during the execution of the scheduled task to be executed and the time the object lock is held;

[0020] The transaction lock status information includes: the object locks held during the transaction and the time the object locks are held.

[0021] Optionally, the step of calculating the correlation between the planned task to be executed and the transaction according to the target lock state information and the transaction lock state information includes: substituting the target lock state information and the transaction lock state information into a preset formula to calculate the correlation;

[0022] The default formula is:

[0023]

[0024] w i Indicates the weight coefficient of the object lock, task_lock i Indicates the time that the scheduled task to be executed holds the lock of the i-th object. Indicates the average time that the scheduled task to be executed holds each object lock, transaction_lock i Indicates the time that the transaction holds the lock on the i-th object. Indicates the average time that a transaction holds a lock on each object.

[0025] Optionally, the step of determining the execution strategy according to the correlation and the preset adjustment strategy includes:

[0026] Determine whether the correlation is greater than a preset threshold;

[0027] If so, the default execution priority is obtained in the preset adjustment strategy, and the execution strategy corresponding to the planned task to be executed and the transaction is determined according to the default execution priority.

[0028] Optionally, the step of determining the execution strategies corresponding to the scheduled tasks and the transactions to be executed according to the default execution priority includes:

[0029] When the default execution priority is the task priority mode, the execution strategy is determined to terminate the transaction and start the scheduled task to be executed;

[0030] When the default execution priority is not the task priority mode, the execution strategy is determined to delay the start time of the scheduled task to be executed and wait for the transaction to be completed.

[0031] According to another aspect of the present invention, there is further provided a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps of any of the above-mentioned methods for executing database planning tasks are implemented.

[0032] According to yet another aspect of the present invention, a computer program product is provided, which includes a computer program, and when the computer program is executed by a processor, the steps of any one of the above-mentioned methods for executing database planning tasks are implemented.

[0033] According to another aspect of the present invention, a computer device is provided, comprising a memory, a processor, and a machine executable program stored in the memory and running on the processor, and the processor implements the steps of any one of the above-mentioned database planning task execution methods when executing the machine executable program.

[0034] The execution method of database planned tasks of the present invention first obtains the planned tasks to be executed, and the planned tasks are tasks with a preset start time; then, the target lock state information required for execution is determined according to the planned tasks to be executed; then, the transaction running at the start time and the transaction lock state information corresponding to the transaction are searched in the database; finally, the execution strategy of the planned tasks to be executed and the transaction is determined according to the target lock state information and the transaction lock state information. Through this method, the execution strategy of the planned tasks to be executed and the transaction can be automatically determined according to the actual situation, thereby avoiding the negative impact of the planned tasks and the transaction, and improving the applicability of the planned task function in a high-concurrency environment.

[0035] Based on the following detailed description of specific embodiments of the present invention in conjunction with the accompanying drawings, those skilled in the art will become more aware of the above and other objects, advantages and features of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Hereinafter, some specific embodiments of the present invention will be described in detail in an exemplary and non-limiting manner with reference to the accompanying drawings. The same reference numerals in the accompanying drawings indicate the same or similar components or parts. It should be understood by those skilled in the art that these drawings are not necessarily drawn to scale. In the accompanying drawings:

[0037] Figure 1 is a flowchart of a method for executing a database planning task according to an embodiment of the present invention;

[0038] Figure 2 is a flowchart of a method for executing a database planning task according to another embodiment of the present invention;

[0039] Figure 3 is a schematic diagram of a computer program product according to an embodiment of the present invention;

[0040] Figure 4 is a schematic diagram of a computer-readable storage medium according to an embodiment of the present invention; and

[0041] Figure 5 is a schematic diagram of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0042] It should be understood by those skilled in the art that the embodiments described below are only some embodiments of the present invention, rather than all embodiments of the present invention, and these embodiments are intended to explain the technical principles of the present invention, rather than to limit the protection scope of the present invention. Based on the embodiments provided by the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should still fall within the protection scope of the present invention.

[0043] It should be noted that the logic and / or steps represented in the flowchart or described in other ways herein can be considered as a sequenced list of executable instructions for implementing logical functions, which can be specifically implemented in any computer-readable medium for use by an instruction execution system, device or equipment (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or equipment and execute instructions), or used in combination with these instruction execution systems, devices or equipment.

[0044] The current scheduled tasks have a fixed start time, and after starting, they may affect other running transactions, or be affected by other running transactions. Therefore, this solution proposes a method for adaptively adjusting scheduled tasks, which aims to adaptively adjust the start time of scheduled tasks through functional algorithms and real-time data analysis, improve system efficiency, and ensure system problem-solving. This method is particularly suitable for environments where multiple transactions are running concurrently.

[0045] Figure 1 FIG. 1 is a flow chart of a method for executing a database planning task according to an embodiment of the present invention. Figure 1 As shown, the method for executing the database planning task at least includes the following steps S101 to S104.

[0046] Step S101, obtaining the scheduled task to be executed. The scheduled task is a task with a preset start time. In some optional embodiments, the method for obtaining the scheduled task to be executed can generally be to trigger this method some time before the scheduled task is officially started, and then predetermine the execution strategy between the scheduled task to be executed and the transaction running at the same start time according to this method. Those skilled in the art can determine the time of early triggering according to actual needs.

[0047] Step S102, determining the target lock state information required for execution according to the planned task to be executed. The target lock state information may generally include: the object lock acquired by the planned task to be executed and the time the object lock is held. Object lock is a mechanism used to control access to shared objects in multi-threaded programming. In a multi-threaded environment, multiple threads may access and operate the same object at the same time. If not controlled, data inconsistency or other concurrency problems may occur. Object lock is designed to avoid these problems. It can ensure that only one thread can access the locked object at any time.

[0048] In some optional embodiments, the step of determining the target lock state information required for execution according to the to-be-executed planned task may generally include: trial running the to-be-executed planned task; and recording the target lock state information obtained during the trial running of the to-be-executed planned task. The trial run generally refers to simulating the operation process of executing the task before the to-be-executed planned task is officially put into actual operation. The object locks that the to-be-executed planned task needs to hold and the time for holding each object lock can be obtained through the trial run.

[0049] Optionally, the target lock status information corresponding to different planned tasks to be executed may also be recorded through a preset table to facilitate subsequent query and calculation processes.

[0050] Step S103, searching the database for the transaction being run at the start time and the transaction lock status information corresponding to the transaction. The transaction lock status information may generally include: the object lock held during the transaction and the time the object lock is held. In some optional embodiments, since the running transaction itself holds the object lock, each transaction may maintain and record the object lock currently held by itself and the time when the lock is acquired. In addition, the time to release the object lock may be estimated to determine the time the transaction itself holds the object lock.

[0051] Step S104, determining the execution strategy of the planned tasks and transactions to be executed according to the target lock state information and the transaction lock state information.

[0052] In some optional embodiments, the step of determining the execution strategy of the planned tasks and transactions to be executed based on the target lock status information and the transaction lock status information may generally include: calculating the correlation between the planned tasks and transactions to be executed based on the target lock status information and the transaction lock status information; obtaining a preset adjustment strategy; and selecting a corresponding execution priority in the preset adjustment strategy based on the correlation, thereby determining the execution strategy. The preset adjustment strategy is generally used to specify the execution priority of the planned tasks and transactions to be executed, which can generally be a pre-set rule for dealing with the execution priority of the planned tasks and transactions to be executed under specific situations or conditions. The method of obtaining the preset adjustment strategy may generally include reading a system configuration file or actively inputting, and those skilled in the art may determine the method of obtaining the preset adjustment strategy based on actual conditions.

[0053] Optionally, the step of calculating the correlation between the planned task to be executed and the transaction according to the target lock state information and the transaction lock state information may generally include: substituting the target lock state information and the transaction lock state information into a preset formula to calculate the correlation;

[0054] The preset formula is shown in Formula 1:

[0055]

[0056] w i Indicates the weight coefficient of the object lock, task_lock i Indicates the time that the scheduled task to be executed holds the lock of the i-th object. Indicates the average time that the scheduled task to be executed holds each object lock, transaction_lock i Indicates the time that the transaction holds the lock on the i-th object. Indicates the average time that a transaction holds each object lock. The weight coefficient can be set to different values ​​according to different object locks, and those skilled in the art can determine the specific value of the weight coefficient according to actual conditions.

[0057] Through this method, the execution strategy of the scheduled tasks and transactions to be executed can be automatically determined according to the actual situation, thereby avoiding the negative impact of both scheduled tasks and transactions and improving the applicability of the scheduled task function in a high-concurrency environment.

[0058] In other optional embodiments, the preset adjustment policy can generally be set to set a default execution priority when the correlation is greater than a preset threshold, and an execution priority when the correlation is less than the preset threshold. The step of determining the execution policy based on the correlation and the preset adjustment policy can generally include: determining whether the correlation is greater than the preset threshold; if so, obtaining the default execution priority in the preset adjustment policy, and determining the execution policy corresponding to the scheduled task to be executed and the transaction according to the default execution priority.

[0059] Optionally, the step of determining the execution strategy corresponding to the scheduled task to be executed and the transaction according to the default execution priority includes: when the default execution priority is the task priority mode, determining the execution strategy to terminate the transaction and start the scheduled task to be executed; when the default execution priority is not the task priority mode, determining the execution strategy to delay the start time of the scheduled task to be executed and wait for the transaction to be completed. For example: In a big data analysis system, cleaning and converting massive amounts of raw data to wait for the scheduled tasks to be executed is generally the basis for subsequent data analysis and mining. If the correlation between the task and the data analysis transaction is greater than a preset threshold, executing it first can provide high-quality data for subsequent tasks and improve the efficiency and accuracy of the entire analysis process, and the preset adjustment strategy can be set to the task priority mode. Those skilled in the art can design different preset adjustment strategies according to different scheduled tasks to be executed.

[0060] Figure 2 FIG. 1 is a flow chart of a method for executing a database planning task according to another embodiment of the present invention. Figure 2 As shown, the method for executing the database planning task at least includes the following steps S201 to S207.

[0061] Step S201, obtaining the scheduled task to be executed. In some optional embodiments, the method for obtaining the scheduled task to be executed can generally be to trigger the method some time before the scheduled task is officially started, and then predetermine the execution strategy between the scheduled task to be executed and the transaction running at the same start time according to the method. Those skilled in the art can determine the time of early triggering according to actual needs.

[0062] Step S202: Trial run the planned task to be executed. Trial run usually refers to simulating the operation flow of executing the planned task to be executed before the task is put into actual operation.

[0063] Step S203, records the target lock status information obtained by the planned task to be executed during the trial run. The target lock status information may generally include: the object lock obtained by the planned task to be executed and the time the object lock is held. Object lock is a mechanism used to control access to shared objects in multi-threaded programming. In a multi-threaded environment, multiple threads may access and operate the same object at the same time. If not controlled, data inconsistency or other concurrency problems may occur. Object lock is designed to avoid these problems. It can ensure that only one thread can access the locked object at any time.

[0064] Step S204, searching the database for the transaction being run at the start time and the transaction lock status information corresponding to the transaction, wherein the transaction lock status information generally includes: the object lock held during the transaction running process and the time for holding the object lock.

[0065] Step S205, calculate the correlation between the scheduled task to be executed and the transaction according to the target lock state information and the transaction lock state information. In some optional embodiments, the calculation process can generally be to substitute the target lock state information and the transaction lock state information into a preset formula to calculate the correlation, wherein the preset formula is shown in Formula 1.

[0066] Step S206, obtaining a preset adjustment strategy. The preset adjustment strategy is generally used to specify the execution priority of the scheduled tasks and transactions to be executed, which can generally be a pre-set rule for dealing with the execution priority of the scheduled tasks and transactions to be executed under specific circumstances or conditions. The method of obtaining the preset adjustment strategy generally includes reading a system configuration file or actively inputting the method, and those skilled in the art can determine the method of obtaining the preset adjustment strategy according to the actual situation.

[0067] Step S207: Select a corresponding execution priority from the preset adjustment strategies according to the correlation, so as to determine the execution strategy.

[0068] In some optional embodiments, step S207 may generally include: determining whether the correlation is greater than a preset threshold; if the correlation is less than the preset threshold, it means that the scheduled task to be executed is not related to the transaction, so the priority can be determined according to the importance of the two. For example, the preset adjustment strategy stipulates that when the correlation is less than the preset threshold, it is a task priority mode, then the transaction can be terminated, the scheduled task to be executed is started, and the transaction can be restarted after the task is completed. Those skilled in the art can design different preset adjustment strategies according to different scheduled tasks to be executed.

[0069] By this method, the probability of successful operation of a planned task or concurrent transaction can be increased, and the negative impact of the planned task on other transactions in the database can be reduced, or the negative impact of other transactions on the planned task can be reduced. In short, the method of the present invention improves the applicability of the planned task function in a high-concurrency environment.

[0070] The flow chart provided by the present embodiment is not intended to indicate that the operation of the method will be performed in any particular order, or that all operations of the method are included in all every case. In addition, the method may include additional operations. Within the scope of the technical thinking provided by the present embodiment method, additional changes may be made to the above method.

[0071] It should be understood that in some embodiments, each part can be implemented by hardware, software, firmware or a combination thereof. In the above embodiments, multiple steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system.

[0072] This embodiment also provides a computer program product 10 , a computer readable storage medium 20 , and a computer device 30 . Figure 3 is a schematic diagram of a computer program product 10 according to an embodiment of the present invention, Figure 4 is a schematic diagram of a computer-readable storage medium 20 according to an embodiment of the present invention, Figure 5 is a schematic diagram of a computer device 30 according to an embodiment of the present invention. The computer program product 10 includes a computer program 11, which implements the steps of any of the above-mentioned methods for executing a database planning task when the computer program 11 is executed by a processor 32. The computer-readable storage medium 20 stores the above-mentioned computer program 11, which implements the steps of any of the above-mentioned methods for executing a database planning task when the computer program 11 is executed by the processor 32. The computer device 30 may include a memory 31, a processor 32, and the computer program 11 stored in the memory 31 and running on the processor 32.

[0073] The computer program 11 for performing the operation of the present invention may be an assembly instruction, an instruction set architecture (ISA) instruction, a machine instruction, a machine-related instruction, a microcode, a firmware instruction, a state setting data, a configuration data of an integrated circuit, or a source code or an object code written in any combination of one or more programming languages ​​and process programming languages. The computer program 11 may be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the latter case, the remote computer may be connected to the user's computer via any type of network (including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., using an Internet service provider via the Internet). In some embodiments, in order to perform various aspects of the present invention, an electronic circuit including, for example, a programmable logic circuit, a field programmable gate array (FPGA) or a programmable logic array (PLA) may execute computer-readable program instructions by utilizing the state information of the computer-readable program instructions to personalize the electronic circuit.

[0074] For the purposes of the description of the present embodiment, the computer program product 10 is a related product that includes the computer program 11. For the purposes of the description of the present embodiment, the computer readable storage medium 20 is a tangible device capable of retaining and storing the computer program 11, which may be any device that can contain, store, communicate, propagate or transmit the program 11 for use with or in conjunction with an instruction execution system, device or apparatus. More specific examples (a non-exhaustive list) of the computer readable storage medium 20 include the following: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, and any suitable combination of the foregoing.

[0075] The computer device 30 may be, for example, a server, a desktop computer, a notebook computer, a tablet computer, or a smart phone. In some examples, the computer device 30 may be a cloud computing node. The computer device 30 may be described in the general context of computer system executable instructions (such as program modules) executed by a computer system. Typically, a program module may include routines, programs, target programs, components, logic, data structures, etc. that perform specific tasks or implement specific abstract data types. The computer device 30 may be implemented in a distributed cloud computing environment where remote processing devices linked via a communication network perform tasks. In a distributed cloud computing environment, program modules may be located on a local or remote computing system storage medium including a storage device.

[0076] The computer device 30 may include a processor 32 adapted to execute stored instructions, and a memory 31 providing temporary storage space for the operation of the instructions during operation. The processor 32 may be a single-core processor, a multi-core processor, a computing cluster, or any number of other configurations. The memory 31 may include a random access memory (RAM), a read-only memory, a flash memory, or any other suitable storage system.

[0077] The computer device 30 may also include a network adapter / interface and an input / output (I / O) interface. The I / O interface allows data to be input and output with external devices that may be connected to the computer device. The network adapter / interface may provide communication between the computer device and a network, which is typically shown as a communication network.

[0078] At this point, those skilled in the art should recognize that, although multiple exemplary embodiments of the present invention have been shown and described in detail herein, many other variations or modifications that conform to the principles of the present invention can still be directly determined or derived based on the content disclosed in the present invention without departing from the spirit and scope of the present invention. Therefore, the scope of the present invention should be understood and recognized as covering all these other variations or modifications.

Claims

1. A method for executing a database planning task, comprising: Obtaining a planned task to be executed, wherein the planned task is a task with a preset start time; Determine the target lock status information required for execution according to the planned task to be executed; Searching the database for a transaction that is running at the startup time and transaction lock status information corresponding to the transaction; The execution strategy of the planned task to be executed and the transaction is determined according to the target lock state information and the transaction lock state information.

2. The method for executing a database planning task according to claim 1, wherein: The step of determining the target lock state information required for execution according to the planned task to be executed comprises: Trial run the planned tasks to be executed; Record the target lock status information obtained during the trial operation of the planned task to be executed.

3. The method for executing a database planning task according to claim 1, wherein: The step of determining the execution strategy of the planned task to be executed and the transaction according to the target lock state information and the transaction lock state information comprises: Calculating the correlation between the planned task to be executed and the transaction according to the target lock state information and the transaction lock state information; Obtaining a preset adjustment strategy, wherein the preset adjustment strategy is used to specify the execution priority of the to-be-executed planned task and the transaction; The corresponding execution priority is selected in the preset adjustment strategy according to the correlation, so as to determine the execution strategy.

4. The method for executing a database planning task according to claim 3, wherein: The target lock state information includes: the object lock acquired during the execution of the planned task to be executed and the time for holding the object lock; The transaction lock status information includes: the object lock held during the transaction execution and the time for holding the object lock.

5. The method for executing a database planning task according to claim 4, wherein: The step of calculating the correlation between the to-be-executed planned task and the transaction according to the target lock state information and the transaction lock state information comprises: substituting the target lock state information and the transaction lock state information into a preset formula to calculate the correlation; The preset formula is: The w i Indicates the weight coefficient of the object lock, the task_lock i Indicates the time during which the scheduled task to be executed holds the i-th object lock. Indicates the average time that the scheduled task to be executed holds each object lock, the transaction_lock i Indicates the time that the transaction holds the i-th object lock. Indicates the average time that the transaction holds each lock on the object.

6. The method for executing a database planning task according to claim 3, wherein: The step of determining the execution strategy according to the correlation and the preset adjustment strategy comprises: Determining whether the correlation is greater than a preset threshold; If so, a default execution priority is obtained from the preset adjustment strategy, and the execution strategy corresponding to both the to-be-executed planned task and the transaction is determined according to the default execution priority.

7. The method for executing a database planning task according to claim 6, wherein: The step of determining the execution strategy corresponding to the to-be-executed planned task and the transaction according to the default execution priority comprises: In the case where the default execution priority is the task priority mode, determining the execution strategy to terminate the transaction and start the scheduled task to be executed; When the default execution priority is not the task priority mode, the execution strategy is determined to delay the start time of the scheduled task to be executed and wait for the transaction to be completed.

8. A computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the steps of the method for executing a database planning task as described in any one of claims 1 to 7 are implemented.

9. A computer program product, comprising a computer program, which, when executed by a processor, implements the steps of the method for executing a database planning task according to any one of claims 1 to 7.

10. A computer device comprising a memory, a processor, and a machine executable program stored in the memory and running on the processor, wherein the processor implements the steps of the method for executing a database planning task according to any one of claims 1 to 7 when executing the machine executable program.

Images