Storage management in a clustered storage environment

US12430290B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-12430290-B1
Application numberUS-202418407250-A
CountryUS
Kind codeB1
Filing dateJan 8, 2024
Priority dateJan 8, 2024
Publication dateSep 30, 2025
Grant dateSep 30, 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.

This disclosure describes techniques for enabling efficient and/or expeditious retrieval of data records stored across a clustered storage framework. An example system manages storage of data records in the storage clusters based on predefined placement rules. Frequently accessed data records are stored in a local high-performance store storage medium to reduce retrieval latency. The system determines which storage cluster to retrieve a requested data record from by selecting the cluster with the highest weight, as determined based on performance-related metrics like cluster utilization and geographic proximity.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: receiving, by a processor and from a first computing device, a first request to retrieve a first data record from a storage framework, the storage framework comprising: a first storage cluster, and a second storage cluster; querying, by the processor and based on the first request, the storage framework to determine: a first weight associated with the first storage cluster, and a second weight associated with the second storage cluster; predicting, by the processor and based on the first weight, a first likelihood of retrieving the first data record from the first storage cluster; predicting, by the processor and based on the second weight, a second likelihood of retrieving the first data record from the second storage cluster; determining, by the processor and based on the first likelihood, the second likelihood, and a range associated with a probability distribution, a likelihood threshold; determining, by the processor, first data representing that a first value sampled from the probability distribution exceeds the likelihood threshold; providing, by the processor and based on the first data, the first request to the first storage cluster; receiving, by the processor and based on providing the first request to the first storage cluster, the first data record from the first storage cluster; and providing, by the processor and to the first computing device, the first data record. 2. The method of claim 1 , further comprising: determining, by the processor, a retrieval latency associated with routing the first request to the first storage cluster and receiving the first data record from the first storage cluster; and updating, by the processor, the first weight based on the retrieval latency. 3. The method of claim 1 , further comprising: determining, by the processor, a capacity measure associated with the first storage cluster; and updating, by the processor, the first weight based on the capacity measure. 4. The method of claim 1 , further comprising: determining, by the processor, a first retrieval statistic associated with the first data record; determining, by the processor, that the first retrieval statistic exceeds a threshold; and based on determining that the first retrieval statistic exceeds the threshold, storing, by the processor, the first data record on the storage framework. 5. The method of claim 4 , further comprising: receiving, by the processor, a notification indicative of an update to the first data record; and based on receiving the notification, removing, by the processor, the first data record from the storage framework. 6. The method of claim 5 , further comprising: determining, by the processor, a second retrieval statistic associated with a second data record; determining, by the processor, whether the second retrieval statistic has a value that exceeds the threshold; and updating the threshold based on the threshold. 7. The method of claim 6 , further comprising: determining, by the processor, that the first retrieval statistic fails to exceed the threshold; and based on determining that the first retrieval statistic fails to exceed the threshold, removing, by the processor, the first data record from the storage framework. 8. The method of claim 1 , further comprising: receiving, by the processor, a notification about unavailability of the first storage cluster; and based on receiving the notification, updating, by the processor, the first weight. 9. The method of claim 1 , further comprising: determining, by the processor, a network utilization of the first storage cluster; and updating, by the processor, the first weight based on the network utilization. 10. A computing system, comprising: a processor; and memory storing computer-executable instructions that, when executed by the processor, cause the computing system to perform operations comprising: receiving, from a first computing device, a first request to retrieve a first data record from a storage framework, the storage framework comprising: a first storage cluster, and a second storage cluster; querying, based on the first request, a storage medium to determine: a first weight associated with the first storage cluster, and a second weight associated with the second storage cluster; predicting, based on the first weight, a first likelihood of retrieving the first data record from the first storage cluster; predicting, based on the second weight, a second likelihood of retrieving the first data record from the second storage cluster; determining, based on the first likelihood, the second likelihood, and a range associated with a probability distribution, a likelihood threshold; determining first data representing that a first value sampled from the probability distribution exceeds the likelihood threshold; providing, based on the first data, the first request to the first storage cluster; receiving, based on providing the first request to the first storage cluster, the first data record from the first storage cluster; and providing, to the first computing device, the first data record. 11. The computing system of claim 10 , the operations further comprising: determining a retrieval latency associated with routing the first request to the first storage cluster and receiving the first data record from the first storage cluster; and updating the first weight based on the retrieval latency. 12. The computing system of claim 10 , the operations further comprising: determining a first retrieval statistic associated with the first data record; determining that the first retrieval statistic exceeds a threshold; and based on determining that the first retrieval statistic exceeds the threshold, storing the first data record on the storage medium. 13. The computing system of claim 12 , the operations further comprising: receiving a notification indicative of an update to the first data record; and based on receiving the notification, removing the first data record from the storage medium. 14. The computing system of claim 10 , the operations further comprising: determining a capacity measure associated with the first storage cluster; and updating the first weight based on the capacity measure. 15. One or more non-transitory computer-readable media storing computer-executable instructions that, when executed by a processor, cause the processor to perform operations, comprising: receiving, from a first computing device, a first request to retrieve a first data record from a storage framework, the storage framework comprising: a first storage cluster, and a second storage cluster; querying, based on the first request, a storage medium to determine: a first weight associated with the first storage cluster, and a second weight associated with the second storage cluster; predicting, based on the first weight, a first likelihood of retrieving the first data record from the first storage cluster; predicting, based on the second weight, a second likelihood of retrieving the first data record from the second storage cluster; determining, based on the first likelihood, the second likelihood, and a range associated with a probability distribution, a likelihood threshold; determining first data representing that a first value sampled from the probability distribution exceeds the likelihood threshold; providing, based on the first data, the first request to the first storage cluster; receiving, based on providing the first request to the first storage cluster, the first data record from the fi

Assignees

Inventors

Classifications

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 US12430290B1 cover?
This disclosure describes techniques for enabling efficient and/or expeditious retrieval of data records stored across a clustered storage framework. An example system manages storage of data records in the storage clusters based on predefined placement rules. Frequently accessed data records are stored in a local high-performance store storage medium to reduce retrieval latency. The system det…
Who is the assignee on this patent?
State Farm Mutual Automobile Insurance Co
What technology area does this patent fall under?
Primary CPC classification G06F16/134. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Sep 30 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 4 related publications on this page (citations in our corpus or others sharing the same primary CPC).