# US 2022/0066994 A1 · Efficient retrieval of data that has been losslessly reduced using a prime data sieve

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

- Number: US 2022/0066994 A1
- Document ID: US20220066994A1
- Status: Published application
- Kind: A1
- Application number: 17/413,886
- Filed: 2019-12-11
- Published: 2022-03-03
- Earliest claimed: 2018-12-13
- Assignees: Ascava, Inc.
- Applicants: Ascava, Inc.
- Inventors: Harshvardhan Sharangpani
- Web page: https://patentgrep.com/patent/US20220066994A1

## CPC

- G06F 16/1744: {using compression, e.g. sparse files}
- G06F 16/164: {File meta data generation}
- G06F 16/1727: {Details of free space management performed by the file system (saving storage space on storage systems G06F3/0608; management of blocks in storage devices G06F3/064)}
- G06F 16/1752: {based on file chunks}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Techniques and systems for reconstituting a sequence of losslessly reduced data chunks are described. Some embodiments can collect metadata while losslessly reducing a sequence of data chunks by using prime data elements to obtain the sequence of losslessly reduced data chunks, wherein the metadata includes an indicator corresponding to each prime data element that indicates whether or not the prime data element is referenced in multiple losslessly reduced data chunks, and optionally includes a memory size of each prime data element. Some embodiments can retrieve the metadata and reconstitute the sequence of losslessly reduced data chunks, wherein during reconstitution, the metadata can be used to retain only those prime data elements in memory that are referenced in multiple losslessly reduced data chunks. Some embodiments can, prior to performing reconstitution, use the metadata to optionally allocate sufficient memory to store the prime data elements that are referenced in multiple losslessly reduced data chunks.

## Claims

### Claim 1

A method for reconstituting a sequence of losslessly-reduced data chunks created by losslessly reducing a sequence of data chunks using prime data elements, wherein each prime data element comprises a sequence of bytes, wherein metadata is collected while said losslessly reducing the sequence of data chunks, wherein said losslessly reducing the sequence of data chunks comprises using contents of a data chunk to identify a set of prime data elements by performing a content-associative lookup on a data structure that organizes the prime data elements, and using the set of prime data elements to losslessly reduce the data chunk to obtain a losslessly-reduced data chunk, wherein the losslessly-reduced data chunk includes (1) if the data chunk is identical to a prime data element in the set of prime data elements, a reference to the prime data element, or (2) if the data chunk is not identical to any of the prime data elements in the set of prime data elements, a reference to one or more prime data elements in the set of prime data elements and a sequence of transformations that derives the data chunk from the one or more prime data elements, the method comprising:
retrieving, by processor, the metadata which includes an indicator corresponding to each prime data element that indicates whether or not the prime data element is referenced in multiple losslessly-reduced data chunks; and
while reconstituting the sequence of losslessly-reduced data chunks, using the metadata to retain only those prime data elements in memory that are referenced in multiple losslessly-reduced data chunks.

### Claim 2 (depends on 1)

The method of claim 1, wherein the metadata includes a memory size of each prime data element.

### Claim 3 (depends on 2)

The method of claim 2, comprising:
using the metadata to calculate a memory size required to store all prime data elements that are referenced in multiple losslessly-reduced data chunks by adding up memory sizes of all prime data elements that are referenced in multiple losslessly reduced data chunks.

### Claim 4 (depends on 3)

The method of claim 3, comprising:
prior to reconstituting the sequence of losslessly-reduced data chunks, allocating an amount of memory that is greater than or equal to the memory size required to store all prime data elements that are referenced in multiple losslessly-reduced data chunks.

### Claim at position 5

5-12. (canceled)

### Claim 13

