Abstract:

In the modern educational environment, efficient and reliable data management systems are essential for the operation of online education platforms and student information management systems. With the continuous growth of educational data and the increase in the frequency of multi-user access, database systems face the challenge of high throughput requirements owing to concurrent conflict operations. Among the many concurrency control strategies, the lock-based control strategy is commonly used in database systems. However, the blocking caused by locks affects the performance of concurrent execution of transactions in the database. Existing work mainly reduces lock contention by scheduling the execution order between transactions or optimizing stored procedures. To improve transaction throughput further, this study conducts blocking analysis and cost modeling within transactions based on lock avoidance, and proposes an intra-transaction scheduling strategy. The scheduling cost is estimated by analyzing the blocking of the workload, and then the operation order is exchanged to a limited extent within the transaction according to certain rules to reduce the delay caused by lock blocking, thereby improving performance. Finally, comparing the conventional and proposed scheduling strategies, the latter is verified to improve throughput and reduce the average transaction delay.

Key words: lock scheduling, concurrency control, transaction scheduling, on-line transaction processing