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: 20210303466
    Abstract: A method for execution by a temporary ingress storage system includes receiving a set of records to be processed for long-term storage. The set of records are temporarily stored in a set of memory resources of the temporary ingress storage system during a first temporal period. Execution of a query is facilitated by accessing a subset of the set of records from at least one memory resource of the set of memory resources during the first temporal period. The set of records are processed to generate a set of segments for long-term storage. Migration of the set of records from the temporary ingress storage system to a long-term storage system for during a second temporal period that begins after the first temporal period has elapsed by sending the set of records to the long-term storage system.
    Type: Application
    Filed: March 25, 2020
    Publication date: September 30, 2021
    Applicant: Ocient Holdings LLC
    Inventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
  • Patent number: 11132257
    Abstract: A method of rebuilding data stored as encoded data slices in a dispersed storage network (DSN) includes obtaining, by a rebuilding module implemented in a processing device, an identity of a plurality slices-in-error to be rebuilt, wherein each individual slice-in-error is associated with index information specifying: a particular dispersed storage unit associated with the individual slice-in-error; and a number of slices-in-error associated with the particular dispersed storage unit. A first slice-in-error is selected for rebuilding based, at least in part, on the number of slices-in-error associated with a first dispersed storage unit associated with the first slice-in-error. Read slice requests at least a decode threshold number of data slices are issued to the first dispersed storage unit. At least a decode threshold number of slices are received at the rebuilding module, which rebuilds the first slice-in-error using the received slices.
    Type: Grant
    Filed: January 2, 2019
    Date of Patent: September 28, 2021
    Assignee: PURE STORAGE, INC.
    Inventors: Andrew D. Baptist, Greg R. Dhuse, Adam M. Gray, Wesley B. Leggette, Jason K. Resch, Ilya Volvovski
  • Patent number: 11132340
    Abstract: A storage unit in a distributed storage network (DSN) transmits resource availability information to a managing unit. The resource availability information includes information indicating a number of available memory devices of the storage unit that are available to be used for storage of encoded data slices. The storage unit receives resource assignment information determined by the managing unit. The resource assignment information includes one or more dispersal parameters, information identifying a set of storage units to be included in a newly instantiated DSN memory, and a DSN address range assigned to the storage unit for use in the newly instantiated DSN memory. The storage unit selects particular available memory devices of the storage unit to assign to the newly instantiated DSN memory. The selection is based on the resource assignment information.
    Type: Grant
    Filed: October 26, 2018
    Date of Patent: September 28, 2021
    Assignee: PURE STORAGE, INC.
    Inventors: Trent W. Johnson, Andrew D. Baptist, Ilya Volvovski, John Quigley
  • Publication number: 20210286675
    Abstract: A method for execution by a computing device of a storage network includes obtaining storage performance information for a set of storage units of the storage network, where data segments are dispersed storage error encoded into pluralities of sets of encoded data slices in accordance with error encoding parameters that include a pillar width number and a decode threshold number, which is a number of encoded data slices the set of encode data slices is required to reconstruct a data segment of data segments. The method further includes determining, based on the storage performance information and the error encoding parameters, a performance threshold number for a write request to store a set of encoded data slices of the pluralities of sets of encoded data slices in the set of storage units, where the performance threshold number is greater than the decode threshold number and less than the pillar width number.
    Type: Application
    Filed: May 28, 2021
    Publication date: September 16, 2021
    Applicant: Pure Storage, Inc.
    Inventors: Greg R. Dhuse, Jason K. Resch, Andrew D. Baptist, Ilya Volvovski
  • Patent number: 11113008
    Abstract: A storage unit (SU) includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The SU, of a first SU set, receives a partially encoded slice request to restore a set of encoded data slices (EDSs) that are based on first dispersed storage error coding function parameters. The SU generates a decode threshold number of partially EDSs based on the first and second dispersed storage error coding function parameters. The SU then outputs the decode threshold number of partially EDSs to a second SU set to undergo selective combination respectively to generate new EDSs for storage within the SUs of the second decode threshold number of SUs of the second SU set.
    Type: Grant
    Filed: August 22, 2019
    Date of Patent: September 7, 2021
    Assignee: Pure Storage, Inc.
    Inventors: Wesley B. Leggette, Andrew D. Baptist, Greg R. Dhuse, Jason K. Resch, Gary W. Grube, S. Christopher Gladwin
  • Patent number: 11113009
    Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and memory such that the processing module, when operable within the computing device based on the operational instructions, is configured to perform various operations. For example, the computing device generates a prioritized request that includes at least one of a task for execution or a priority level based on information stored within a storage unit (SU) of a plurality of storage units (SUs) implemented within the DSN. Note that the information corresponds to a data object that is related to a set of encoded data slices (EDSs) that are distributedly stored within the DSN. The computing device then transmits the prioritized request to the SU and receives, from the SU, a response to the prioritized request.
    Type: Grant
    Filed: October 23, 2020
    Date of Patent: September 7, 2021
    Assignee: Pure Storage, Inc.
    Inventors: Ahmad Alnafoosi, Andrew D. Baptist, Greg R. Dhuse, Jason K. Resch, Ilya Volvovski
  • Patent number: 11106679
    Abstract: A method for execution by a query processing system includes determining a first set of query rules for first data received from a first data provider and to determine a second set of query rules for second data received from a second data provider. A query received from a requesting entity is determined to involve at least one query function that accesses a subset of the first data. Compliance data is generated by determining whether the query complies with 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 for the query based on execution of the query, and the query result is transmitted to the requesting entity. The query result is not transmitted to the requesting entity when the compliance data indicates the query does not comply with the first set of query rules.
    Type: Grant
    Filed: October 30, 2019
    Date of Patent: August 31, 2021
    Assignee: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Patent number: 11093500
    Abstract: A method for execution by a query processing system includes receiving a query request from a requesting entity. Query cost data is generated based on the query request by utilizing a query pricing scheme. Minimum query cost compliance data is generated for the query request based on determining whether the minimum query cost data complies with a minimum query cost rule. When the minimum query cost compliance data indicates the minimum query cost data complies with the minimum query cost rule a query result is generated based on facilitating execution of the query by executing at least one query function of the query against a database system, and the query result is transmitted to the requesting entity. When the minimum query cost compliance data indicates the query cost data does not comply with the minimum query cost rule, the query result is not transmitted to the requesting entity.
    Type: Grant
    Filed: October 28, 2019
    Date of Patent: August 17, 2021
    Assignee: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Patent number: 11061613
    Abstract: A computer readable storage device includes a first memory section that stores operational instructions that, when executed, cause a computing device to, as data accesses occur for a plurality of data objects of a storage container, update object values to produce updated object values, update object retention costs to produce updated object retention costs, adjust a dynamic retention threshold based on the updated object values and the updated object retention costs and update a data object retention policy for a data object based on the dynamic retention threshold to produce an updated retention policy for the data object. The computer readable storage device includes a second memory section that stores operational instructions that, when executed, cause the computing device to, when a data access is a deletion request, utilizing a current updated data object retention policy to determine and execute a deletion-retention option for the data object.
    Type: Grant
    Filed: July 24, 2019
    Date of Patent: July 13, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew D. Baptist, Bart R. Cilfone, Greg R. Dhuse, Harsha Hegde, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Ilya Volvovski, Ethan S. Wozniak
  • Patent number: 11023338
    Abstract: A method for execution by dispersed storage failure detection unit of a dispersed storage network includes generating a storage unit weights and storage set weights based on the storage unit weights. One storage unit that meets a weight-adjustment trigger condition is identified, and a new storage unit weight for the identified storage unit is generated. A first data migration within the storage set that includes the identified storage unit is facilitated based on the storage unit weights. A failing set of storage units in a second storage set is identified. A new storage set weight for the second storage set is generated when the number of storage units in the failing set compares favorably to a failure threshold number. A second data migration that includes transferring data slices stored in the second storage unit to other storage sets is facilitated based on the storage set weights.
    Type: Grant
    Filed: January 31, 2019
    Date of Patent: June 1, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew D. Baptist, Dustin M. Hendrickson, Wesley B. Leggette, Manish Motwani, Brian F. Ober, Jason K. Resch
  • Patent number: 11019146
    Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes determining a first optimal slice size requirement is determined for a first independent data element (IDE). The first IDE is split into a first plurality of IDEs based on determining the first IDE compares unfavorably to the first optimal slice size requirement. An error coding function is performed on the first plurality of IDEs to produce a set of encoded slices for each of the first plurality of IDEs for transmission to storage units. A subset of additional IDEs are selected to be merged into a merged IDE based on a second optimal slice size requirement, and continuous content of the subset of additional IDEs is concatenated to produce the merged IDE. The error coding function is performed on the merged IDE to produce a second set of encoded slices for transmission to storage units.
    Type: Grant
    Filed: September 16, 2019
    Date of Patent: May 25, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jason K. Resch, Ram Narayanan, Andrew D. Baptist, Praveen Viraraghavan, Wesley B. Leggette, Ethan S. Wozniak, Manish Motwani, Bart R. Cilfone, Greg R. Dhuse
  • Publication number: 20210141795
    Abstract: A method for execution by a query processing system includes receiving a query request from a requesting entity. Query cost data is generated based on the query request by utilizing a query pricing scheme. Minimum query cost compliance data is generated for the query request based on determining whether the minimum query cost data complies with a minimum query cost rule. When the minimum query cost compliance data indicates the minimum query cost data complies with the minimum query cost rule a query result is generated based on facilitating execution of the query by executing at least one query function of the query against a database system, and the query result is transmitted to the requesting entity. When the minimum query cost compliance data indicates the query cost data does not comply with the minimum query cost rule, the query result is not transmitted to the requesting entity.
    Type: Application
    Filed: January 15, 2021
    Publication date: May 13, 2021
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Publication number: 20210133196
    Abstract: A method for execution by a query processing system includes determining a first set of query rules for first data received from a first data provider and to determine a second set of query rules for second data received from a second data provider. A query received from a requesting entity is determined to involve at least one query function that accesses a subset of the first data. Compliance data is generated by determining whether the query complies with 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 for the query based on execution of the query, and the query result is transmitted to the requesting entity. The query result is not transmitted to the requesting entity when the compliance data indicates the query does not comply with the first set of query rules.
    Type: Application
    Filed: October 30, 2019
    Publication date: May 6, 2021
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Patent number: 10997023
    Abstract: A method for execution by a dispersed storage and task (DST) execution unit includes receiving a slice access request for execution by the DST execution unit. At least one ordered codec algorithm is identified. The slice access request is executed by utilizing the at least one ordered codec algorithm. A slice access response indicating an outcome of the slice access request is generated by the DST execution unit.
    Type: Grant
    Filed: November 7, 2019
    Date of Patent: May 4, 2021
    Assignee: PURE STORAGE, INC.
    Inventors: Andrew D. Baptist, Manish Motwani, Jason K. Resch, Ilya Volvovski
  • Patent number: 10996894
    Abstract: A method begins or continues by a computing device of a dispersed storage network (DSN) determining an error with a first write request in a first zone of a plurality of zones of a memory device of a storage unit of DSN, where the first zone includes a first set of sequential blocks that are in a first logical and physical location of the memory device. The method continues with the computing device abandoning pending write requests to the first zone. The method continues with reassigning the first write request to a second zone of the memory device, where the second zone includes a second set of sequential blocks that are in a second logical and physical location of the memory device.
    Type: Grant
    Filed: July 17, 2019
    Date of Patent: May 4, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ying Z. Guo, Praveen Viraraghavan, Ilya Volvovski, Benjamin L. Martin, Manish Motwani, Andrew D. Baptist, Jordan H. Williams
  • Publication number: 20210124744
    Abstract: A method for execution by a query processing system includes receiving a query request from a requesting entity. Query cost data is generated based on the query request by utilizing a query pricing scheme. Minimum query cost compliance data is generated for the query request based on determining whether the minimum query cost data complies with a minimum query cost rule. When the minimum query cost compliance data indicates the minimum query cost data complies with the minimum query cost rule a query result is generated based on facilitating execution of the query by executing at least one query function of the query against a database system, and the query result is transmitted to the requesting entity. When the minimum query cost compliance data indicates the query cost data does not comply with the minimum query cost rule, the query result is not transmitted to the requesting entity.
    Type: Application
    Filed: October 28, 2019
    Publication date: April 29, 2021
    Applicant: Ocient Holdings LLC
    Inventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
  • Patent number: 10969972
    Abstract: A computing device of a dispersed storage network includes a processing module operable to receive a plurality of requests regarding writing a plurality of data objects to storage units from a plurality of user computing devices. The processing module is further operable to activate a verification process to verify a content format verification code provided by a user computing device for a request regarding writing a data object, activate a signature process to sign the content format verification code with a trusted certificate to produce a signed content format verification code, send the trusted certificate and a signed content format verification code identification to a dispersed storage (DS) processing unit, receive a verification message indicating that the content format verification code identifies a correct format for the data object, and send the data object in the correct format to the DS processing unit for dispersed storage error encoding and storage.
    Type: Grant
    Filed: July 31, 2019
    Date of Patent: April 6, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew D. Baptist, Bart R. Cilfone, Greg R. Dhuse, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Ilya Volvovski, Ethan S. Wozniak
  • Patent number: 10969962
    Abstract: A method for execution by a dispersed storage and task (DST) execution unit includes generating a first compaction object by performing a compaction function on a first previously compacted object and first data slices that compare favorably to a cold access threshold. Storage of the first previously compacted object in a cold memory region is replaced with the first compacted object, and the first data slices are removed from prior storage in different memory regions. A second compacted object is generated by performing the compaction function on a second previously compacted object and second data slices that compare favorably to a hot access threshold. Storage of the second previously compacted object in a hot memory region is replaced with the second compacted object, and the second data slices are removed from prior storage in different memory regions.
    Type: Grant
    Filed: July 22, 2019
    Date of Patent: April 6, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ilya Volvovski, Praveen Viraraghavan, Andrew D. Baptist, Jason K. Resch
  • Patent number: 10970168
    Abstract: A method includes determining, by a computing device of a dispersed storage network (DSN), routing path performance information of a set of routing paths with respect to a set of storage units of the DSN. The method further includes adjusting a pillar width to decode threshold ratio of a dispersed storage error encoding function when the routing path performance information deviates from a performance threshold. The performance threshold includes a first error rate threshold and a second error rate threshold. The method further includes dispersed storage error encoding a data object using the adjusted pillar width to decode threshold ratio to produce a plurality of sets of encoded data slices. The method further includes sending the plurality of sets of encoded data slices to the set of storage units via the set of routing paths for storage therein.
    Type: Grant
    Filed: April 8, 2019
    Date of Patent: April 6, 2021
    Assignee: PURE STORAGE, INC.
    Inventors: Gary W. Grube, Timothy W. Markison, S. Christopher Gladwin, Greg R. Dhuse, Andrew D. Baptist, Ilya Volvovski, Jason K. Resch
  • Patent number: 10963397
    Abstract: A method includes determining, by a storage unit, to place a pointer in a hash table that is stored in local memory of the storage unit. The method further includes executing, by the storage unit, a hash function on addressing information relating to the pointer to produce a hash resultant. The method further includes executing, by the storage unit, a second function on related data to the addressing information or to the pointer to produce an auxiliary resultant. The method further includes storing, by the storage unit, the hash resultant and the auxiliary resultant as an entry in the hash table for the pointer, wherein, when a hash collision occurs with respect to the hash resultant, the storage unit utilizes the auxiliary resultant to resolve the hash collision.
    Type: Grant
    Filed: March 26, 2018
    Date of Patent: March 30, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Greg R. Dhuse, Ilya Volvovski, Ethan S. Wozniak, Ravi V. Khadiwala, Jason K. Resch, Andrew D. Baptist, Praveen Viraraghavan