A method for determining metadata for prime data elements while losslessly reducing a sequence of data chunks to obtain a sequence of losslessly-reduced data chunks, wherein the metadata reduces an amount of memory required during subsequent reconstitution of the sequence of losslessly-reduced data chunks, wherein each prime data element comprises a sequence of bytes, wherein said losslessly reducing the sequence of data chunks comprises using contents of a data chunk to identify a set of prime data elements by performing a content-associative lookup on a data structure that organizes the prime data elements, and using the set of prime data elements to losslessly reduce the data chunk to obtain a losslessly-reduced data chunk, wherein the losslessly-reduced data chunk includes (1) if the data chunk is identical to a prime data element in the set of prime data elements, a reference to the prime data element, or (2) if the data chunk is not identical to any of the prime data elements in the set of prime data elements, a reference to one or more prime data elements in the set of prime data elements and a sequence of transformations that derives the data chunk from the one or more prime data elements, the method comprising:
for each prime data element, determining, by a processor, whether or not the prime data element is referenced in multiple losslessly-reduced data chunks; and
storing metadata for each prime data element, wherein the metadata includes an indicator corresponding to each prime data element that indicates whether or not the prime data element is referenced in multiple losslessly-reduced data chunks.

### Claim 14 (depends on 13)

The method of claim 13, comprising:
retrieving the metadata; and
while reconstituting the sequence of losslessly-reduced data chunks, using the metadata to retain only those prime data elements in memory that are referenced in multiple losslessly-reduced data chunks.

### Claim 15 (depends on 13)

The method of claim 13, wherein the metadata includes a memory size of each prime data element.

### Claim 16 (depends on 15)

The method of claim 15, comprising:
using the metadata to calculate a memory size required to store all prime data elements that are referenced in multiple losslessly-reduced data chunks by adding up memory sizes of all prime data elements that are referenced in multiple losslessly reduced data chunks.

### Claim 17 (depends on 16)

The method of claim 16, comprising:
retrieving the metadata;
allocating an amount of memory that is greater than or equal to the memory size required to store all prime data elements that are referenced in multiple losslessly-reduced data chunks; and
while reconstituting the losslessly-reduced data, using the metadata to retain only those prime data elements in memory that are referenced in multiple losslessly-reduced data chunks.

### Claim 18

A non-transitory computer-readable storage medium storing instructions that, when executed by a computer, cause the computer to perform a method for determining metadata for prime data elements while losslessly reducing a sequence of data chunks to obtain a sequence of losslessly-reduced data chunks, wherein the metadata reduces an amount of memory required during subsequent reconstitution of the sequence of losslessly-reduced data chunks, wherein each prime data element comprises a sequence of bytes, wherein said losslessly reducing the sequence of data chunks comprises using contents of a data chunk to identify a set of prime data elements by performing a content-associative lookup on a data structure that organizes the prime data elements, and using the set of prime data elements to losslessly reduce the data chunk to obtain a losslessly-reduced data chunk, wherein the losslessly-reduced data chunk includes (1) if the data chunk is identical to a prime data element in the set of prime data elements, a reference to the prime data element, or (2) if the data chunk is not identical to any of the prime data elements in the set of prime data elements, a reference to one or more prime data elements in the set of prime data elements and a sequence of transformations that derives the data chunk from the one or more prime data elements, the method comprising:
for each prime data element, determining whether or not the prime data element is referenced in multiple losslessly-reduced data chunks; and
storing metadata for each prime data element, wherein the metadata includes an indicator corresponding to each prime data element that indicates whether or not the prime data element is referenced in multiple losslessly-reduced data chunks.

### Claim 19 (depends on 18)

The non-transitory computer-readable storage medium of claim 18, wherein the method comprises:
retrieving the metadata; and
while reconstituting the sequence of losslessly-reduced data chunks, using the metadata to retain only those prime data elements in memory that are referenced in multiple losslessly-reduced data chunks.

### Claim 20 (depends on 18)

The non-transitory computer-readable storage medium of claim 18, wherein the metadata includes a memory size of each prime data element.

### Claim 21 (depends on 20)

The non-transitory computer-readable storage medium of claim 20, wherein the method comprises:
using the metadata to calculate a memory size required to store all prime data elements that are referenced in multiple losslessly-reduced data chunks by adding up memory sizes of all prime data elements that are referenced in multiple losslessly reduced data chunks.

### Claim 22 (depends on 21)

The non-transitory computer-readable storage medium of claim 21, wherein the method comprises:
retrieving the metadata;
allocating an amount of memory that is greater than or equal to the memory size required to store all prime data elements that are referenced in multiple losslessly-reduced data chunks; and
while reconstituting the losslessly-reduced data, using the metadata to retain only those prime data elements in memory that are referenced in multiple losslessly-reduced data chunks.

### Claim at position 16

23-27. (canceled)
