Patents by Inventor Daniel Coombs
Daniel Coombs 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: 11580102Abstract: A method for execution by a query processing system includes determining a query request that indicates a plurality of operators, where the plurality of operators includes at least one relational algebra operator and further includes at least one non-relational operator. A query operator execution flow is generated from the query request that indicates a serialized ordering of the plurality of operators. A query resultant of the query is generated by facilitating execution of the query via a set of nodes of a database system that each perform a plurality of operator executions in accordance with the query operator execution flow, where a subset of the set of nodes each execute at least one operator execution corresponding to the at least one non-relational operator in accordance with the execution of the query.Type: GrantFiled: April 2, 2020Date of Patent: February 14, 2023Assignee: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Patent number: 11533353Abstract: A method includes processing a plurality of incoming messages via a plurality of feed receiver modules based on key assignment data. Each feed receiver module in the plurality of feed receiver modules receives a proper subset of messages of the plurality of incoming messages with keys included in a corresponding subset of a plurality of possible keys assigned to the each feed receiver module in the key assignment data and maintains a queue that includes messages of the proper subset of messages that compare favorably to a time window. Each feed receiver module identifies owned ones of the proper subset of messages having keys included in an owned subset of keys in the corresponding subset, corresponding to keys in the corresponding subset to which the each feed receiver module is assigned as an owner in the key assignment data, and emits only the owned ones of the proper subset of messages.Type: GrantFiled: February 23, 2022Date of Patent: December 20, 2022Assignee: Ocient Holdings LLCInventor: Daniel Coombs
-
Publication number: 20220365935Abstract: A processing system of a node is operable to determine at least one query for execution, and determine a set of segments that include a set of rows required to execute the at least one query. At least one virtual segment in the set of segments is identified, and at least two data portions in the at least one virtual segment are identified. A locally rebuilt set of rows for the at least two data portions is generated by utilizing a recovery scheme. Query resultant data is generated based on performing execution of the at least one query by utilizing the locally rebuilt set of rows.Type: ApplicationFiled: July 29, 2022Publication date: November 17, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Patent number: 11436232Abstract: A method for execution by a node of a computing device includes determining a plurality of queries for concurrent execution. A plurality of sets of segments required to execute the plurality of queries is determined, and a set of virtual segments in the plurality of sets of segments is determined. A subset of the set of virtual segments is be determined by identifying ones of the set of virtual segments that are required to execute multiple ones of plurality of queries. A locally rebuilt set of rows for each of the set of virtual segments is generated by utilizing a recovery scheme. For each one of the set of virtual segments included in the subset, in response to generating the locally rebuilt set of rows, concurrent partial execution of corresponding multiple ones of the plurality of queries is facilitated.Type: GrantFiled: January 22, 2021Date of Patent: September 6, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Publication number: 20220269679Abstract: 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: ApplicationFiled: February 28, 2022Publication date: August 25, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20220207044Abstract: A processing system of a node is operable to determine a query for execution and determine a set of segments that each include a corresponding set of rows required to execute the query. A first segment of the set of segments is determined to be processed as a virtual segment. A locally rebuilt set of rows corresponding to the first segment is generated by utilizing a recovery scheme based on determining the first segment is to be processed as a virtual segment. Execution of the query is facilitated by utilizing the locally rebuilt set of rows.Type: ApplicationFiled: March 15, 2022Publication date: June 30, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Patent number: 11366813Abstract: A method for execution by a node of a computing device includes determining a plurality of queries for concurrent execution. A plurality of sets of segments required to execute the plurality of queries is determined, and a set of virtual segments in the plurality of sets of segments is determined. A subset of the set of virtual segments is be determined by identifying ones of the set of virtual segments that are required to execute multiple ones of plurality of queries. A locally rebuilt set of rows for each of the set of virtual segments is generated by utilizing a recovery scheme. For each one of the set of virtual segments included in the subset, in response to generating the locally rebuilt set of rows, concurrent partial execution of corresponding multiple ones of the plurality of queries is facilitated.Type: GrantFiled: January 22, 2021Date of Patent: June 21, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Publication number: 20220191261Abstract: A method includes processing a plurality of incoming messages via a plurality of feed receiver modules based on key assignment data. Each feed receiver module in the plurality of feed receiver modules receives a proper subset of messages of the plurality of incoming messages with keys included in a corresponding subset of a plurality of possible keys assigned to the each feed receiver module in the key assignment data and maintains a queue that includes messages of the proper subset of messages that compare favorably to a time window. Each feed receiver module identifies owned ones of the proper subset of messages having keys included in an owned subset of keys in the corresponding subset, corresponding to keys in the corresponding subset to which the each feed receiver module is assigned as an owner in the key assignment data, and emits only the owned ones of the proper subset of messages.Type: ApplicationFiled: February 23, 2022Publication date: June 16, 2022Applicant: Ocient Holdings LLCInventor: Daniel Coombs
-
Publication number: 20220179856Abstract: 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: ApplicationFiled: February 23, 2022Publication date: June 9, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Patent number: 11308094Abstract: A method for execution by a node of a computing device includes determining a plurality of queries for concurrent execution. A plurality of sets of segments required to execute the plurality of queries is determined, and a set of virtual segments in the plurality of sets of segments is determined. A subset of the set of virtual segments is be determined by identifying ones of the set of virtual segments that are required to execute multiple ones of plurality of queries. A locally rebuilt set of rows for each of the set of virtual segments is generated by utilizing a recovery scheme. For each one of the set of virtual segments included in the subset, in response to generating the locally rebuilt set of rows, concurrent partial execution of corresponding multiple ones of the plurality of queries is facilitated.Type: GrantFiled: January 22, 2021Date of Patent: April 19, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Daniel Coombs
-
Publication number: 20220114176Abstract: A method for execution by a node of a database system includes receiving a first data block, determining data block processing instruction data for the first data block is not indicated in previously received data blocks, and adding the first data block to an unknown purpose data block cache. Prior to elapsing of a storage time window for storage of the first data block, at least one second data block is received that indicates data block processing instruction data for the first data block. The first data block is processed by applying the data block processing instruction data. A third data block is received and is added to the unknown purpose data block cache. The third data block is removed from the unknown purpose data block cache based on elapsing of a storage time window for storage of the third data block.Type: ApplicationFiled: December 23, 2021Publication date: April 14, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20220114175Abstract: A method for execution by a database system includes determining physical network topology data of a plurality of nodes of the database system utilized to facilitate query executions. Initial route selection data indicating a set of initial relay nodes for each of a plurality of pairs of the plurality of nodes is based on the physical network topology data by selecting one of a plurality of possible initial route options for the each of the plurality of pairs of the plurality of nodes. The initial route selection data is sent to the plurality of nodes. A query resultant is generated by facilitating execution of a query, via the plurality of nodes, by facilitating routing of data blocks between at least one of the plurality of pairs of the plurality of nodes via a set of intermediate nodes selected based on the initial route selection data in accordance with a dynamic data block routing scheme.Type: ApplicationFiled: December 23, 2021Publication date: April 14, 2022Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20220114155Abstract: A database system operates by: receiving a user-generated secondary indexing hint data for a dataset from a client device, wherein the client device generated the user-generated hint data based on user input in response to at least one prompt displayed by an interactive interface displayed via a display device of the client device; generating a plurality of segments that each include distinct subsets of a plurality of rows of a dataset; automatically selecting, for each of the plurality of segments, a secondary indexing scheme from a plurality of secondary indexing options based on the user-provided secondary indexing hint data; generating a plurality of secondary indexes for each of the plurality of segments in accordance with the corresponding secondary indexing scheme; and storing the plurality of segments and the plurality of secondary indexes in memory.Type: ApplicationFiled: March 24, 2021Publication date: April 14, 2022Applicant: Ocient Holdings LLCInventors: Greg R. Dhuse, Daniel Coombs
-
Patent number: 11297123Abstract: A method includes generating key assignment data indicating assignment of keys to a plurality of feed receiver modules, and processing a plurality of incoming messages via the plurality of feed receiver modules based on the key assignment data. Each of the plurality of feed receiver modules receives a proper subset of the plurality of incoming messages based on the key assignment data, and maintains a queue that includes messages of the proper subset that compare favorably to a time window. Each of the plurality of feed receiver modules identifies owned ones of the proper subset of messages having keys included in an owned subset of keys based on the key assignment data, and emits only the owned ones of the proper subset of messages.Type: GrantFiled: December 11, 2020Date of Patent: April 5, 2022Assignee: Ocient Holdings LLCInventor: Daniel Coombs
-
Patent number: 11294916Abstract: A method for execution by a query processing system includes receiving a query request that indicates a query for execution by a database system. A plurality of query execution mode options for execution of the query via the database system can be determined. A plurality of execution success conditions corresponding to the plurality of query execution mode options can be determined. A plurality of resultant correctness guarantee data corresponding to the plurality of query execution mode options based on the plurality of execution success conditions can be generated. Query execution mode selection data can be generated by selecting a query execution mode from the plurality of query execution mode options based having resultant correctness guarantee data that compares favorably to determined resultant correctness requirement data. A resultant for the query can be generated by facilitating execution of the query in accordance with the selected execution mode.Type: GrantFiled: May 20, 2020Date of Patent: April 5, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Patent number: 11238041Abstract: A method for execution by a node in a database system includes determining to send a data block from a node to a destination node of a database system in accordance with execution of a query. An initial route to the destination node that includes a predefined number of relay nodes in a sequential relay ordering is determined. The second relay node in the sequential relay ordering is identified, and a set of intermediate node options that are each capable of receiving data from the node via a direct connection and capable of sending data to the second relay node via a direct connection is identified. One intermediate node is selected from the set of intermediate node options, and the data block is transmitted from the node to the one intermediate node to facilitate sending of the data to the destination node via exactly the predefined number of relay nodes.Type: GrantFiled: March 25, 2020Date of Patent: February 1, 2022Assignee: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20210365456Abstract: A method for execution by a query processing system includes receiving a query request that indicates a query for execution by a database system. A plurality of query execution mode options for execution of the query via the database system can be determined. A plurality of execution success conditions corresponding to the plurality of query execution mode options can be determined. A plurality of resultant correctness guarantee data corresponding to the plurality of query execution mode options based on the plurality of execution success conditions can be generated. Query execution mode selection data can be generated by selecting a query execution mode from the plurality of query execution mode options based having resultant correctness guarantee data that compares favorably to determined resultant correctness requirement data. A resultant for the query can be generated by facilitating execution of the query in accordance with the selected execution mode.Type: ApplicationFiled: May 20, 2020Publication date: November 25, 2021Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20210311943Abstract: A method for execution by a query processing system includes determining a query request that indicates a plurality of operators, where the plurality of operators includes at least one relational algebra operator and further includes at least one non-relational operator. A query operator execution flow is generated from the query request that indicates a serialized ordering of the plurality of operators. A query resultant of the query is generated by facilitating execution of the query via a set of nodes of a database system that each perform a plurality of operator executions in accordance with the query operator execution flow, where a subset of the set of nodes each execute at least one operator execution corresponding to the at least one non-relational operator in accordance with the execution of the query.Type: ApplicationFiled: April 2, 2020Publication date: October 7, 2021Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20210303466Abstract: 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: ApplicationFiled: March 25, 2020Publication date: September 30, 2021Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
-
Publication number: 20210303570Abstract: A method for execution by a node in a database system includes determining to send a data block from a node to a destination node of a database system in accordance with execution of a query. An initial route to the destination node that includes a predefined number of relay nodes in a sequential relay ordering is determined. The second relay node in the sequential relay ordering is identified, and a set of intermediate node options that are each capable of receiving data from the node via a direct connection and capable of sending data to the second relay node via a direct connection is identified. One intermediate node is selected from the set of intermediate node options, and the data block is transmitted from the node to the one intermediate node to facilitate sending of the data to the destination node via exactly the predefined number of relay nodes.Type: ApplicationFiled: March 25, 2020Publication date: September 30, 2021Applicant: Ocient Holdings LLCInventors: George Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist