Task processing method, device and equipment and computer readable storage medium

Abstract

The invention discloses a task processing method, device and equipment and a computer readable storage medium, and relates to the technical field of financial science and technology. The task processing method comprises the steps: starting a first transaction through a polling thread every first preset time; sending a query command to a target database to obtain a first return result, and judgingwhether a mutual exclusion lock of a specified type and in an idle state exists or not according to the first return result; if the mutual exclusion lock of the specified type and in the idle state exists, sending a first updating command to the target database to obtain a second return result, and judging whether the mutual exclusion lock is locked or not according to the second return result; ifit is judged that the mutual exclusion lock is not locked, submitting the first transaction to the target database to compete for obtaining the mutual exclusion lock, and performing task processing.According to the method, the competition and mutual exclusion of tasks can be realized based on the TiDB optimistic lock on the basis of not introducing extra infrastructure software, so the cost canbe saved.

Description

technical field [0001] The present invention relates to the technical field of financial technology (Fintech), in particular to a task processing method, device, equipment and computer-readable storage medium. Background technique [0002] With the development of computer technology, more and more technologies are applied in the financial field, and the traditional financial industry is gradually transforming into Fintech. However, due to the security and real-time requirements of the financial industry, higher requirements are placed on technology. requirements. [0003] At present, the task processing system of Internet banks is usually faced with a large number of tasks and massive data to be processed. However, traditional relational databases, due to their poor horizontal scalability, have gradually been unable to meet the needs of task processing systems for massive data processing. As a new distributed database that combines the characteristics of traditional relati...

AI Technical Summary

Problems solved by technology

[0004] However, since the lock type of TiDB is an optimistic lock, while the lock type of a traditional relational database is a pessimistic lock, the task competition and mutual exclusion methods of a traditional relational database are not applicable to the TiDB database during task processing.

At present, in order to achieve task competition and mutual exclusion based on the TiDB database, the mutual exclusion lock is usually migrated to a distributed cache, such as Redis (Remote Dictionary Server, a remote dictionary service, a distributed memory database), but this This method has the following disadvantages: 1) the introduction of additional deployment units will increase the cost of coding, deployment and operation and maintenance; 2) when the Redis service is down, or when the network line of Redis is blocked, the task will not be processed

Images