Resilience based database placement in clustered environment

US11983151B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11983151-B2
Application numberUS-202117334360-A
CountryUS
Kind codeB2
Filing dateMay 28, 2021
Priority dateMay 28, 2021
Publication dateMay 14, 2024
Grant dateMay 14, 2024

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.

Herein are resource-constrained techniques that plan ahead for resiliently moving pluggable databases between container databases after a failure in a high-availability database cluster. In an embodiment, a computer identifies many alternative placements that respectively assign each pluggable database to a respective container database. For each alternative placement, a respective resilience score is calculated for each pluggable database that is based on the container database of the pluggable database. Based on the resilience scores of the pluggable databases for the alternative placements, a particular placement is selected as an optimal placement that would maximize utilization of computer resources, minimize database latencies, maximize system throughput, and maximize the ability of the database cluster to avoid a service outage.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: identifying a plurality of alternative placements each of which assigns each pluggable database of a plurality of pluggable databases to a respective container database of a plurality of container databases, wherein: a) for each alternative placement of the plurality of alternative placements, each container database of the plurality of container databases contains respective one or more pluggable databases of the plurality of pluggable databases; b) each pluggable database of the plurality of pluggable databases has: a respective operating amount of a resource and a respective reduction limit for the resource; for each alternative placement of the plurality of alternative placements; a) calculating a respective resilience score for each pluggable database of the plurality of pluggable databases that is based on: the container database of the pluggable database, and the respective operating amount and reduction limit of the resource for the pluggable database; b) calculating a respective resilience score for each container database of the plurality of container databases that is based on the respective resilience scores of the respective one or more pluggable databases of the container database for the alternative placement; selecting, based on the respective resilience scores of the plurality of container databases for the plurality of alternative placements, a particular placement of the plurality of alternative placements; and configuring, based on the particular placement of the plurality of alternative placements, the plurality of pluggable databases in the plurality of container databases; wherein the method is performed by one or more computers. 2. The method of claim 1 wherein: the method further comprises for each alternative placement of the plurality of alternative placements, identifying a respective adjusted amount of the resource for each pluggable database of the plurality of pluggable databases; for each alternative placement of the plurality of alternative placements, said calculating the respective resilience score for each pluggable database of the plurality of pluggable databases is further based on a respective difference between the respective adjusted amount of the resource and the respective operating amount of the resource for each pluggable database of the plurality of pluggable databases for the alternative placement. 3. The method of claim 1 wherein for each alternative placement of the plurality of alternative placements, the respective resilience score for each pluggable database of the plurality of pluggable databases is proportional to a respective adjusted amount of the resource of the pluggable database for the alternative placement. 4. The method of claim 1 wherein the resource is at least one selected from the group consisting of: nonvolatile storage, random access memory (RAM), network bandwidth, and a fraction of a processor core. 5. The method of claim 4 wherein the fraction of the processor core may be less than ten percent. 6. The method of claim 1 wherein: the plurality of alternative placements is based on a possible failover that has not occurred; said possible failover that has not occurred would involve at least one selected from the group consisting of: a failed pluggable database, a failed container database, a failed virtual machine, and a failed computer. 7. The method of claim 1 wherein: for each alternative placement of the plurality of alternative placements, each container database of the plurality of container databases contains respective one or more pluggable databases of the plurality of pluggable databases; the method further comprises for each alternative placement of the plurality of alternative placements, calculating a respective resilience score for each container database of the plurality of container databases that is based on the respective resilience scores of the respective one or more pluggable databases of the container database for the alternative placement; said selecting the particular placement of the plurality of alternative placements is based on the respective resilience scores of the plurality of container databases for the plurality of alternative placements. 8. The method of claim 7 wherein: for each alternative placement of the plurality of alternative placements, each virtual machine of a plurality of virtual machines contains respective one or more container databases of the plurality of container databases; the method further comprises for each alternative placement of the plurality of alternative placements, calculating a respective resilience score for each virtual machine of the plurality of virtual machines that is based on the respective resilience scores of the respective one or more container databases of the virtual machine for the alternative placement; said selecting the particular placement of the plurality of alternative placements is based on the respective resilience scores of the plurality of virtual machines for the plurality of alternative placements. 9. The method of claim 8 wherein: the method further comprises for each alternative placement of the plurality of alternative placements, calculating a respective resilience score for each computer of a plurality of computers that is based on resilience scores of one or more virtual machines of the computer for the alternative placement; said selecting the particular placement of the plurality of alternative placements is based on the respective resilience scores of the plurality of computers for the plurality of alternative placements. 10. The method of claim 9 wherein: the method further comprises calculating a respective resilience score for each alternative placement of the plurality of alternative placements that is based on the respective resilience scores of the plurality of computers for the alternative placement; said selecting the particular placement of the plurality of alternative placements is based on the respective resilience scores of the plurality of alternative placements. 11. The method of claim 1 wherein said identifying the plurality of alternative placements further comprises a linear programing solver analyzing amounts of one or more resources for the plurality of pluggable databases for the plurality of alternative placements. 12. The method of claim 1 wherein the plurality of pluggable databases has at least two thousand pluggable databases. 13. One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause: identifying a plurality of alternative placements each of which assigns each pluggable database of a plurality of pluggable databases to a respective container database of a plurality of container databases, wherein: a) for each alternative placement of the plurality of alternative placements, each container database of the plurality of container databases contains respective one or more pluggable databases of the plurality of pluggable databases; b) each pluggable database of the plurality of pluggable databases has: a respective operating amount of a resource and a respective reduction limit for the resource; for each alternative placement of the plurality of alternative placements; a) calculating a respective resilience score for each pluggable database of the plurality of pluggable databases that is based on: the container database of the pluggable database, and the operating amount and reduction limit of the resource for the pluggable database; b) calculating a respective resilience score for each container d

Assignees

Inventors

Classifications

  • G06F16/21Primary

    Design, administration or maintenance of databases · CPC title

  • using migration · CPC title

  • Benchmarking · CPC title

  • in federated or virtual databases · CPC title

  • for accessing one among a plurality of replicated servers · 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 US11983151B2 cover?
Herein are resource-constrained techniques that plan ahead for resiliently moving pluggable databases between container databases after a failure in a high-availability database cluster. In an embodiment, a computer identifies many alternative placements that respectively assign each pluggable database to a respective container database. For each alternative placement, a respective resilience s…
Who is the assignee on this patent?
Oracle Int Corp
What technology area does this patent fall under?
Primary CPC classification G06F16/21. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue May 14 2024 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 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).