CPC G06F 16/2272 (2019.01) [G06F 7/14 (2013.01); G06F 16/215 (2019.01); G06F 16/2246 (2019.01); G06F 16/2282 (2019.01)] | 20 Claims |
1. A method, implemented at a computer system that includes a processor, for performing a cross-merge within a distributed storage system, the method comprising:
identifying a data structure that includes (i) a root anchor tree and (ii) an ordered set of anchor trees that are ordered based on their creation, such that a last anchor tree of the ordered set of anchor trees is most-recently created, the data structure storing index data for a set of objects stored in a non-volatile storage;
creating a new anchor tree in the ordered set of anchor trees;
identifying, from a set of delta tables, index data representing one or more objects that are stored on the non-volatile storage; and
merging the index data representing the one or more objects into the new anchor tree.
|