IP Library Granted Patent US 12,585,539
Granted Patent B2
US 12,585,539 · App. 18/652,274 · Granted Mar 24, 2026

Storage network for storage of data object sets with a common trait

Inventors: Jason K. Resch (Warwick, RI); Greg Dhuse (Chicago, IL); Andrew Baptist (Mt. Pleasant, WI)
Assignee: Pure Storage, Inc.
G06F11/1076G06F3/0619G06F3/064G06F3/067G06F11/1092G06F16/2237G06F16/86G06F16/951H03M13/2906G06F2211/1028
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,585,539
App. No.
18/652,274
Granted
Mar 24, 2026
Kind
B2
Abstract

A storage network is operable to identify a set of data objects having a common trait from a plurality of data objects for storage via the storage network. The set of data objects are combined to produce a concatenated data object. The concatenated data object is encoded in accordance with a dispersed encoding function to produce a set of encoded data blocks. A mapping of the set of data objects to the set of encoded data blocks is generated. The mapping facilitates retrieval from the storage network of individual data objects of the set of data objects.

Claims (32)

1 . A method for execution in a storage network, the method comprises:

identifying a set of data objects having a common trait from a plurality of data objects for storage via the storage network;

combining the set of data objects to produce a concatenated data object;

encoding the concatenated data object in accordance with a dispersed encoding function to produce a set of encoded data blocks; and

generating a mapping of the set of data objects to the set of encoded data blocks, wherein the mapping facilitates retrieval from the storage network of individual data objects of the set of data objects.

2 . The method of claim 1 , wherein the set of data objects includes a plurality of data blocks.

3 . The method of claim 2 , wherein the set of data objects is encoded by:

dispersed error encoding the plurality of data blocks to produce the set of encoded data blocks.

4 . The method of claim 2 , wherein generating the mapping of the set of data objects to the set of encoded data blocks includes mapping the set of data objects to the plurality of data blocks.

5 . The method of claim 1 , wherein the dispersed encoding function includes an erasure coding.

6 . The method of claim 1 , wherein the dispersed encoding function includes a forward error-correction encoding.

7 . The method of claim 1 , wherein the mapping of the set of data objects includes mapping a single data object of the set of data objects to more than one encoded data block of the set of encoded data blocks.

8 . The method of claim 1 , wherein the mapping of the set of data objects includes mapping a plurality of data objects of the set of data objects to a single encoded data block of the set of encoded data blocks.

9 . The method of claim 1 , wherein the common trait is a common data type.

10 . The method of claim 1 , wherein the common trait is a common entity.

11 . A processing system of a storage network comprises:

a computing device;

a memory that stores operational instructions that, when executed by the computing device, causes the computing device to perform operations that include:

identifying a set of data objects having a common trait from a plurality of data objects for storage via the storage network;

combining the set of data objects to produce a concatenated data object;

encoding the concatenated data object in accordance with a dispersed encoding function to produce a set of encoded data blocks; and

generating a mapping of the set of data objects to the set of encoded data blocks, wherein the mapping facilitates retrieval from the storage network of individual data objects of the set of data objects.

12 . The processing system of claim 11 , wherein the set of data objects includes a plurality of data blocks.

13 . The processing system of claim 12 , wherein the set of data objects is encoded by:

dispersed error encoding the plurality of data blocks to produce the set of encoded data blocks.

14 . The processing system of claim 12 , wherein generating the mapping of the set of data objects to the set of encoded data blocks includes mapping the set of data objects to the plurality of data blocks.

15 . The processing system of claim 11 , wherein the dispersed encoding function includes an erasure coding.

16 . The processing system of claim 11 , wherein the dispersed encoding function includes a forward error-correction encoding.

17 . The processing system of claim 11 , wherein the mapping of the set of data objects includes mapping a single data object of the set of data objects to more than one encoded data block of the set of encoded data blocks.

18 . The processing system of claim 11 , wherein the mapping of the set of data objects includes mapping a plurality of data objects of the set of data objects to a single encoded data block of the set of encoded data blocks.

19 . The processing system of claim 11 , wherein the common trait is a common data type.

20 . The processing system of claim 11 , wherein the common trait is a common entity.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 10, 2024
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 069139/0852 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 8, 2024
From: CLEVERSAFE, INC.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 069124/0645 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 4, 2024
From: RESCH, JASON K.; DHUSE, GREG; BAPTIST, ANDREW
To: CLEVERSAFE, INC.
Reel/Frame 068798/0079 →
Continuity (11)
Continuation 18190364 · Mar 27, 2023
Continuation 17443915 · Jul 28, 2021
Continuation 17195150 · Mar 8, 2021
Continuation 17081056 · Oct 27, 2020
Continuation 16988247 · Aug 7, 2020
Continuation 16171794 · Oct 26, 2018
Continuation 15679569 · Aug 17, 2017
Continuation 15351628 · Nov 15, 2016
Continuation 14589391 · Jan 5, 2015
Provisional Application 61944742 · Feb 26, 2014
Related Publication 20240281328A1 · Aug 22, 2024
References Cited (109)
US 4092732A · Ouchi · 1978 [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 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 8151082B2 · Flynn · 2012 [cited by examiner]
US 8555109B2 · Dhuse · 2013 [cited by examiner]
US 8819011B2 · Motwani · 2014 [cited by examiner]
US 9542239B2 · Gray · 2017 [cited by applicant]
US 11093330B1 · Resch · 2021 [cited by applicant]
US 11656941B2 · Resch · 2023 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020166079A1 · Ulrich · 2002 [cited by applicant]
US 20030018927A1 · Gadir · 2003 [cited by applicant]
US 20030037261A1 · Meffert · 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 20040215998A1 · Buxton · 2004 [cited by applicant]
US 20040228493A1 · Ma · 2004 [cited by applicant]
US 20050100022A1 · Ramprashad · 2005 [cited by applicant]
US 20050114594A1 · Corbett · 2005 [cited by applicant]
US 20050125593A1 · Karpoff · 2005 [cited by applicant]
US 20050131993A1 · Fatula, Jr. · 2005 [cited by applicant]
US 20050132070A1 · Redlich · 2005 [cited by applicant]
US 20050144382A1 · Schmisseur · 2005 [cited by applicant]
US 20050229069A1 · Hassner · 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 · 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, III · 2007 [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 20110004812A1 · Yang · 2011 [cited by applicant]
US 20110289359A1 · Resch · 2011 [cited by applicant]
US 20120317439A1 · K · 2012 [cited by applicant]
US 20130086303A1 · Ludwig · 2013 [cited by examiner]
US 20140025770A1 · Warfield · 2014 [cited by examiner]
US 20140046906A1 · Patiejunas · 2014 [cited by examiner]
US 20140046909A1 · Patiejunas · 2014 [cited by examiner]
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]