Patents by Inventor Andrew D. Baptist

Andrew D. Baptist has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20220374162
    Abstract: A processing system of a storage network operates by receiving a write request associated with a data object; identifying dispersed storage error encoding parameters; and determining a number of available storage units. When the number of available storage units is determined to exceed a first number, the processing system operates by: determining a first write threshold number in accordance with the dispersed storage error encoding parameters; dispersed error encoding the data object to produce a first write threshold number of encoded data slices; and writing, to available storage units, the first write threshold number of encoded data slices.
    Type: Application
    Filed: August 8, 2022
    Publication date: November 24, 2022
    Applicant: Pure Storage, Inc.
    Inventors: Jason K. Resch, Andrew D. Baptist, Niall J. McShane, Greg R. Dhuse, Thomas F. Shirley, JR., Gregory Palinckx, Russell P. Kennedy, S. Christopher Gladwin, Robert C. McCammon, James Sherer
  • Patent number: 11507459
    Abstract: A method for execution in a storage network begins by generating a set of query requests for each data segment of a plurality of data segments that includes a corresponding set of slice identifiers of a plurality of sets of slice identifiers, where each slice identifier of the corresponding set of slice identifiers includes a pillar index based on a vault affiliated with the plurality of data segments. The method continues by transmitting the set of query requests to a set of storage units affiliated with the storage network, receiving a plurality of sets of query responses from the storage units, obtaining a data identifier for slice location identification and generating a storage record that includes the data identifier and an identity of the set of storage units. The method then continues by facilitating migration of at least some encoded data slices associated with the plurality of sets of slice identifiers when the storage record compares unfavorably to a storage record requirement.
    Type: Grant
    Filed: August 23, 2021
    Date of Patent: November 22, 2022
    Assignee: Pure Storage, Inc.
    Inventors: Ahmad Alnafoosi, Andrew D. Baptist, Greg R. Dhuse, Jason K. Resch, Ilya Volvovski
  • Publication number: 20220342759
    Abstract: A processing system of a storage network operates by: receiving a write request to store a data object; selecting a selected memory type of a plurality of memory types to store the data object, based on object parameters associated with the data object; selecting a selected memory to store the data object, the selected memory having the selected memory type of the plurality of memory types; and facilitating storage of the data object in the selected memory having the selected memory type of the plurality of memory types, wherein the data object is dispersed error encoded and stored as a plurality of encoded data slices.
    Type: Application
    Filed: July 7, 2022
    Publication date: October 27, 2022
    Applicant: Pure Storage, Inc.
    Inventors: Andrew D. Baptist, Wesley B. Leggette, Jason K. Resch
  • Publication number: 20220327103
    Abstract: A method begins with a processing module of a distributed storage network (DSN), receiving a request to access a data object stored in the DSN and identifying a first data descriptor associated with the data object, identifying a second data descriptor associated with the data object, identifying a first data index key and a first index structure for the first data descriptor and identifying a second data index key and a second index structure for the second data descriptor. The method continues with the processing module accessing the first index structure for the first data descriptor , based on the first and second data index keys, to retrieve a first and second set of data identifiers, respectively and based on one or more data identifiers being common to the first set of data identifiers and the second set of data identifiers, creating a superset of data identifiers.
    Type: Application
    Filed: June 29, 2022
    Publication date: October 13, 2022
    Applicant: Pure Storage, Inc.
    Inventors: Greg R. Dhuse, Ilya Volvovski, Adam M. Gray, Andrew D. Baptist
  • Patent number: 11463420
    Abstract: A method for execution by one or more storage units of a dispersed storage network (DSN). The method begins by receiving, at a first storage unit, a request for a partial task. The method continues by generating a slice request, to one or more additional storage units, when the first storage unit does not contain all encoded data slices required to execute the partial task. The method continues by receiving the at least one additional encoded data slice from the one or more additional storage units and performing the partial task on the first encoded data slice and the at least one additional encoded data slice to produce at least partial results.
    Type: Grant
    Filed: April 27, 2020
    Date of Patent: October 4, 2022
    Assignee: PURE STORAGE, INC.
    Inventors: Andrew D. Baptist, Greg R. Dhuse, Wesley B. Leggette, Jason K. Resch
  • Patent number: 11455100
    Abstract: A method for execution by a storage unit of a dispersed storage network (DSN) includes receiving a data slice for storage. A first bin that includes the data slice is generated and stored in a first location of a memory device of the storage unit, and a bin pointer that includes a reference to the first location is generated. A revision of the data slice is later received, and a second bin that includes the revised data slice is generated and stored in a second location of the memory device. A modified bin pointer is generated by editing the bin pointer to include a reference to the second location. A back pointer that references the first location is generated in response to commencing writing of the revised data slice. The back pointer is deleted in response to determining that the revised data slice has reached a finalized write stage.
    Type: Grant
    Filed: June 25, 2019
    Date of Patent: September 27, 2022
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew D. Baptist, Manish Motwani, Praveen Viraraghavan, Ilya Volvovski
  • Publication number: 20220300501
    Abstract: A database system is operable to generate a plurality of segment row data from a plurality of records received for storage. The plurality of segment row data is stored via a first storage mechanism corresponding to a first durability level. Storage of the plurality of segment row data via a second storage mechanism corresponding to a second durability level that is more durable than the first durability level is facilitated. Execution of a plurality of queries against the dataset is facilitated by accessing the plurality of segment row data via the first storage mechanism. A failure of storage of one of the plurality of segment row data via the first storage mechanism is detected. The one of the plurality of segment row data is recovered for storage via the first storage mechanism based on accessing at least one of the plurality of segment row data via the second storage mechanism.
    Type: Application
    Filed: March 17, 2022
    Publication date: September 22, 2022
    Applicant: Ocient Holdings LLC
    Inventor: Andrew D. Baptist
  • Patent number: 11442921
    Abstract: A method is presented for execution by a processing system of a dispersed storage and task (DST) processing unit that includes a processor. The method includes: receiving, at the processor, a data access request having a consistency indicator; identifying, via the processor, a set of two or more storage targets associated with the data access request; selecting, via the processor, a threshold number of storage targets of the set of two or more storage targets, based on the consistency indicator; accessing, via the processor, the selected threshold number of storage targets based on the data access request; and generating a data access response, via the processor, based on the accessing of the selected threshold number of storage targets.
    Type: Grant
    Filed: August 22, 2019
    Date of Patent: September 13, 2022
    Assignee: PURE STORAGE, INC.
    Inventors: Kumar Abhijeet, Andrew D. Baptist, Wesley B. Leggette, Greg R. Dhuse, Jason K. Resch, Manish Motwani
  • Publication number: 20220276787
    Abstract: A method includes detecting a memory error associated with a memory device of a storage unit of a set of storage units that is storing a set of encoded data slices, the storage unit services encoded data slice access messages from a processing unit, and the detecting occurs while attempting to access one or more of: a read threshold number (R) of encoded data slices, a decode threshold number (D) of encoded data slices needed to reconstruct the data segment, or a write threshold number (W) indicating a number of encoded data slices that must be accurately stored. The method further includes identifying an error descriptor code based on the detected memory error. The method further includes determining to perform an action based on the error descriptor code and executing the action to produce an action result.
    Type: Application
    Filed: April 29, 2022
    Publication date: September 1, 2022
    Applicant: Pure Storage, Inc.
    Inventors: Andrew D. Baptist, Ilir Iljazi, Niall J. McShane, Jason K. Resch
  • Publication number: 20220269679
    Abstract: A node is operable to determine to send at least on data block to a destination node. A second relay node of an initial route that includes exactly a predefined number of relay nodes for relaying at least one data block from the node to a destination node is identified. A set of intermediate node options is identified by identifying nodes of the database system capable of receiving the at least one data block from the node and further capable of sending the at least one data block to the second relay node. Intermediate node selection data is generated by selecting one intermediate node from the set of intermediate node options. The at least one data block is transmitted from the node to the one intermediate node via the first direct connection to facilitate sending of the at least one data block from the node to the destination node.
    Type: Application
    Filed: February 28, 2022
    Publication date: August 25, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • Patent number: 11416340
    Abstract: A method includes receiving a write request to store a data object; identifying object parameters associated with the data object; selecting a memory type based on the identified object parameters; selecting a selected memory based on the memory type; and facilitating storage of the data object in the selected memory, wherein the data object is dispersed error encoded.
    Type: Grant
    Filed: October 26, 2020
    Date of Patent: August 16, 2022
    Assignee: PURE STORAGE, INC.
    Inventors: Andrew D. Baptist, Wesley B. Leggette, Jason K. Resch
  • Patent number: 11418591
    Abstract: Systems and methods for storing encoded data slices in a storage network involve generating a set of write slice requests relating to the encoded data slices, outputting the set of write slice requests to distributed storage units, receiving write slice responses and determining whether to retry storing the set of encoded data slices based on one or more of the write slice responses. Determining whether to retry storing the set of encoded data slices may involve determining whether less than a write threshold number of favorable responses were received, for example in a time period, and/or whether an unfavorable response was received. Determining whether to retry may also be based on receiving a slow or non-response. For purposes of retrying, the systems and methods may also determine whether to modify the write slice requests, for example by modifying a revision number.
    Type: Grant
    Filed: March 2, 2020
    Date of Patent: August 16, 2022
    Assignee: PURE STORAGE, INC.
    Inventors: Greg R. Dhuse, Andrew D. Baptist, Ilya Volvovski, Jason K. Resch
  • Publication number: 20220253357
    Abstract: A method includes, determining, for a batch rebuild process regarding a first batch threshold number of encoded data slices of a set of encoded data slices that need rebuilding, a target storage unit of target storage units of a set of storage units of the storage network is unavailable, where a data segment of data is dispersed storage error encoded into the set of encoded data slices, the set of encoded data slices is stored in the set of storage units, and the first batch threshold number of encoded data slices is to be stored in the target storage units. When the target storage unit becomes available before a second batch rebuild threshold number of encoded data slices of the set of encoded data slices is met, the method includes executing the batch rebuild process for the first batch threshold number of encoded data slices.
    Type: Application
    Filed: April 27, 2022
    Publication date: August 11, 2022
    Applicant: Pure Storage, Inc.
    Inventors: Niall J. McShane, Andrew D. Baptist, Ravi V. Khadiwala
  • Publication number: 20220253441
    Abstract: A method includes determining a query for execution against a dataset that includes a plurality of records, where values of the plurality of records corresponding to a first subset of the plurality of fields are stored via a first storage mechanism, and values of the plurality of records corresponding to a second subset of the plurality of fields are stored via a second storage mechanism. Execution of the query is facilitated by accessing, via the first storage mechanism, values of at least one first field included in the first subset of the plurality of fields and accessing, via the second storage mechanism, values of at least one second field included in the second subset of the plurality of fields. A query resultant for the query is generated based on the values of the at least one first field and the values of the at least one second field.
    Type: Application
    Filed: February 24, 2022
    Publication date: August 11, 2022
    Applicant: Ocient Holdings LLC
    Inventor: Andrew D. Baptist
  • Patent number: 11385803
    Abstract: A method includes identifying, by a dispersed storage (DS) processing unit of a plurality of DS processing units of a dispersed storage network (DSN), a DSN operation to be performed that will adversely interfere with processing of DSN access requests. The method further includes sending, by the DS processing unit, a suspension request to a process balancing module of the DSN where the suspension request is for temporarily suspending processing of DSN access requests. The method further includes determining, by the process balancing module, whether sufficient processing resources of active DS processing units of the plurality of DS processing units are available for processing DSN access requests on behalf of the DS processing unit. When determined that sufficient processing resources are available, the method further includes granting the suspension request, and allocating DSN access requests of the DS processing unit to one ore of the active DS processing units.
    Type: Grant
    Filed: April 28, 2020
    Date of Patent: July 12, 2022
    Inventors: Andrew D. Baptist, Ravi V. Khadiwala
  • Publication number: 20220197910
    Abstract: A method includes determining a first set of query rules and receiving a query from a requesting entity. The first set of query rules is filtered to generate a proper subset of the first set of query rules by selecting only ones of the first set of query rules with parameter data comparing favorably to parameters of the query. Compliance data indicating whether the query complies with the first set of query rules is generated by determining whether the query complies with the proper subset of the first set of query rules. When the compliance data indicates the query complies with the first set of query rules, a query result is determined for the query and the query result is transmitted to the requesting entity. When the compliance data indicates the query does not comply with the first set of query rules, transmission of the query is foregone.
    Type: Application
    Filed: February 22, 2022
    Publication date: June 23, 2022
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Publication number: 20220188179
    Abstract: A computing device includes processing circuitry configured to determine whether to modify the dispersed error encoding parameters of a set of encoded data slices (EDSs) stored in a distributed storage network to produce a set of modified EDSs, wherein a data object is segmented into a plurality of data segments and in response to a determination to modify the dispersed error encoding parameters of the set of EDSs, identify a plurality of storage units to store the modified EDSs and determine modified dispersed error encoding parameters for the modified EDSs. The computing device is further configured to assign each storage unit of the plurality of storage units to execute one or more storage modification tasks associated with producing the modified EDSs; and transmit one or more EDS of the set of EDSs to each storage unit of the plurality of storage units for modification and storage.
    Type: Application
    Filed: March 4, 2022
    Publication date: June 16, 2022
    Applicant: Pure Storage, Inc.
    Inventors: Wesley B. Leggette, Andrew D. Baptist, Greg R. Dhuse, Jason K. Resch, Gary W. Grube, S. Christopher Gladwin
  • Publication number: 20220179856
    Abstract: A database system is operable to initiate execution of a query via a subset of a plurality of nodes. After initiating the execution of the query, failure detection data is generated indicating a first node included in the subset of the plurality of nodes based on determining execution condition data for the first node compares unfavorably to node execution condition requirements. Node reassignment data is generated based on the failure detection data by assigning a new node in the plurality of nodes to replace the first node in the query execution plan for a remainder of the execution of the query. A resultant is generated for the query in accordance with completion of the execution of the query, where at least a portion of the execution of the query is performed via the new node.
    Type: Application
    Filed: February 23, 2022
    Publication date: June 9, 2022
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • Publication number: 20220171780
    Abstract: A method includes determining a query request corresponding to a requesting entity. Query cost data is generated for the query request. Minimum query cost compliance data is generated for the query request based on the query cost data. A query result is for the query request is determined based on execution of the query request against a database system and the query result is transmitted to the requesting entity when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule.
    Type: Application
    Filed: February 23, 2022
    Publication date: June 2, 2022
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Patent number: 11340993
    Abstract: A method includes, when a first batch rebuild threshold is met, a computing device of a dispersed storage network (DSN) determining whether target storage units of a set of storage units of the DSN are available, where a data segment of data is dispersed storage error encoded into a set of encoded data slices, a number of encoded data slices that need rebuilding corresponds to the first batch rebuild threshold, and the number of encoded data slices is to be stored in the target storage units. When a target storage unit is unavailable, the method continues by delaying a batch rebuild process until the target storage unit is available or a second batch rebuild threshold is met. When the target storage unit becomes available before the second batch rebuild threshold is met, the method continues by executing the batch rebuild process for the number of encoded data slices.
    Type: Grant
    Filed: May 31, 2019
    Date of Patent: May 24, 2022
    Assignee: Pure Storage, Inc.
    Inventors: Niall J. McShane, Andrew D. Baptist, Ravi V. Khadiwala