# US 2019/0317859 A1 · Meta chunks

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

- Number: US 2019/0317859 A1
- Document ID: US20190317859A1
- Status: Published application
- Kind: A1
- Application number: 15/952,179
- Filed: 2018-04-12
- Published: 2019-10-17
- Earliest claimed: 2018-04-12
- Assignees: EMC IP Holding Company LLC
- Applicants: EMC IP Holding Company LLC
- Inventors: Mikhail Danilov; Kirill Gusakov
- Web page: https://patentgrep.com/patent/US20190317859A1

## CPC

- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0644: {Management of space entities, e.g. partitions, extents, pools}
- G06F 3/0652: {Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- H03M 13/154: {Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Data protection with meta chunks increases capacity use efficiency without verification and data copying. In one aspect, a meta chunk is a data protection unit, which combines two or more source chunks that are determined to have a reduced sets of data fragments. The meta chunk can be encoded to generate a set of coding fragments, which can be stored and utilized to recover data fragments of any of the two or more source chunks. Further, the source chunks can be linked to the meta chunk. Furthermore, the sets of coding fragments, that were previously generated by individually encoding each source chunk, can be deleted.

## Claims

### Claim 1

A system, comprising:
a processor; and
a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations, comprising:
determining source chunks stored within a storage system, wherein the source chunks are determined to have fewer than a defined number of data fragments;
based on combining the source chunks, generating a meta chunk; and
encoding the meta chunk to generate coding fragments that are employable to recover at least a portion of the source chunks.

### Claim 2 (depends on 1)

The system of claim 1, wherein the operations further comprise:
linking the source chunks to the meta chunk.

### Claim 3 (depends on 2)

The system of claim 2, wherein the linking comprises updating metadata associated with a source chunk of the source chunks to comprise reference data indicative of the meta chunk.

### Claim 4 (depends on 1)

The system of claim 1, wherein the coding fragments are meta chunk coding fragments and the operations further comprise:
subsequent to the encoding, deleting source chunk coding fragments that have been generated based on individually encoding the source chunks.

### Claim 5 (depends on 1)

The system of claim 1, wherein the meta chunk is a first meta chunk, the source chunks are first source chunks, the first source chunks comprise a second meta chunk that has been generated based on a combination of second source chunks, and wherein the second source chunks are determined to have fewer than the defined number of data fragments.

### Claim 6 (depends on 5)

The system of claim 5, wherein the operations further comprise:
subsequent to the encoding, deleting the second meta chunk.

### Claim 7 (depends on 1)

The system of claim 1, wherein the encoding comprises erasure coding the meta chunk.

### Claim 8 (depends on 7)

The system of claim 7, wherein the combined data fragments of the source chunks are determined to satisfy a defined criterion associated with an erasure coding protocol.

### Claim 9 (depends on 1)

The system of claim 1, wherein physical capacity is not allocated for the meta chunk.

### Claim 10 (depends on 1)

The system of claim 1, wherein the storage system comprises a geographically-distributed object storage system.

### Claim 11

A method, comprising:
selecting, by a system comprising a processor, source chunks from chunks of an object storage system, wherein the source chunks are determined to have fewer data fragments than remaining of the chunks other than the source chunks;
combining the source chunks to generate a meta chunk; and
based on erasure coding the meta chunk, determining coding fragments for the source chunks at a meta chunk level, wherein the coding fragments are to be employed to recover at least a portion of the source chunks during a failure condition.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
storing reference data that links the source chunks to the meta chunk.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
in response to determining that the failure condition is satisfied, detecting that at least the portion of the source chunks is unavailable.

### Claim 14 (depends on 13)

The method of claim 13, further comprising:
based on the reference data, determining the meta chunk linked to at least the portion of the source chunks.

### Claim 15 (depends on 14)

The method of claim 14, further comprising:
recovering at least the portion of the source chunks based on performing a decoding operation at the meta chunk level.

### Claim 16 (depends on 11)

The method of claim 11, wherein the coding fragments are first coding fragments, and the method further comprises:
subsequent to the determining, deleting source second fragments that have been generated based on individually erasure coding the source chunks.

### Claim 17

A computer-readable storage medium comprising instructions that, in response to execution, cause a server device comprising a processor to perform operations, comprising:
combining source chunks stored within an object storage system to generate a meta chunk, wherein the source chunks are determined not to have more than a defined number of data fragments; and
based on erasure coding the meta chunk, determining coding fragments for the source chunks at a meta chunk level, wherein the coding fragments are to be employed to recover at least a portion of the source chunks during a failure condition.

### Claim 18 (depends on 17)

The computer-readable storage medium of claim 17, wherein the coding fragments are meta chunk coding fragments, and the operations further comprise:
subsequent to the determining, deleting source chunk coding fragments that have been generated based on individually erasure coding the source chunks.

### Claim 19 (depends on 17)

The computer-readable storage medium of claim 17, wherein the operations further comprise:
determining reference data that links the source chunks to the meta chunk.

### Claim 20 (depends on 19)

The computer-readable storage medium of claim 19, wherein the operations further comprise:
updating metadata associated with the source chunks the reference data.
