IP Library Granted Patent US 12,608,151
Granted Patent B2
US 12,608,151 · App. 19/013,498 · Granted Apr 21, 2026

Storage network having metadata storage trees

Inventors: Renars W. Narubin (San Francisco, CA); Jason K. Resch (Warwick, RI); Gary W. Grube (Barrington Hills, IL)
Assignee: Pure Storage, Inc.
G06F3/0646G06F3/0604G06F3/064G06F3/067G06F11/1435
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,608,151
App. No.
19/013,498
Granted
Apr 21, 2026
Kind
B2
Abstract

A method includes error encoding data to produce a plurality of data slices. Metadata is determined for a data slice of the plurality of data slices. The metadata is stored in a metadata storage tree. The data slice is stored in a slice storage location indicated by the metadata. Based on determining to access the data slice, the metadata for the data slice is accessed in the metadata storage tree to determine the slice storage location for the data slice, and the data slice is accessed in the slice storage location based on determining the slice storage location for the data slice via accessing the metadata storage tree.

Claims (45)

1 . A method comprises:

determining metadata for a data slice of a plurality of data slices;

storing the metadata in a metadata storage tree, wherein the metadata storage tree is stored via a first plurality of memory devices of a first memory type;

storing the data slice in a slice storage location indicated by the metadata, within a second plurality of memory devices of a second memory type;

receiving an access request corresponding to the data slice;

retrieving the slice storage location for the data slice from the metadata storage tree by accessing the metadata for the data slice in the metadata storage tree; and

accessing the data slice in the slice storage location.

2 . The method of claim 1 , wherein the first plurality of memory devices corresponds to a plurality of solid-state memory devices.

3 . The method of claim 1 , wherein the data is encoded via erasure encoding.

4 . The method of claim 1 , wherein the data is error encoded via an encoding process to produce the plurality of data slices in accordance with a width parameter of the encoding process.

5 . The method of claim 4 , wherein a corresponding decoding process can accommodate a number of failures equal to the width parameter minus an error coding parameter of the encoding process.

6 . The method of claim 1 , further comprising:

generating an initial metadata storage tree structure in at least one of the first plurality of memory devices.

7 . The method of claim 1 , wherein the metadata stored in the metadata storage tree includes an address indicating the slice storage location of the data slice in the second plurality of memory devices.

8 . The method of claim 1 , wherein the metadata further indicates a data object identifier.

9 . The method of claim 8 , wherein the metadata further indicates a revision number.

10 . The method of claim 1 , further comprising:

receiving access information from a plurality of storage units that include at least one of: at least one of the first plurality of memory devices, or at least one of the second plurality of memory devices.

11 . The method of claim 10 , further comprising:

configuring the plurality of storage units based on receiving the access information.

12 . The method of claim 1 , further comprising:

expanding the metadata storage tree to accommodate further storage.

13 . The method of claim 1 , wherein the data is error encoded based on receiving the data for storage.

14 . The method of claim 1 , wherein the first memory type has a different performance level from the second memory type.

15 . The method of claim 14 , wherein the first memory type has a higher performance level than the second memory type.

16 . A processing system of a storage system comprises:

at least one processor;

a memory that stores operational instructions that, when executed by the at least one processor, cause the processing system to:

determining metadata for a data slice of a plurality of data slices;

storing the metadata in a metadata storage tree, wherein the metadata storage tree is stored via a first plurality of memory devices of a first memory type;

storing the data slice in a slice storage location indicated by the metadata, within a second plurality of memory devices of a second memory type;

receiving an access request corresponding to the data slice;

retrieving the slice storage location for the data slice from the metadata storage tree by accessing the metadata for the data slice in the metadata storage tree; and

accessing the data slice in the slice storage location.

17 . The processing system of claim 16 , wherein the first plurality of memory devices corresponds to a plurality of solid-state memory devices.

18 . The processing system of claim 16 , wherein the data is encoded via erasure encoding.

19 . The processing system of claim 16 , wherein the data is error encoded via an encoding process to produce the plurality of data slices in accordance with a width parameter of the encoding process.

20 . A non-transitory computer readable storage medium comprises:

