Patents by Inventor S. Christopher Gladwin
S. Christopher Gladwin 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).
-
Patent number: 12143373Abstract: A data segment is encrypted to produce an encrypted data segment, and a data tag associated with the data segment is generated. The encrypted data segment is encoded to generate a set of encoded data slices. At least a read-threshold number of encoded data slices are required to reconstruct the encrypted data segment. A set of write slice requests, which includes the set of encoded data slices and the data tag, is transmitted to a DSN memory. A determination is made, based on the data tag, whether a first encoded data slice of the set of encoded data slices is a duplicate of a second encoded data slice already stored within the DSN memory. If it is a duplicate, rather of storing the first encoded data slice, a reference to a location of the second encoded data slice is stored.Type: GrantFiled: July 20, 2021Date of Patent: November 12, 2024Assignee: PURE STORAGE, INC.Inventors: Ilya Volvovski, S. Christopher Gladwin, Gary W. Grube, Timothy W. Markison, Jason K. Resch, Thomas Franklin Shirley, Jr., Greg Dhuse, Manish Motwani, Andrew Baptist, Wesley Leggette
-
Patent number: 12135699Abstract: A method for execution by one or more database storage nodes of a database management system includes obtaining a row of data that includes a plurality of columns. The method further includes generating a data confidence value for data within one or more columns of the plurality of columns. The method further includes storing the data confidence value in a memory of the database management system.Type: GrantFiled: September 13, 2023Date of Patent: November 5, 2024Assignee: Ocient Inc.Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
-
Patent number: 12131036Abstract: A networked database management system (DBMS) is disclosed. In particular, the disclosed DBMS includes a plurality of nodes, one of which is elected as a designated leader. The designated leader is elected using a consensus algorithm, such as tabulated random votes, RAFT or PAXOS. The designated leader is responsible for managing open coding lines, and determining when to close an open coding line.Type: GrantFiled: December 7, 2023Date of Patent: October 29, 2024Assignee: Ocient Inc.Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
-
Publication number: 20240338363Abstract: A node of a database system is operable to receive a plurality of data blocks from a set of source nodes via a set of relay nodes. At least one feedback data block to be sent to at least one of the set of source nodes is generated. Feedback relay node selection data selecting at least one of a plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to the at least one of the set of source nodes based on a prioritized feedback communication mechanism and power utilization. The at least one feedback data block is sent to the at least one of the plurality of nodes selected in the feedback relay node selection data. The at least one feedback data block is routed from the node to the at least one of the set of source nodes via the prioritized feedback communication mechanism.Type: ApplicationFiled: June 17, 2024Publication date: October 10, 2024Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20240338368Abstract: A database system operates by: determining a query request corresponding to a requesting entity; generating potential query cost data based on query cost data for the query request including power consumption and further based on running query cost data for at least one previous query request corresponding to the requesting entity; generating minimum query cost compliance data for the query request based on determining whether the potential query cost data complies with a minimum query cost rule; when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule: determining a query result for the query request based on execution of the query request against a database system.Type: ApplicationFiled: June 13, 2024Publication date: October 10, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Publication number: 20240338370Abstract: A query processing system is operable to determine a set of query rules that includes a minimum result set size rule. A query is received from a requesting entity. A size of a result set of the query is determined. Compliance data is determined based on determining whether the size of the result set complies with the minimum result set size rule and based on power utilization. When the compliance data indicates the size of the result set complies with the minimum result set size rule, a query result for the query is generated based on the result set, and the query result is generated to the requesting entity. When the compliance data indicates the size of the result set does not comply with the minimum result set size rule: transmission of the query result to the requesting entity is foregone.Type: ApplicationFiled: June 14, 2024Publication date: October 10, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Publication number: 20240330292Abstract: A database system operates by: determining a query pricing scheme, wherein the query pricing scheme indicates a record valuation scheme; receiving a query request from a requesting entity that indicates access to a subset of a plurality of records in a database system; generating query cost data based on the subset of the plurality of records by utilizing the query pricing scheme and a power consumption, wherein generating the query cost data includes: calculating plurality of record valuations by calculating a record valuation for each of the plurality of records in the subset of the plurality of records, and aggregating over the plurality of record valuations to generate a query price total indicated in the query cost data; and transmitting the query cost data to the requesting entity.Type: ApplicationFiled: June 13, 2024Publication date: October 3, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Publication number: 20240330293Abstract: A database system operates by: receiving a query request from a requesting entity; determining the maximum query cost ruleset for the requesting entity by identifying one of the plurality of maximum query cost rulesets that corresponds to one of the corresponding plurality of end users associated with the requesting entity, wherein the maximum query cost ruleset for the requesting entity indicates a set of query function-based query cost rules corresponding to each of a set of query function types; generating query cost data by utilizing the query pricing scheme based on the query request and a power consumption; and generating maximum query cost compliance data based on determining whether the query cost data complies with the maximum query cost ruleset.Type: ApplicationFiled: June 13, 2024Publication date: October 3, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Publication number: 20240330294Abstract: A database system operates to: receive a first plurality of query requests from a plurality of requesting entities; automatically generate query pricing scheme data based on the first plurality of query requests; receive a second plurality of query requests from the plurality of requesting entities; automatically generate query cost data for each of the second plurality of query requests by utilizing the query pricing scheme data and power consumption; and transmit the query cost data for each of the second plurality of query requests to a corresponding one of the plurality of requesting entities.Type: ApplicationFiled: June 13, 2024Publication date: October 3, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Publication number: 20240330291Abstract: A database system operates by: determining a query pricing scheme; receiving a query request from a requesting entity that indicates at least one query function for execution against a database system; determining a power consumption value based on the at least one query function; generating query cost data based on the at least one query function by utilizing the query pricing scheme based on the power consumption value; and transmitting the query cost data to the requesting entity.Type: ApplicationFiled: June 13, 2024Publication date: October 3, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Publication number: 20240330312Abstract: A database system operates by: receiving a first query request that indicates a first query for execution by the database system; determining a first plurality of query execution mode options for execution of the first query via the database system; generating first role reassignment restriction data for the first query based on a first plurality of query operators of the first query; selecting a first selected query execution mode from the first plurality of query execution mode options based on power consumption and role reassignment modality corresponding to the first selected query execution mode comparing favorably to the first role reassignment restriction data; and generating a resultant for the first query by facilitating execution of the first query in accordance with the first selected query execution mode.Type: ApplicationFiled: June 14, 2024Publication date: October 3, 2024Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20240330295Abstract: A user device is operable to determine a query request based on first user input to a graphical user interface displayed by the user device. Query cost data is determined based on the query request and power consumption. A prompt is displayed via the graphical user interface that indicates the query cost data. Query approval data is determined based on second user input to the graphical user interface in response to the prompt. The query request is transmitted to an analytics system for execution against a database system when the query approval data indicates approval to transmit the query request.Type: ApplicationFiled: June 13, 2024Publication date: October 3, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, Andrew D. Baptist, George Kondiles, Jason Arnold
-
Publication number: 20240303160Abstract: Methods and apparatus for preference based selection of storage network memory for data storage. In an example, a computing device receives a data object for storage in memory of the storage network and determines a system level storage efficiency preference associated with the data object. The computing device selects a set of storage nodes of a plurality of sets of storage nodes for storage of the data object based, at least in part, on the system level storage efficiency preference. The computing device further determines dispersed storage error encoding parameters for the data object, encodes the data object in accordance with the dispersed storage error encoding parameters to produce encoded data slices, and generates system addressing information for the encoded data slices.Type: ApplicationFiled: May 16, 2024Publication date: September 12, 2024Applicant: Pure Storage, Inc.Inventors: S. Christopher Gladwin, Timothy W. Markison, Greg R. Dhuse, Thomas F. Shirley, JR., Wesley B. Leggette, Jason K. Resch, Gary W. Grube
-
Patent number: 12079380Abstract: A method includes obtaining input encoded data slices from memory of the storage network, where the input encoded data slices include a set of encoded data slices interspersed with a set of auxiliary data slices, where a data segment was error encoded into the set of encoded data slices, and where auxiliary data was error encoded into the set of auxiliary data slices. The method further includes obtaining de-selection information associated with the input encoded data slices and de-selecting the sequence of input encoded data slices based on the de-selection information to produce deselected encoded data slices. The method further includes error decoding at least a decode threshold number of encoded data slices of the deselected encoded data slices in accordance with error decoding parameters to reproduce the data segment. The method further includes outputting the data segment to a requesting computing device of the storage network.Type: GrantFiled: July 6, 2023Date of Patent: September 3, 2024Assignee: Pure Storage, Inc.Inventors: S. Christopher Gladwin, Chuck Wilson Templeton, Jason K. Resch, Gary W. Grube
-
Publication number: 20240281449Abstract: A query processing system operates by: receiving a first query request that indicates a first query for execution by a database system; determining a first plurality of query execution mode options for execution of the first query via the database system; generating first role reassignment restriction data for the first query based on a first plurality of query operators of the first query; selecting a first selected query execution mode from the first plurality of query execution mode options based on role reassignment modality corresponding to the first selected query execution mode comparing favorably to the first role reassignment restriction data; and generating a resultant for the first query by facilitating execution of the first query in accordance with the first selected query execution mode.Type: ApplicationFiled: May 2, 2024Publication date: August 22, 2024Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20240273074Abstract: A method for execution by a computer of a database management system includes obtaining a dataset that includes a set of data records, where the data set is associated with a set of data characteristics. The method includes executing a selected ranked analytical calculation of a ranked list of analytical calculations on the dataset to produce an analytical calculation result, where the ranked list of analytical calculations is generated by ranking a list of analytical calculations that are able to be executed on the dataset, based on a set of analytical calculation characteristics associated with the list of analytical calculations, where an analytical calculation characteristic of the set of analytical calculation characteristics indicates an estimated execution time to perform an analytical calculation of the list of analytical calculations, and the selected ranked analytical calculation is selected based on the set of data characteristics to produce the selected ranked analytical calculation.Type: ApplicationFiled: April 23, 2024Publication date: August 15, 2024Applicant: Ocient Inc.Inventors: George Kondiles, Rhett Colin Starr, Joseph Jablonski, S. Christopher Gladwin
-
Publication number: 20240273022Abstract: A database system operates by: receiving a set of records for storage; applying a replication factor dictated by the required fault tolerance level to generate a set of replicas of the set of records; temporarily storing the set of replicas in a temporary ingress storage system during a first temporal period in accordance with the required fault tolerance level; generating a plurality of redundancy-coded segments that encodes the set of record utilizing a redundancy storage coding scheme dictated by the required fault tolerance level; and migrating the set of records from the temporary ingress storage system to a long-term storage system by storing the set of segments in the long-term storage system and by removing the set of replicas from the temporary ingress storage system.Type: ApplicationFiled: April 4, 2024Publication date: August 15, 2024Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20240265012Abstract: An object storage system is operable to store a first plurality of objects and a second plurality of objects. The first plurality of objects store a plurality of records of at least one dataset, and the second plurality of objects store a set of index structures indexing the plurality of records of the at least one dataset. A request indicating filtering parameter data to filter the plurality of records is received from a data processing system. A filtered row set identifying a proper subset of the plurality of records meeting the filtering parameter data is generated based on accessing at least one index structure of the set of index structures via accessing at least one object of the second plurality of objects. A response is sent to the data processing system that indicates the filtered row set.Type: ApplicationFiled: January 3, 2024Publication date: August 8, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, George Kondiles, Jason Arnold, Greg R. Dhuse, Joseph Jablonski
-
Publication number: 20240256541Abstract: A data processing system is operable to determining a query for execution and generate a query operator execution flow for the query that includes a first at least one operator serially before a second at least one operator. The first at least one operator of the query operator execution flow is executed based on generating a request for rows in accordance with an object storage communication protocol indicating filtering parameter data parameter, sending the request to an object storage system, and receiving a response indicating a filtered row set from the object storage system. The second at least one operator of the query operator execution flow is executed based on processing the filtered row set indicated in the response in accordance with the second at least one operator to produce the query resultant.Type: ApplicationFiled: January 3, 2024Publication date: August 1, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, George Kondiles, Jason Arnold, Greg R. Dhuse, Joseph Jablonski
-
Publication number: 20240256538Abstract: An object storage system is operable to store a plurality of records of a plurality of datasets via a plurality of objects. Configuration data mapping storage of the plurality of records of the plurality of datasets is stored via the plurality of objects. A request is received from a data processing system indicating filtering parameter data in accordance with object storage communication protocol data. A record identification pipeline is generated for execution based on the filtering parameter data and the configuration data. A filtered row set identifying a proper subset of the plurality of records meeting the filtering parameter data is generated based on executing the record identification pipeline by accessing at least one object of the plurality of objects. A response is sent to the data processing system that indicates the filtered row set in accordance with the object storage communication protocol data.Type: ApplicationFiled: January 3, 2024Publication date: August 1, 2024Applicant: Ocient Holdings LLCInventors: S. Christopher Gladwin, George Kondiles, Jason Arnold, Greg R. Dhuse, Joseph Jablonski