Structuring storage based on latch-free B-trees

A method comprising:

• obtaining a request to modify an object in storage that is associated with one or more computing devices, the storage organized based on a latch-free B-tree structure that is updated via latch-free updates;
• determining, via a hardware device processor, a storage address of the object, based on accessing a mapping table that includes map indicators mapping logical object identifiers to physical storage addresses;
• initiating a prepending of a first delta record to a prior object state of the object, the first delta record indicating an object modification associated with the obtained request;
• and
• initiating installation of a first state change associated with the object modification via a first atomic operation on a mapping table entry that indicates the prior object state of the object.

A method comprising:

• determining that a size of a page associated with a latch-free B-tree structure that is updated via latch-free updates, is unacceptable;
• and
• initiating via a hardware device processor a modification of a node of the latch-free B-tree structure that is associated with the page, based on:
• initiating a prepending of a delta record to the node, the delta record including an indication of the modification and a physical address pointer to the node, and
• initiating at least one atomic operation to update an indirect address table to replace the physical address of the node with a physical address of the delta record, the indirect address table including logical page identifiers and corresponding physical addresses of physical pages associated with the logical page identifiers.