Management method and apparatus for transaction processing system, device, and medium

US12265839B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12265839-B2
Application numberUS-202217946628-A
CountryUS
Kind codeB2
Filing dateSep 16, 2022
Priority dateMar 19, 2020
Publication dateApr 1, 2025
Grant dateApr 1, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A management method is implemented by a transaction processing system. The transaction processing system includes a plurality of participant nodes. Each participant node stores a data partition and is configured to process a plurality of transactions. A combination of data partitions accessed by each transaction includes at least one data partition. The management method includes obtaining a quantity of transactions accessing each combination of data partitions in a cycle and adjusting storage of the data partitions on the plurality of participant nodes based on the quantity of transactions accessing each combination of data partitions in the cycle.

First claim

Opening claim text (preview).

What is claimed is: 1. A method, comprising: obtaining a first quantity of transactions accessing each combination of data partitions in a cycle by: obtaining a second quantity of transactions accessing each combination of data partitions in a history cycle; and predicting, based on the second quantity, the first quantity; and adjusting, based on the first quantity, storage of the data partitions on a plurality of participant nodes. 2. The method of claim 1 , wherein obtaining the first quantity further comprises collecting, in the cycle, the first quantity. 3. The method of claim 1 , wherein adjusting the storage comprises: identifying, based on the first quantity, a target combination of data partitions; and migrating one or more data partitions in the target combination from N participant nodes to M participant nodes, and wherein N is greater than M. 4. The method of claim 1 , wherein adjusting the storage comprises adjusting, based on the first quantity and a load of the participant nodes, the storage. 5. The method of claim 1 , wherein the first quantity of transactions accessing each combination of data partitions indicates an affinity of the data partitions in the combination of data partitions. 6. A device, comprising: a memory configured to store instructions; and a processor coupled to the memory and configured to execute the instructions to: obtain a first quantity of transactions accessing each combination of data partitions in a cycle by: obtaining a second quantity of transactions accessing each combination of data partitions in a history cycle; and predicting, based on the second quantity, the first quantity; and adjust, based on the first quantity, storage of the data partitions on a plurality of participant nodes. 7. The device of claim 6 , wherein the processor is further configured to obtain the first quantity by collecting, in the cycle, the first quantity. 8. The device of claim 6 , wherein the processor is further configured to execute the instructions to: identify, based on the first quantity, a target combination of data partitions; and migrate one or more data partitions in the target combination from N participant nodes to M participant nodes, and wherein N is greater than M. 9. The device of claim 6 , wherein the processor is further configured to execute the instructions to adjust, based on the first quantity and a load of the participant nodes, the storage. 10. The device of claim 6 , wherein the first quantity of transactions accessing each combination of data partitions indicates an affinity of the data partitions in the combination of data partitions. 11. A computer program product comprising instructions stored on a non-transitory computer-readable medium that, when executed by a processor, cause a device to: obtain a first quantity of transactions accessing each combination of data partitions in a cycle by: obtaining a second quantity of transactions accessing each combination of data partitions in a history cycle; and predicting, based on the second quantity, the first quantity; and adjust, based on the first quantity, storage of the data partitions on a plurality of participant nodes. 12. The computer program product of claim 11 , wherein the instructions further cause the device to obtain the first quantity by collecting, in the cycle, the first quantity. 13. The computer program product of claim 11 , wherein the instructions further cause the device to: identify, based on the first quantity, a target combination of data partitions; and migrate one or more data partitions in the target combination from N participant nodes to M participant nodes, and wherein N is greater than M. 14. The computer program product of claim 11 , wherein the instructions further cause the device to adjust, based on the first quantity and a load of the participant nodes, the storage. 15. The computer program product of claim 11 , wherein the instructions further cause the device to reduce a quantity of the participant nodes participating in one of the transactions. 16. The computer program product of claim 11 , wherein the instructions further cause the device to adjust, based on the first quantity, a load of the participant nodes, and a load balance policy, the storage. 17. The computer program product of claim 11 , wherein the instructions further cause the device to adjust, based on the first quantity and a load balance policy, the storage. 18. The computer program product of claim 11 , wherein the instructions further cause the device to migrate the data partitions to a same node. 19. The computer program product of claim 11 , wherein the instructions further cause the device to migrate the data partitions according to a pattern of repetition in a fixed time period. 20. The computer program product of claim 11 , wherein the first quantity of transactions accessing each combination of data partitions indicates an affinity of the data partitions in the combination of data partitions.

Assignees

Inventors

Classifications

  • Hierarchical storage management [HSM] systems, e.g. file migration or policies thereof (details of archiving G06F16/11) · CPC title

  • Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title

  • G06F9/466Primary

    Transaction processing · CPC title

  • G06F16/23Primary

    Updating · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12265839B2 cover?
A management method is implemented by a transaction processing system. The transaction processing system includes a plurality of participant nodes. Each participant node stores a data partition and is configured to process a plurality of transactions. A combination of data partitions accessed by each transaction includes at least one data partition. The management method includes obtaining a qu…
Who is the assignee on this patent?
Huawei Cloud Computing Tech Co Ltd
What technology area does this patent fall under?
Primary CPC classification G06F9/466. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Apr 01 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).