Reassignment of nodes during query execution
AssigneeOcient Holdings LLC
InventorsGeorge Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
Life of this patent
Estimating the term…
Loading patent…
AssigneeOcient Holdings LLC
InventorsGeorge Kondiles, Jason Arnold, S. Christopher Gladwin, Joseph Jablonski, Daniel Coombs, Andrew D. Baptist
Estimating the term…
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.
A method for execution by a query processing system, comprising:
A query processing system, comprising:
A non-transitory computer readable storage medium comprising:
Dependencies are inferred from the claim text.