Concurrent transaction scheduling method and related device

A scheduling method and transaction technology, applied in the database field, can solve problems such as reducing system efficiency and performance, transaction execution deadlock, etc., and achieve the effect of improving efficiency and performance

Inactive Publication Date: 2012-10-10
SUZHOU UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] However, the locking mechanism implements mandatory serializable processing. If the locking mechanism fails, it will lead to a deadlock phenomenon in transaction execution. After the deadlock occurs, the system needs to wait for a period of time to detect it, and at least Only when a transaction abandons execution and rolls back to the state before execution can the deadlock be resolved, which reduces the efficiency and performance of the overall operation of the system

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Concurrent transaction scheduling method and related device
  • Concurrent transaction scheduling method and related device
  • Concurrent transaction scheduling method and related device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] The invention provides a scheduling method for concurrent transactions, which is used to pre-determine the serialization of the transaction before the transaction is executed, and send the serialized transaction after the judgment to the CPU for execution, so as to avoid the deadlock phenomenon appear. In this method, when a transaction in the execution queue in the database management system is completed or a transaction is sent to the submission queue or both occur simultaneously, the current round of scheduling is ended and the next round of scheduling is performed. In addition, the present invention also provides devices related to the method for scheduling concurrent transactions. Each will be described in detail below.

[0027] For the basic flow of the concurrent transaction scheduling method in the first embodiment of the present invention, please refer to figure 1 , for the flow of transactions during the scheduling process, please refer to figure 2 , to ca...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The embodiment of the invention discloses a concurrent transaction scheduling method and a related device, which are used for serializable pre-judgment in transactions. The method disclosed by the embodiment of the invention comprises the following steps of: acquiring a resource set of each transaction in a submission queue; transmitting the transactions in the submission queue into a waiting queue; judging whether each transaction in the waiting queue is dependent on any transaction in an execution queue or not according to the source set of each transaction in the waiting queue, and transmitting the transactions independent of any transaction in the execution queue in the waiting queue into a quasi execution queue if the transactions in the waiting queue are independent of any transaction in the execution queue; and dividing the quasi execution queue into an executable queue and a non-executable queue, transmitting the transactions in the non-executable queue into the waiting queue and transmitting the transactions in the executable queue to a CPU (central processing unit). By the technical scheme disclosed by the invention, the occurrence of deadlock phenomena can be avoided, thereby improving the overall running efficiency and performance of a system.

Description

technical field [0001] The invention relates to the technical field of databases, in particular to a concurrent transaction scheduling method and a related device. Background technique [0002] The database management system is an ideal data processing core mechanism developed to meet the needs of data processing. A program execution unit that accesses and may update various data in the database in the database management system is called a transaction, and the execution of the transaction in the system is completed by the central processing unit (Central Processing Unit, CPU). An important indicator of the performance of a database management system is whether the system can maintain high transaction throughput and low response time for multiple users. In addition, the high transaction throughput of the database management system brings data consistency problems. The so-called data consistency problem means that when multiple transactions are executed concurrently, if the ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F9/46G06F9/50
Inventor 赵雷
Owner SUZHOU UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products