Abstract: The technologies described herein are generally directed toward writing multiple data objects to object storage. An example method can include receiving an aggregated data object comprising a set of data objects and metadata corresponding to respective data objects of the set of data objects. The method can further include updating the metadata to comprise the respective storage locations. Further, the method can include updating the metadata to include the respective storage locations. The method can further include allocating the metadata to be stored by metadata processing equipment, resulting in the metadata being stored in metadata storage equipment.

Abstract: The technologies described herein are generally directed toward writing multiple data objects to object storage. An example method can include receiving an aggregated data object comprising a set of data objects and metadata corresponding to respective data objects of the set of data objects. The method can further include updating the metadata to comprise the respective storage locations. Further, the method can include updating the metadata to include the respective storage locations. The method can further include allocating the metadata to be stored by metadata processing equipment, resulting in the metadata being stored in metadata storage equipment.

Abstract: The disclosed technology generally describes separating types of data chunks in a copy-on-write/MVCC B+ tree, chunk-based data storage system, and also allocating the sizes of leaf chunks to be smaller than that of other (e.g., internal and root node) chunks. By having leaf chunks separate from node chunks, the probability of having a fully reclaimable (without copying) chunk is increased. Similarly, by having smaller sized leaf chunks relative to node chunks, the probability of having a fully reclaimable (without copying) leaf chunks is increased. The technology thus facilitates more efficient garbage collection.

Abstract: The present disclosure relates to managing an index of a storage system. For instance, update requests are divided into groups of update requests, the update requests being used to update data items in the storage system respectively. Regarding a target update request in a group of update requests among the groups of update requests, a target leaf node in the index is determined, the target leaf node comprising a target data item that is to be updated according to the target update request. The target leaf node is updated based on the target update request. In response to determining all to-be-updated data items in the target leaf node have been updated, the updated target leaf node is added to a write queue of the storage system. Accordingly, the index of the storage system is accessible with higher efficiency, and further the overall performance of the storage system may be improved.

Abstract: The disclosed technology generally describes separating types of data chunks in a copy-on-write/MVCC B+ tree, chunk-based data storage system, and also allocating the sizes of leaf chunks to be smaller than that of other (e.g., internal and root node) chunks. By having leaf chunks separate from node chunks, the probability of having a fully reclaimable (without copying) chunk is increased. Similarly, by having smaller sized leaf chunks relative to node chunks, the probability of having a fully reclaimable (without copying) leaf chunks is increased. The technology thus facilitates more efficient garbage collection.