at least one memory section that stores operational instructions that, when executed by a processing system that includes a processor and a memory, causes the processing system to:

determining metadata for a data slice of a plurality of data slices;

storing the metadata in a metadata storage tree, wherein the metadata storage tree is stored via a first plurality of memory devices of a first memory type;

storing the data slice in a slice storage location indicated by the metadata, within a second plurality of memory devices of a second memory type;

receiving an access request corresponding to the data slice;

retrieving the slice storage location for the data slice from the metadata storage tree by accessing the metadata for the data slice in the metadata storage tree; and

accessing the data slice in the slice storage location.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 10, 2025
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 069870/0077 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 9, 2025
From: RESCH, JASON K.; GRUBE, GARY W.
To: PURE STORAGE, INC.
Reel/Frame 069796/0821 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 9, 2025
From: NARUBIN, RENARS W.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 069796/0972 →
Continuity (11)
Continuation 18481395 · Oct 5, 2023
Continuation 17834254 · Jun 7, 2022
Continuation In Part 17655841 · Mar 22, 2022
Continuation In Part 17066873 · Oct 9, 2020
Continuation In Part 16136362 · Sep 20, 2018
Continuation In Part 15397374 · Jan 3, 2017
Continuation In Part 15285582 · Oct 5, 2016
Continuation In Part 13291030 · Nov 7, 2011
Provisional Application 62287145 · Jan 26, 2016
Provisional Application 61417873 · Nov 29, 2010
Related Publication 20250147684A1 · May 8, 2025
References Cited (141)
US 4092732A · Ouchi · 1978 [cited by applicant]
US 5208813A · Stallmo · 1993 [cited by applicant]
US 5359610A · Weng · 1994 [cited by applicant]
US 5454101A · Mackay · 1995 [cited by applicant]
US 5485474A · Rabin · 1996 [cited by applicant]
US 5774643A · Lubbers · 1998 [cited by applicant]
US 5802364A · Senator · 1998 [cited by applicant]
US 5809285A · Hilland · 1998 [cited by applicant]
US 5890156A · Rekieta · 1999 [cited by applicant]
US 5987622A · Lo Verso · 1999 [cited by applicant]
US 5991414A · Garay · 1999 [cited by applicant]
US 6012159A · Fischer · 2000 [cited by applicant]
US 6058454A · Gerlach · 2000 [cited by applicant]
US 6128277A · Bruck · 2000 [cited by applicant]
US 6175571B1 · Haddock · 2001 [cited by applicant]
US 6192472B1 · Garay · 2001 [cited by applicant]
US 6256688B1 · Suetaka · 2001 [cited by applicant]
US 6272658B1 · Steele · 2001 [cited by applicant]
US 6301604B1 · Nojima · 2001 [cited by applicant]
US 6356949B1 · Katsandres · 2002 [cited by applicant]
US 6366969B1 · Hanson · 2002 [cited by applicant]
US 6366995B1 · Vilkov · 2002 [cited by applicant]
US 6374336B1 · Peters · 2002 [cited by applicant]
US 6415373B1 · Peters · 2002 [cited by applicant]
US 6418539B1 · Walker · 2002 [cited by applicant]
US 6449688B1 · Peters · 2002 [cited by applicant]
US 6567948B2 · Steele · 2003 [cited by applicant]
US 6571282B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6609223B1 · Wolfgang · 2003 [cited by applicant]
US 6718361B1 · Basani · 2004 [cited by applicant]
US 6760808B2 · Peters · 2004 [cited by applicant]
US 6785768B2 · Peters · 2004 [cited by applicant]
US 6785783B2 · Buckland · 2004 [cited by applicant]
US 6826711B2 · Moulton · 2004 [cited by applicant]
US 6879596B1 · Dooply · 2005 [cited by applicant]
US 7003688B1 · Pittelkow · 2006 [cited by applicant]
US 7024451B2 · Jorgenson · 2006 [cited by applicant]
US 7024609B2 · Wolfgang · 2006 [cited by applicant]
US 7080101B1 · Watson · 2006 [cited by applicant]
US 7103824B2 · Halford · 2006 [cited by applicant]
US 7103915B2 · Redlich · 2006 [cited by applicant]
US 7111115B2 · Peters · 2006 [cited by applicant]
US 7140044B2 · Redlich · 2006 [cited by applicant]
US 7146644B2 · Redlich · 2006 [cited by applicant]
US 7171493B2 · Shu · 2007 [cited by applicant]
US 7222133B1 · Raipurkar · 2007 [cited by applicant]
US 7240236B2 · Cutts · 2007 [cited by applicant]
US 7272613B2 · Sim · 2007 [cited by applicant]
US 7636724B2 · de la Torre · 2009 [cited by applicant]
US 7685312B1 · Caronni · 2010 [cited by applicant]
US 8135936B2 · Schaefer · 2012 [cited by applicant]
US 8495111B1 · Wang · 2013 [cited by applicant]
US 8843459B1 · Aston · 2014 [cited by applicant]
US 8924658B1 · Bairavasundaram · 2014 [cited by applicant]
US 9292620B1 · Hoover · 2016 [cited by applicant]
US 9542239B2 · Gray · 2017 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020166079A1 · Ulrich · 2002 [cited by applicant]
US 20020181594A1 · Katsavounidis · 2002 [cited by applicant]
US 20030018927A1 · Gadir · 2003 [cited by applicant]
US 20030037261A1 · Meffert · 2003 [cited by applicant]
US 20030039212A1 · Lloyd · 2003 [cited by applicant]
US 20030065617A1 · Watkins · 2003 [cited by applicant]
US 20030084020A1 · Shu · 2003 [cited by applicant]
US 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040122917A1 · Menon · 2004 [cited by applicant]
US 20040148360A1 · Mehra · 2004 [cited by applicant]
US 20040215998A1 · Buxton · 2004 [cited by applicant]
US 20040228493A1 · Ma · 2004 [cited by applicant]
US 20050100022A1 · Ramprashad · 2005 [cited by applicant]
US 20050108414A1 · Taylor · 2005 [cited by applicant]
US 20050114594A1 · Corbett · 2005 [cited by applicant]
US 20050125593A1 · Karpoff · 2005 [cited by applicant]
US 20050131993A1 · Fatula · 2005 [cited by applicant]
US 20050132070A1 · Redlich · 2005 [cited by applicant]
US 20050144382A1 · Schmisseur · 2005 [cited by applicant]
US 20050154731A1 · Ito · 2005 [cited by applicant]
US 20050229069A1 · Hassner · 2005 [cited by applicant]
US 20050273686A1 · Turner · 2005 [cited by applicant]
US 20060047907A1 · Shiga · 2006 [cited by applicant]
US 20060136448A1 · Cialini · 2006 [cited by applicant]
US 20060156059A1 · Kitamura · 2006 [cited by applicant]
US 20060224603A1 · Correll, Jr. · 2006 [cited by applicant]
US 20070079081A1 · Gladwin · 2007 [cited by applicant]
US 20070079082A1 · Gladwin · 2007 [cited by applicant]
US 20070079083A1 · Gladwin · 2007 [cited by applicant]
US 20070088970A1 · Buxton · 2007 [cited by applicant]
US 20070174192A1 · Gladwin · 2007 [cited by applicant]
US 20070214285A1 · Au · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070283167A1 · Venters · 2007 [cited by applicant]
US 20080010409A1 · Rao · 2008 [cited by applicant]
US 20080186615A1 · Isono · 2008 [cited by applicant]
US 20080313398A1 · Koseki · 2008 [cited by applicant]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100122020A1 · Sikdar · 2010 [cited by applicant]
US 20100131827A1 · Sokolov · 2010 [cited by applicant]
US 20100293409A1 · Machida · 2010 [cited by applicant]
US 20110055178A1 · Mark · 2011 [cited by applicant]
US 20110126295A1 · Resch · 2011 [cited by applicant]
US 20110161666A1 · Gladwin · 2011 [cited by applicant]
US 20110196838A1 · Zunger · 2011 [cited by applicant]
US 20110231624A1 · Fukutomi · 2011 [cited by applicant]
US 20110289366A1 · Baptist · 2011 [cited by applicant]
US 20120117351A1 · Motwani · 2012 [cited by applicant]
US 20120137091A1 · Grube et al. · 2012 [cited by applicant]
US 20120254690A1 · Resch · 2012 [cited by applicant]
US 20120266050A1 · Cideciyan · 2012 [cited by applicant]
US 20140130055A1 · Guha · 2014 [cited by applicant]
US 20140297951A1 · Baptist · 2014 [cited by applicant]
US 20140310462A1 · Waldspurger · 2014 [cited by applicant]
US 20140325307A1 · Resch · 2014 [cited by applicant]
US 20140351528A1 · Motwani · 2014 [cited by applicant]
US 20150100846A1 · Gladwin · 2015 [cited by applicant]
US 20150142817A1 · Zheng · 2015 [cited by applicant]
US 20150317196A1 · Kazi · 2015 [cited by applicant]
US 20150378822A1 · Grube · 2015 [cited by applicant]
US 20160283394A1 · Chahal · 2016 [cited by applicant]
US 20160371001A1 · Kikuchi · 2016 [cited by applicant]
US 20180020055A1 · Kalaf · 2018 [cited by applicant]
WO 2015167665A1 · 2015 [cited by applicant]
Chung; An Automatic Data Segmentation Method for 3D Measured Data Points; National Taiwan University; pp. 1-8; 1998. [cited by applicant]
Harrison; Lightweight Directory Access Protocol (LDAP): Authentication Methods and Security Mechanisms; IETF Network Working Group; RFC 4513; Jun. 2006; pp. 1-32. [cited by applicant]
Kubiatowicz, et al.; OceanStore: An Architecture for Global-Scale Persistent Storage; Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 20… [cited by applicant]
LEGG; Lightweight Directory Access Protocol (LDAP): Syntaxes and Matching Rules; IETF Network Working Group; RFC 4517; Jun. 2006; pp. 1-50. [cited by applicant]
Plank, T1: Erasure Codes for Storage Applications; FAST2005, 4th Usenix Conference on File Storage Technologies; Dec. 13-16, 2005; pp. 1-74. [cited by applicant]
Rabin; Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance; Journal of the Association for Computer Machinery; vol. 36, No. 2; Apr. 1989; pp. 335-348. [cited by applicant]
Satran, et al.; Internet Small Computer Systems Interface (Iscsi); IETF Network Working Group; RFC 3720; Apr. 2004; pp. 1-257. [cited by applicant]
Sciberras; Lightweight Directory Access Protocol (LDAP): Schema for User Applications; IETF Network Working Group; RFC 4519; Jun. 2006; pp. 1-33. [cited by applicant]
Sermersheim; Lightweight Directory Access Protocol (LDAP): The Protocol; IETF Network Working Group; RFC 4511; Jun. 2006; pp. 1-68. [cited by applicant]
Shamir; How to Share a Secret; Communications of the ACM; vol. 22, No. 11; Nov. 1979; pp. 612-613. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): Uniform Resource Locator; IETF Network Working Group; RFC 4516; Jun. 2006; pp. 1-15. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): String Representation of Search Filters; IETF Network Working Group; RFC 4515; Jun. 2006; pp. 1-12. [cited by applicant]
Wildi; Java iSCSi Initiator; Master Thesis; Department of Computer and Information Science, University of Konstanz; Feb. 2007; 60 pgs. [cited by applicant]
Xin, et al.; Evaluation of Distributed Recovery in Large-Scale Storage Systems; 13th IEEE International Symposium on High Performance Distributed Computing; Jun. 2004; pp. 172-181. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Directory Information Models; IETF Network Working Group; RFC 4512; Jun. 2006; pp. 1-49. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Internationalized String Preparation; IETF Network Working Group; RFC 4518; Jun. 2006; pp. 1-14. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): String Representation of Distinguished Names; IETF Network Working Group; RFC 4514; Jun. 2006; pp. 1-15. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Technical Specification Road Map; IETF Network Working Group; RFC 4510; Jun. 2006; pp. 1-8. [cited by applicant]