Data partition handoff between storage clusters
US-2021072917-A1 · Mar 11, 2021 · US
US12265839B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12265839-B2 |
| Application number | US-202217946628-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 16, 2022 |
| Priority date | Mar 19, 2020 |
| Publication date | Apr 1, 2025 |
| Grant date | Apr 1, 2025 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
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.
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.
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
Transaction processing · CPC title
Updating · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.