Ocient Holdings LLC

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.

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.

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 computing device includes a computing device controller hub and a plurality of parallelized nodes coupled to the computing device controller hub. Each node of the plurality of parallelized nodes includes a central processing module, a main memory, and at least one disk memory. The plurality of computing devices is operable to collectively execute query requests against at least one database table stored by the plurality of computing devices based on each node of each computing device performing corresponding operations independently from other nodes of the plurality of parallelized nodes.

A method includes storing, for each of a plurality of records of a dataset, values corresponding to a first subset of a plurality of fields of the dataset via a first storage mechanism. Values corresponding to a second subset of the plurality of fields are stored vis second storage mechanism that is different from the first storage mechanism based on a data type corresponding to the second subset of the plurality of fields. Execution of a query is facilitated by accessing, via the first storage mechanism, values of a first field included in the first subset of the plurality of fields, and by further accessing, via the second storage mechanism, values of a 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 first field and the values of the second field.

A method includes receiving a query expression indicating an expression evaluation for performance upon output of a filtering operator. An operator execution flow indicating performance of the filtering operator serially after the expression evaluation is generated, and execution of this operator execution flow is facilitated by generating an exception column indicating an exception value generated for each of a set of rows based on performing the expression evaluation. The filtering operator of the operator execution flow can be applied by identifying a subset of the set of rows that meet filtering parameters of the filtering operator. When the exception value of at least one row in the subset indicates an error condition, execution of the operator execution flow is aborted. When the exception value of every row in the subset indicates no error, the subset of the set of rows is outputted and execution of the operator execution flow continues.

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.

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.

A data input sub-system of a large scale application specific computing system receives a data set that includes a plurality of records, each with a plurality of data fields, and divides the data set into a plurality of data segments. The data input sub-system further restructures records of data segments based on a key field of the plurality of data fields to produce restructured data segments and generates storage instructions for storing the restructured data segments. A data storage and processing sub-system of the computing system interprets the storage instructions to determine resources to engage and stores the restructured data segments using engaged resources. A query and results sub-system of the computing system generates an initial query plan based on a data processing request, optimizes the initial query plan to produce an optimized query plan, and sends the optimized query plan to the data storage and processing sub-system for execution.

A method for execution by a record processing and storage system includes receiving a plurality of records and generating a plurality of pages that include the plurality of records in accordance with a row-based format. The plurality of pages is stored via a page storage system. Segment generation determination data is generated based on storage utilization data of the page storage system. A plurality of segments is generated from the plurality of pages that include the plurality of records in a column-based format based on the segment generation determination data indicating segments be generated. The plurality of segments is stored via a segment storage system.