Valency-based data convolution for geographically diverse storage
Data convolution for geographically diverse storage is disclosed, wherein the data convolution is based on a valency metric, determination, parameter, etc. Valency can be correlated to a data object and can be inherited by a chunk comprising the data object. Valency can indicate permitted levels of convolution for a chunk. A chunk resulting from convolving at least two other contributing/participating chunks can be determined to have a valency that can be less than either of the two contributing/participating chunks. A chunk with a zero valence can be restricted from contributing to a convolution. Where the at least two other chunks both have infinite valency, the resulting convolved chunk can also have infinite valency. A chunk resulting from convolving participating chunks having mixed valency values can be reconvolved. Valency can enable orchestrating convolution of chunks, for example, to conserving storage space, mitigate computing resource consumption, etc.
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 a first valency of a first chunk stored via a geographically distributed data storage system; and
in response to determining that the first valency is a non-zero valency,
selecting a second chunk stored via the geographically distributed data storage system, wherein the second chunk corresponds to a second valency, and
enabling, based on the first valency and the second valency, generating a third chunk based on the first chunk and the second chunk.
2. The system of claim 1 , wherein the third chunk is an exclusive-or convolution of the first chunk and the second chunk.
3. The system of claim 1 , wherein the first valency is a first finite non-zero valency and the second valency is a second finite non-zero valency, and wherein a third valency of the third chunk is equal to less than the first valency.
4. The system of claim 3 , wherein the third valency is equal to the first finite non-zero valency minus one.
5. The system of claim 4 , wherein the first valency and the second valency are a same finite non-zero valency.
6. The system of claim 4 , wherein the first valency is less than the second valency.
7. The system of claim 6 , wherein the operations further comprise:
deconvolving the third chunk into the first chunk and the second chunk; and
reconvolving the first chunk and a fourth chunk based on the first valency and a fourth valency corresponding to the fourth chunk.
8. The system of claim 1 , wherein the first valency is a first finite non-zero valency and the second valency is an infinite valency, and wherein a third valency of the third chunk is a second finite non-zero valency equal to less than the first valency.
9. The system of claim 1 , wherein the first valency is an infinite valency and the second valency is the infinite valency, and wherein a third valency of the third chunk is the infinite valency.
10. The system of claim 1 , wherein operations further comprise:
in response to determining that the first valency is a zero valency,
restricting, based on the first valency, generation of a third chunk based on convolving the first chunk and another chunk.
11. The system of claim 10 , wherein the restricting permits transient convolution of the first chunk and the other chunk.
12. A method, comprising:
in response to determining, by a system comprising a processor, that a first valency of a first chunk is a non-zero valency, wherein the first chunk is stored via a geographically distributed data storage system:
selecting, by the system, a second chunk stored via the geographically distributed data storage system, wherein the second chunk corresponds to a second valency, and
generating, by the system, a third chunk based on convolving the first chunk and the second chunk; and
in response to determining, by the system, that a first valency is a zero valency, restricting generation of a third chunk based on convolving the first chunk and another chunk.
13. The method of claim 12 , wherein the restricting limits the convolving of the first chunk and the other chunk to a transient convolution of the third chunk.
14. The method of claim 12 , wherein the generating the third chunk is based on an exclusive-or convolving of the first chunk and the second chunk.
15. The method of claim 12 , wherein the selecting the second chunk results in the second valency being an infinite valency.
16. The method of claim 12 , wherein the generating the third chunk results in the third chunk having a third valency that is less than the first valency.
17. The method of claim 12 , wherein the determining that the first valency results in determining that the first valency is an infinite valency, wherein the selecting the second chunk results in the second valency being the infinite valency, and wherein the generating the third chunk results in the third chunk having a third valency that is the infinite valency.
18. A machine-readable storage medium, comprising executable instructions that, when executed by a processor, facilitate performance of operations, comprising:
receiving a first valency of a first chunk stored via a geographically distributed data storage system;
receiving a second valency of a second chunk stored via the geographically distributed data storage system;
in response to determining that the first valency is a non-zero valency, generating a third chunk that is a convolution of the first chunk and the second chunk, and determining a third valency for the third chunk; and
in response to determining that the first valency is a zero valency, restricting generation of the third chunk to a transient convolution of the first chunk and the second chunk.
19. The machine-readable storage medium of claim 18 , wherein:
in response to the first valency being a non-infinite valency, the third valency of the third chunk is determined to be less than the first valency, and
in response to the first valency being an infinite valency, the third valency of the third chunk is determined to be the infinite valency.
20. The machine-readable storage medium of claim 19 , wherein a third valency of the third chunk is determined as a function of MIN(first valency, second valency)−1.