Facilitation of data deletion for distributed erasure coding
First Claim
1. A method, comprising:
- determining, by a system comprising a processor, a data chunk, of data chunks representative of partitioned disk space associated with a first zone of a data store, is marked for deletion;
in response to the determining, copying, by the system, the data chunk, resulting in a copied data chunk, to a second zone of the data store associated with a coding chunk comprising the data chunks; and
based on the copied data chunk and the coding chunk, generating, by the system, a partial coding chunk, wherein the partial coding chunk is a subset of the coding chunk.
7 Assignments
0 Petitions
Accused Products
Abstract
Although a distributed storage device can recover data from multiple failures this process produces excessive inter-zone network traffic when a chunk with user data is deleted. This disclosure employs an un-encoding erasure coding and partial coding chunks to facilitate data deletes while reducing inter-zone network traffic. Therefore a data chunk representative of partitioned disk space associated with a first zone of a data store can be determined to be marked for deletion. Consequently, the data chunk can be copied, resulting in a copied data chunk, to a second zone of the data store associated with a coding chunk comprising the data chunk. Based on the copied data chunk and the coding chunk, a partial coding chunk can be generated via un-encoding, wherein the partial coding chunk is a subset of the coding chunk.
37 Citations
20 Claims
-
1. A method, comprising:
-
determining, by a system comprising a processor, a data chunk, of data chunks representative of partitioned disk space associated with a first zone of a data store, is marked for deletion; in response to the determining, copying, by the system, the data chunk, resulting in a copied data chunk, to a second zone of the data store associated with a coding chunk comprising the data chunks; and based on the copied data chunk and the coding chunk, generating, by the system, a partial coding chunk, wherein the partial coding chunk is a subset of the coding chunk. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system, comprising:
-
a processor; and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations, comprising; receiving an indication that a data chunk, of data chunks representative of apportioned disk space associated with a first zone of a data store, is to be deleted; in response to the receiving, sending a copy of the data chunk to a second zone associated with a coding chunk comprising the data chunks; and based on the copy of the data chunk and the coding chunk, generating a partial coding chunk without the data chunk, wherein the partial coding chunk is a subset of the coding chunk. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15)
-
-
16. A computer-readable storage medium comprising instructions that, in response to execution, cause a server device comprising a processor to perform operations, comprising:
-
facilitating a request to delete a data chunk of data chunks, wherein the data chunk is associated with a first zone of a data store; in response to the facilitating, facilitating generating a copy of the data chunk to be sent to a second zone associated with a coding chunk, wherein the coding chunk comprises the data chunks; facilitating sending the copy of the data chunk to the second zone; and based on an indication that the copy of the data chunk has been determined to have been received by the second zone, generating a partial coding chunk, wherein the partial coding chunk is different than the coding chunk. - View Dependent Claims (17, 18, 19, 20)
-
Specification