The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 01, 2022

Filed:

Jun. 30, 2017
Applicant:

Microsoft Technology Licensing, Llc, Redmond, WA (US);

Inventors:

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);

Hao Feng, Bellevue, WA (US);

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/22 (2019.01); G06F 16/215 (2019.01); G06F 7/14 (2006.01);
U.S. Cl.
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);
Abstract

A distributed storage system includes non-volatile storage storing portions of a first object. The first object encompasses data having a first range of addresses and each portion includes data for a respective range of addresses that is a proper subset of the first range. A first data structure stores, for each portion, data indicating the respective range of addresses and a pointer to where the portion is stored. The first data structure includes a root tree and a set of trees ordered by creation data such that a last tree is most-recently created. The non-volatile storage stores received write data and a write buffer stores index data pointing to storage locations of the received write data. An index management system stores the index data from the write buffer into the last tree and, if the ordered set is empty, creates a tree in the ordered set before the storing.


Find Patent Forward Citations

Loading…