US 11,816,084 B2
Staging anchor trees for improved concurrency and performance in page range index management
Krishnan Varadarajan, Redmond, WA (US); Jegan Devaraju, Redmond, WA (US); Shane Mainali, Duvall, WA (US); Quan Zhang, Kenmore, WA (US); Sridhar Srinivasan, Shanghai (CN); Bin Tong, Bellevue, WA (US); He Su, Shanghai (CN); Ju Wang, Cupertino, CA (US); Manish Chablani, Redmond, WA (US); and Hao Feng, Bellevue, WA (US)
Assigned to Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Aug. 24, 2022, as Appl. No. 17/894,925.
Application 17/894,925 is a continuation of application No. 16/617,432, granted, now 11,487,734, previously published as PCT/CN2017/091091, filed on Jun. 30, 2017.
Prior Publication US 2022/0405262 A1, Dec. 22, 2022
Int. Cl. G06F 16/22 (2019.01); G06F 16/215 (2019.01); G06F 7/14 (2006.01)
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
OG exemplary drawing
 
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.