Any-local-quorum consistency for distributed databases replicated across multiple sites

US12443587B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12443587-B2
Application numberUS-202318488795-A
CountryUS
Kind codeB2
Filing dateOct 17, 2023
Priority dateOct 17, 2023
Publication dateOct 14, 2025
Grant dateOct 14, 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 storage application is disclosed herein that employs a method for managing read and write requests associated with a database distributed across multiple replicas in multiple data centers. The storage application may be implemented on one or more computing devices in the context of a data center, cloud environment, or the like. The method includes the storage application receiving a client request to perform an operation with respect to an object at an any-local-quorum consistency level. In response to client request, the storage application iteratively generates and submits coordinator requests to the multiple data centers at a local-quorum consistency level, until one of the multiple data centers successfully replies to one of the coordinator requests with a result. The storage application then replies to the client request based on the result provided by the one of the multiple data centers.

First claim

Opening claim text (preview).

What is claimed is: 1. A method of operating a coordinator node in a data center that manages read and write requests associated with a database distributed across multiple replicas in multiple data centers, the method comprising: by the coordinator node: receiving a coordinator request from a storage application, wherein the storage application received a client request to perform an operation with respect to an object at an any-local-quorum consistency level, wherein the coordinator request is one of multiple coordinator requests sent from the storage application to the multiple data centers, wherein each of the coordinator requests indicates a local-quorum consistency level, and wherein the any-local-quorum consistency level causes the storage application to send the multiple coordinator requests iteratively to each of the multiple data centers until any one of the multiple data centers successfully replies to a corresponding one of the multiple coordinator requests; and responding to the coordinator request at a local-quorum consistency level, including by: replying to the coordinator request with the valid response if a quorum of replica nodes in the data center provide valid responses to queries made by the coordinator node to the replica nodes with respect to the operation; and replying to the coordinator request with an invalid response if the quorum of replica nodes cannot be achieved. 2. The method of claim 1 wherein the data center in which the coordinator node and the replica nodes reside comprises a same one of the multiple data centers across which the database is distributed. 3. The method of claim 1 wherein the storage application is hosted in a same one of the multiple data centers as the coordinator node and the replica nodes. 4. The method of claim 1 wherein the storage application is hosted in a different one of the multiple data centers as the coordinator node and the replica nodes. 5. The method of claim 1 wherein the coordinator request received by the coordinator node comprises a second one of the multiple coordinator requests sent by the storage application. 6. The method of claim 5 wherein the storage application sends a next one of the multiple coordinator requests iteratively in response to receiving an invalid response to a previous one of the multiple coordinator requests. 7. The method of claim 1 wherein the operation comprises one of a read operation, a write operation, or a delete operation. 8. A computing apparatus comprising: one or more computer readable storage media; one or more processors operatively coupled to the one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media for operating a coordinator node in a data center that manages read and write requests associated with a database distributed across multiple replicas in multiple data centers; wherein the program instructions, when read and executed by the one or more processors, direct the computing apparatus to at least: receive a coordinator request from a storage application, wherein the storage application received a client request to perform an operation with respect to an object at an any-local-quorum consistency level, wherein the coordinator request is one of multiple coordinator requests sent from the storage application to the multiple data centers, wherein each of the coordinator requests indicates a local-quorum consistency level, and wherein the any-local-quorum consistency level causes the storage application to send the multiple coordinator requests iteratively to each of the multiple data centers until any one of the multiple data centers successfully replies to a corresponding one of the multiple coordinator requests; and respond to the coordinator request at a local-quorum consistency level. 9. The computing apparatus of claim 8 wherein, to respond to the coordinator request at the local-quorum consistency level, the program instructions direct the computing apparatus to: reply to the coordinator request with a valid response if a quorum of replica nodes in the data center provide valid responses to queries made by the coordinator node to the replica nodes with respect to the operation; and reply to the coordinator request with an invalid response if the quorum of replica nodes cannot be achieved. 10. The computing apparatus of claim 9 wherein the data center in which the coordinator node and the replica nodes reside comprises one of the multiple data centers across which the database is distributed. 11. The computing apparatus of claim 9 wherein the storage application is hosted in a same one of the multiple data centers as the coordinator node and the replica nodes. 12. The computing apparatus of claim 9 wherein the storage application is hosted in a different one of the multiple data centers as the coordinator node and the replica nodes. 13. The computing apparatus of claim 9 wherein the coordinator request received by the coordinator node comprises a second one of the multiple coordinator requests sent by the storage application. 14. The computing apparatus of claim 13 wherein the storage application sends a next one of the multiple coordinator requests iteratively in response to receiving an invalid response to a previous one of the multiple coordinator requests. 15. The computing apparatus of claim 9 wherein the operation comprises one of a read operation, a write operation, or a delete operation. 16. One or more computer readable storage media having program instructions stored thereon for operating a coordinator node in a data center that manages read and write requests associated with a database distributed across multiple replicas in multiple data centers, wherein the program instructions, when read and executed by one or more processors of a computing apparatus, direct the computing apparatus to at least: receive a coordinator request from a storage application, wherein the storage application received a client request to perform an operation with respect to an object at an any-local-quorum consistency level, wherein the coordinator request is one of multiple coordinator requests sent from the storage application to the multiple data centers, wherein each of the coordinator requests indicates a local-quorum consistency level, and wherein the any-local-quorum consistency level causes the storage application to send the multiple coordinator requests iteratively to each of the multiple data centers until any one of the multiple data centers successfully replies to a corresponding one of the multiple coordinator requests; and respond to the coordinator request at a local-quorum consistency level. 17. The one or more computer readable storage media of claim 16 wherein, to respond to the coordinator request at the local-quorum consistency level, the program instructions direct the computing apparatus to: reply to the coordinator request with a valid response if a quorum of replica nodes in the data center provide valid responses to queries made by the coordinator node to the replica nodes with respect to the operation; and reply to the coordinator request with an invalid response if the quorum of replica nodes cannot be achieved. 18. The one or more computer readable storage media of claim 17 wherein the data center in which the coordinator node and the replica nodes reside comprises one of the multiple data centers across which the database is distributed and wherein the storage application is hosted in a same one or a differe

Assignees

Inventors

Classifications

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

  • Ensuring data consistency and integrity · CPC title

  • G06F16/275Primary

    Synchronous replication · 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 US12443587B2 cover?
A storage application is disclosed herein that employs a method for managing read and write requests associated with a database distributed across multiple replicas in multiple data centers. The storage application may be implemented on one or more computing devices in the context of a data center, cloud environment, or the like. The method includes the storage application receiving a client re…
Who is the assignee on this patent?
Netapp Inc
What technology area does this patent fall under?
Primary CPC classification G06F16/2365. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Oct 14 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 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).