Optimistically consistent arbitrary data blob transactions

A computer-implemented method, comprising:

• under control of one or more computing systems comprising one or more processors executing executable instructions,
• performing a delegation operation on a plurality of data blobs based on a data transaction, the delegation operation including:
• creating a duplicate data blobs for stored data blobs in the plurality of data blobs, the stored data blobs including stored data;
• creating a record blob that includes pointers to the duplicate data blobs;
• and
• modifying individual stored data blobs to replace respective stored data with a corresponding additional pointer that points to the record blob storing the pointers to the duplicate data blobs using optimistic locking.

A computer-implemented method, comprising:

• under control of one or more computing systems comprising one or more processors executing executable instructions,
• storing a first identifier of a stored data blob in a first master blob, the first identifier enabling an application to access data in the stored data blob;
• creating a second master blob that stores the first identifier of the stored data blob;
• creating a record blob that includes a first pointer to the second master blob;
• modifying the first master blob by replacing the first identifier stored in the first master blob with a second pointer to the record blob using optimistic locking;
• creating a new data blob that includes modified data for the stored data blob based at least in part on a data transaction and a third master blob stores a second identifier of the new data blob, the second identifier enabling the application to access data in the new data blob;
• updating the record blob by replacing the first pointer in the record blob with a third pointer to the third master blob via optimistic locking;
• and
• locking the record blob from additional updates and replacing the second pointer in the first master blob with the second identifier of the new data blob.