# US 12,007,966 B2 · Provisioning a deduplication data store > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,007,966 B2 - Document ID: US12007966B2 - Status: Granted - Kind: B2 - Application number: 17/664,459 - Filed: 2022-05-23 - Published: 2023-11-23 - Granted: 2024-06-11 - Earliest claimed: 2022-05-23 - Assignees: Hewlett Packard Enterprise Development LP - Applicants: Hewlett Packard Enterprise Development LP - Inventors: Peter Thomas Camble; Andrew Todd - Web page: https://patentgrep.com/patent/US12007966B2 ## CPC - G06F 16/215: Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Example implementations relate to provisioning a deduplication data store. An example includes receiving inputs indicating an expected data amount and at least one retention period for the deduplication data store; performing a comparison of the at least one retention period to a stored data structure; determining at least one storage multiplier based on the comparison of the at least one retention period to the stored data structure; and determining an amount of storage to provision for the deduplication data store based on the expected data amount and the at least one storage multiplier. ## Claims ### Claim 1 A system comprising: a processor; a memory; and a machine-readable storage storing instructions, the instructions executable by the processor to: receive inputs indicating an expected data amount and at least one retention period for a deduplication data store; perform a comparison of the at least one retention period to a stored data structure, wherein the stored data structure comprises different combinations of respective storage multipliers corresponding to respective maximum retention periods; determine at least one storage multiplier of the respective storage multipliers based on the comparison of the at least one retention period to the stored data structure; and determine an amount of storage to provision for the deduplication data store based on the expected data amount and the determined at least one storage multiplier. ### Claim 2 (depends on 1) The system of claim 1, including instructions executable by the processor to: provision the deduplication data store based at least on the determined amount of storage. ### Claim 3 (depends on 1) The system of claim 1, wherein the stored data structure is populated with the storage multipliers based on expert knowledge regarding a first retention scheme most commonly-used for a particular maximum retention period. ### Claim 4 (depends on 3) The system of claim 3, wherein the stored data structure is populated with the storage multipliers further based on empirical information regarding storage requirements associated with different portions of the first retention scheme. ### Claim 5 (depends on 1) The system of claim 1, including instructions executable by the processor to: determine a local storage multiplier based on a comparison of a maximum local retention period to the stored data structure; and determine a local storage amount based on the local storage multiplier and the expected data amount. ### Claim 6 (depends on 5) The system of claim 5, including instructions executable by the processor to: determine a remote storage multiplier based on a comparison of the maximum remote retention period to the stored data structure; determine a remote storage amount based on the remote storage multiplier and the expected data amount; determine a remote metadata amount based on the remote storage amount and the remote metadata size; and determine a total amount of local storage to provision based on the local storage amount and the remote metadata amount. ### Claim 7 (depends on 1) The system of claim 1, including instructions executable by the processor to: determine a number of data sessions for the deduplication data store; determine a total memory amount to provision for the deduplication data store; determine a processor quantity to provision for the deduplication data store; and determine an input/output operations per second (IOPS) quantity to provision for the deduplication data store. ### Claim 8 (depends on 1) The system of claim 1, wherein the amount of storage to provision is yielded based on a product of one of the determined at least one storage multiplier and the expected data amount, wherein the expected data amount comprises an expected amount of data to be protected on a periodic basis. ### Claim 9 A method comprising: receiving, by a storage management system, inputs indicating an expected data amount and at least one retention period for a deduplication data store; performing, by the storage management system, a comparison of the at least one retention period to a stored data structure, wherein the stored data structure comprises different combinations of respective storage multipliers corresponding to respective maximum retention periods; determining, by the storage management system, at least one storage multiplier of respective storage multipliers based on the comparison of the at least one retention period to the stored data structure; and determining, by the storage management system, an amount of storage to provision for the deduplication data store based on the expected data amount and the determined at least one storage multiplier. ### Claim 10 (depends on 9) The method of claim 9, further comprising: provisioning the deduplication data store based at least on the determined amount of storage. ### Claim 11 (depends on 9) The method of claim 9, further comprising: populating the storage multipliers into the stored data structure based on: expert knowledge regarding a first retention scheme most commonly-used for a particular maximum retention period, and empirical information regarding storage requirements associated with different portions of the first retention scheme. ### Claim 12 (depends on 9) The method of claim 9, further comprising: determining a local storage multiplier based on a comparison of the maximum local retention period to the stored data structure; and determining a local storage amount based on the local storage multiplier and the expected data amount. ### Claim 13 (depends on 12) The method of claim 12, further comprising: determining a remote storage multiplier based on a comparison of the maximum remote retention period to the stored data structure; determining a remote storage amount based on the remote storage multiplier and the expected data amount; determining a remote metadata amount based on the remote storage amount and the remote metadata size; and determining a total amount of local storage to provision based on the local storage amount and the remote metadata amount. ### Claim 14 (depends on 9) The method of claim 9, further comprising: determining a number of data sessions for the deduplication data store; determining a total memory amount to provision for the deduplication data store; determining a processor quantity to provision for the deduplication data store; and determining an input/output operations per second (IOPS) quantity to provision for the deduplication data store. ### Claim 15 (depends on 9) The method of claim 9, wherein the amount of storage to provision is yielded based on a product of one of the determined at least one storage multiplier and the expected data amount, wherein the expected data amount comprises an expected amount of data to be protected on a periodic basis. ### Claim 16 A non-transitory machine-readable medium storing instructions that upon execution cause a processor to: receive inputs indicating an expected data amount and at least one retention period for a deduplication data store; perform a comparison of the at least one retention period to a stored data structure, wherein the stored data structure comprises different combinations of respective storage multipliers corresponding to respective maximum retention periods; determine at least one storage multiplier of the respective storage multipliers based on the comparison of the at least one retention period to the stored data structure; and determine an amount of storage to provision for the deduplication data store based on the expected data amount and the determined at least one storage multiplier. ### Claim 17 (depends on 16) The non-transitory machine-readable medium of claim 16, including instructions that upon execution cause the processor to: provision the deduplication data store based at least on the determined amount of storage. ### Claim 18 (depends on 16) The non-transitory machine-readable medium of claim 16, wherein the stored data structure is populated with the storage multipliers based on: expert knowledge regarding a first retention scheme most commonly-used for a particular maximum retention period; empirical information regarding storage requirements associated with different portions of the first retention scheme. ### Claim 19 (depends on 16) The non-transitory machine-readable medium of claim 16, including instructions that upon execution cause the processor to: determine a local storage multiplier based on a comparison of the maximum local retention period to the stored data structure; and determine a local storage amount based on the local storage multiplier and the expected data amount. ### Claim 20 (depends on 19) The non-transitory machine-readable medium of claim 19, including instructions that upon execution cause the processor to: determine a remote storage multiplier based on a comparison of the maximum remote retention period to the stored data structure; determine a remote storage amount based on the remote storage multiplier and the expected data amount; determine a remote metadata amount based on the remote storage amount and the remote metadata size; and determine a total amount of local storage to provision based on the local storage amount and the remote metadata amount.