# US 2024/0202354 A1 · Dynamic Data Storage Based on Estimated Update Frequency

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0202354 A1
- Document ID: US20240202354A1
- Status: Published application
- Kind: A1
- Application number: 18/592,681
- Filed: 2024-03-01
- Published: 2024-06-20
- Earliest claimed: 2014-04-02
- Assignees: Pure Storage, Inc.
- Applicants: Pure Storage, Inc.
- Inventors: Ilya Volvovski; Wesley B. Leggette; Michael C. Storm; Jason K. Resch
- Web page: https://patentgrep.com/patent/US20240202354A1

## CPC

- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- G06F 11/00: Error detection; Error correction; Monitoring (error detection, correction or monitoring in information storage based on relative movement between record carrier and transducer G11B20/18; monitoring, i.e. supervising the progress of recording or reproducing G11B27/36; in static stores G11C29/00)
- G06F 21/6254: {by anonymising data, e.g. decorrelating personal data from the owner's identification}
- G06F 21/6272: {by registering files or documents with a third party}
- G06F 21/6281: {at program execution time, where the protection is within the operating system}
- H04L 63/0823: {using certificates (cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263)}
- H04L 63/104: {Grouping of entities}
- H04L 63/12: {Applying verification of the received information (cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32)}
- H04L 63/20: {for managing network security; network security policies in general (filtering policies H04L63/0227)}
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 2221/2141: Access rights, e.g. capability lists, access control lists, access tables, access matrices
- H04L 63/101: {Access control lists [ACL]}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for execution by a computing device to adjust efficiency of storing data in a storage network includes processing a data segment based on a storage approach to produce a processed data segment, where the storage approach is based on an estimated update frequency for the data segment. The method continues by storing the data segment in the memory of the storage network in accordance with the storage approach.

## Claims

### Claim 1

A method for execution by a computing device to adjust efficiency of storing data in a storage network, the method comprises:
processing a data segment of the data based on a storage approach to produce a processed data segment, wherein the storage approach is based on an estimated update frequency of the data segment; and
storing the data segment in memory of the storage network in accordance with the storage approach.

### Claim 2 (depends on 1)

The method of claim 1, wherein the storing the data segment further comprises:
error encoding the processed data segment to produce a set of encoded data slices, wherein a decode threshold number of encoded data slices is needed to recover the processed data segment; and
storing the set of encoded data slices in the memory of the storage network in accordance with the storage approach.

### Claim 3 (depends on 1)

The method of claim 1 further comprises:
obtaining the data segment for storage in the memory of the storage network; and
obtaining access level information regarding the data segment, wherein the access level information includes the estimated update frequency for the data segment.

### Claim 4 (depends on 1)

The method of claim 1 further comprises:
when the estimated update frequency is less than an update frequency threshold:
determining a cost of decompression factor for the data segment, wherein the cost of decompression factor includes one or more of an estimated incremental processing resource level, and an estimated incremental network utilization reduction level as a result of decompressing the data segment; and
determining the storage approach based on the cost of decompression factor.

### Claim 5 (depends on 4)

The method of claim 4, wherein when the cost of decompression factor is less than or equal to a decompression factor threshold, the storage approach comprises a compression storage approach.

### Claim 6 (depends on 4)

The method of claim 4, wherein when the cost of decompression factor is greater than a decompression factor threshold, the storage approach comprises a non-compression storage approach.

### Claim 7 (depends on 1)

The method of claim 1 further comprises:
obtaining access level information regarding the data segment, wherein the access level information includes an estimated retrieval frequency level for the data segment.

### Claim 8 (depends on 7)

The method of claim 7 further comprises:
when the estimated retrieval frequency level for the data segment is less than or equal to a retrieval frequency threshold:
determining a cost of compression factor based on resource information, wherein the cost of compression factor includes one or more of an estimated incremental processing resource level, and an estimated incremental network utilization increase level as a result of compressing the data segment; and
determining the storage approach based on the cost of compression factor.

### Claim 9 (depends on 7)

The method of claim 7 further comprises:
when the estimated retrieval frequency level for the data segment is greater than a retrieval frequency threshold:
determining a cost of compression factor based on resource information, wherein the cost of compression factor includes one or more of an estimated incremental processing resource level, and an estimated incremental network utilization reduction level as a result of compressing the data segment; and
determining the storage approach based on the cost of compression factor and the access level information.

### Claim 10 (depends on 9)

The method of claim 9, wherein the determining the cost of compression factor comprises one of:
determining the cost of compression factor is less than an average cost of compression factor when the resource information indicates a utilization level of the computing device is less than average; and
determining the cost of compression factor is greater than the average cost of compression factor when the resource information indicates the utilization level of the computing device is greater than average.

### Claim 11

A computing device of a storage network configured to adjust efficiency of storing data in the storage network, the computing device comprises:
memory;
an interface; and
a processing module operably coupled to the memory and the interface, wherein the processing module is operable to:
process a data segment of the data based on a storage approach to produce a processed data segment, wherein the storage approach is based on an estimated update frequency of the data segment; and
store the data segment in memory of the storage network in accordance with the storage approach.

### Claim 12 (depends on 11)

The computing device of claim 11, wherein the processing module is further operable to store the data segment by:
error encoding the processed data segment to produce a set of encoded data slices, wherein a decode threshold number of encoded data slices is needed to recover the processed data segment; and
sending, via the interface, the set of encoded data slices to the memory of the storage network for storage therein in accordance with the storage approach.

### Claim 13 (depends on 11)

The computing device of claim 11, wherein the processing module is further operable to:
obtain the data segment for storage in the memory of the storage network; and
obtain access level information regarding the data segment, wherein the access level information includes the estimated update frequency for the data segment.

### Claim 14 (depends on 11)

The computing device of claim 11, wherein the processing module is further operable to:
when the estimated update frequency is less than an update frequency threshold:
determine a cost of decompression factor for the data segment, wherein the cost of decompression factor includes one or more of an estimated incremental processing resource level, and an estimated incremental network utilization reduction level as a result of decompressing the data segment; and
determine the storage approach based on the cost of decompression factor.

### Claim 15 (depends on 14)

The computing device of claim 14, wherein when the cost of decompression factor is less than or equal to a decompression factor threshold, the processing module is further operable to determine the storage approach comprises a compression storage approach.

### Claim 16 (depends on 14)

The computing device of claim 14, wherein when the cost of decompression factor is greater than a decompression factor threshold, the processing module is further operable to determine the storage approach comprises a non-compression storage approach.

### Claim 17 (depends on 11)

The computing device of claim 11, wherein the processing module is further operable to:
obtain access level information regarding the data segment, wherein the access level information includes an estimated retrieval frequency level for the data segment.

### Claim 18 (depends on 17)

The computing device of claim 17, wherein the processing module is further operable to:
when the estimated retrieval frequency level for the data segment is less than or equal to a retrieval frequency threshold:
determine a cost of compression factor based on resource information, wherein the cost of compression factor includes one or more of an estimated incremental processing resource level, and an estimated incremental network utilization increase level as a result of compressing the data segment; and
determine the storage approach based on the cost of compression factor.

### Claim 19 (depends on 17)

The computing device of claim 17, wherein the processing module is further operable to:
when the estimated retrieval frequency level for the data segment is greater than a retrieval frequency threshold:
determine a cost of compression factor based on resource information, wherein the cost of compression factor includes one or more of an estimated incremental processing resource level, and an estimated incremental network utilization reduction level as a result of compressing the data segment; and
determine the storage approach based on the cost of compression factor and the access level information.

### Claim 20 (depends on 19)

The computing device of claim 19, wherein the processing module is further operable to determine the cost of compression factor by one of:
determining the cost of compression factor is less than an average cost of compression factor when the resource information indicates a utilization level of the computing device is less than average; and
determining the cost of compression factor is greater than the average cost of compression factor when the resource information indicates the utilization level of the computing device is greater than average.
