| CPC G06F 16/2255 (2019.01) [G06F 16/2365 (2019.01); G06F 16/2455 (2019.01); G06F 16/9014 (2019.01)] | 16 Claims |

|
1. A method for generating a universal distributed data storage, comprising:
receiving, by a processing server, a data signal superimposed with a plurality of data values from two or more data sets to be combined into a single data storage without collisions;
generating, by the processing server, a key for each of the plurality of data values, wherein the respective key is generated via application of a collision-resistant hashing algorithm to an associated data value;
executing, by the processing server, a first query on a database of the processing server to store each of the plurality of data values and an associated generated key in the database of the processing server as a plurality of key-value pairs;
receiving, by the processing server, a data signal superimposed with a plurality of additional key-value pairs;
executing, by the processing server, a second query on the database of the processing server to store each of the plurality of additional key-value pairs in the database of the processing server, wherein each key included in the plurality of additional key-value pairs is generated via application of the collision-resistant hashing algorithm to the associated data value;
receiving, by the processing server, from an external system via a communication network, a data signal superimposed with a rehash request that indicates a hashing algorithm different from the collision-resistant hashing algorithm; and
without requiring exchanging the data values or associated keys, generating, by the processing server, a new key for each of the plurality of data values and each value included in the plurality of additional key-value pairs by rehashing the data values using the hashing algorithm received from the external system.
|