oltp transaction combination rule and queue model improvement method based on oltpshare
A transaction and queue technology, applied in the field of OLTP transaction processing, can solve the problems of low efficiency of transaction combination and processing, queue model workload, etc., and achieve the effect of improving efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0015] DETAILED DESCRIPTION figure 1 As shown, the OLTPSHARE-based OLTP transaction binding rule and the queue model is improved, and the method includes the following steps:
[0016] Step 1. When the new transaction arrives, the SE thread (SQLEXECUTOR, executive executor executing the SQL statement) checks if the new arrival transaction is a single declaration, if the check result is the new arrival transaction is not a single declaration, then new arrival The transaction is uncomfortable, and it is performed by business;
[0017] By transaction execution refers to the implementation of the traditional OLTP transaction method, a transaction execution;
[0018] If the result is a new arrival transaction is a single declaration transaction, the SE thread query the combination rule of the existing queue, and determines whether the newly arrived transaction is added to any queue in the existing queue;
[0019] Existing queue combined rules refers to: Artificial transaction combined r...
specific Embodiment approach 2
[0032] DETAILED DESCRIPTION OF THE INVENTION The present embodiment is a further defined of OLTPSHARE-based OLTP transaction binding rules described in the specific embodiment, and the judgment is judged to add newly reached transactions into any queue in existing. The specific process is:
[0033] The clustering method calculates the similarity of the newly arrived transaction and the existing queue to determine whether the newly arrived transaction is added to any queue in the existing queue.
[0034] First set the transaction feature to be compared, for example, if transaction is compared by 5 features, then use a five-dimensional vector to represent each transaction, x = {x 1 , X 2 , X 3 , X 4 , X 5 }, Then in the coordinate system, the transactions in each queue must be close to it, and it can be seen that obvious clusters (Cluster). Artificial setting a Y value, representing the maximum cluster radius, by calculating the center of each cluster, then calculating the distance ...
specific Embodiment approach 3
[0035] DETAILED DESCRIPTION OF THE INVENTION 3: The present embodiment is a further defined of OLTPSHARE-based OLTP transaction binding rules and queue model modifications to the queue model of one or two, which checks new arrival transactions is a single declaration transaction. It is specific:
[0036] Check if the new arrived transaction consists of only a SQL (SSQL statement, if only one SQL statement consists, the newly arrived transaction is a single declaration transaction, otherwise the newly arrived transaction is not a single declaration.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
