Abstract: A query processing system operates by determining a query pricing 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 transmitting the query cost data to the requesting entity.

Abstract: A method for execution by at least one processor of a database system includes storing a plurality of column values for a first column of a plurality of rows. Each of a set of missing data-based conditions for the first column are indexed via an indexing scheme. A subset of the set of missing data-based conditions that satisfy a query predicate of a query are identified. An IO pipeline for access of the first column based on the query predicate and further based on the subset of the set of missing data-based conditions is generated. The IO pipeline is applied in conjunction with execution of the query by applying at least one index element to identify a proper subset of the plurality of rows based on index data of the indexing scheme, and by generating a query resultant based on the proper subset.

Abstract: A computing device comprises a plurality of nodes and a plurality of operating system layers. The plurality of operating system layers includes a local database operating system and a sub-system database operating system. The plurality of nodes utilize the local database operating system to execute at least one database operation independently of other ones of the plurality of nodes. The computing device utilizes the sub-system database operating system in conjunction with other ones of a plurality of computing devices of at least one sub-system to facilitate execution of at least one sub-system operation of the at least one sub-system.

Abstract: A method includes receiving a proper subset of messages of a plurality of incoming messages with keys included in a corresponding subset of a plurality of possible keys assigned to the feed receiver module in key assignment data. Messages of the proper subset of messages are maintained. 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 feed receiver module is assigned as an owner in the key assignment data, are identified. Only the owned ones of the proper subset of messages are emitted.

Abstract: A method includes determining a query expression indicating a query for execution against a plurality of rows. A superset-guaranteeing expression is generated in conjunctive normal form (CNF) based on the query expression. A query operator execution flow is generated to include a plurality of index-based IO operators based on the superset-guaranteeing expression and to further include at least one additional operator. Execution of the query is facilitated by applying the plurality of index-based IO operators to identify a first subset of rows as a proper subset of the plurality of rows based on index data stored of the plurality of rows, and by applying the at least one additional operator to the first subset of rows to identify a second subset of rows as a subset of the first subset of rows.

Abstract: A method for execution by a query processing module includes determining a query expression indicating a query for execution. An operator tree is generated based on a nested ordering of a plurality of operators indicated by the query expression. Conjunctive normal form (CNF) conversion cost data is generated based on the operator tree, and disjunctive normal form (DNF) conversion cost data is also generated based on the operator tree. Conversion selection data is generated based on the CNF conversion cost data and the DNF conversion cost data. The conversion selection data indicates a selection to perform either a CNF conversion or a DNF conversion. A normalized query expression is generated by performing either the CNF conversion or the DNF conversion upon the query expression based on the conversion selection data. Execution of the query is facilitated in accordance with the normalized query expression.

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.

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.

Abstract: 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.

Abstract: 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.

Abstract: A method includes generating array field distribution data for an array field of a dataset. A query expression for execution that includes a query predicate indicating the array field of the dataset is received. The array field distribution data for the array field is utilized to generate query plan data for the query expression based on the query expression including the query predicate indicating the array field. Execution of the query expression is facilitated in accordance with the query plan data.

Abstract: 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.

Abstract: A method for execution by at least one processor of a database system includes indexing a first column via a probabilistic indexing scheme. An IO pipeline that includes a probabilistic index-based IO construct for access of the first column is determined based on a query including a query predicate indicating the first column. The probabilistic index-based IO construct is applied in conjunction with execution of the query via the IO pipeline by applying an index element of the probabilistic index-based IO construct to identify a first subset of rows based on index data of the probabilistic indexing scheme for the first column. A filter element of the probabilistic index-based IO construct is applied to identify ones of a first subset of the plurality of column values corresponding to the first subset of rows that compare favorably to the query predicate.

Abstract: 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.

Abstract: 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.

Abstract: A database system is operable to generate a plurality of segment row data from a plurality of records received for storage. The plurality of segment row data is stored via a first storage mechanism corresponding to a first durability level. Storage of the plurality of segment row data via a second storage mechanism corresponding to a second durability level that is more durable than the first durability level is facilitated. Execution of a plurality of queries against the dataset is facilitated by accessing the plurality of segment row data via the first storage mechanism. A failure of storage of one of the plurality of segment row data via the first storage mechanism is detected. The one of the plurality of segment row data is recovered for storage via the first storage mechanism based on accessing at least one of the plurality of segment row data via the second storage mechanism.

Abstract: 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.

Abstract: 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.

Abstract: A method for execution by a node includes determining first level assignment information indicating assignment to a first subset of levels of a plurality of levels and determining second level assignment information indicating assignment to a second subset of levels of the plurality of levels. The second level assignment information indicates a second compute sequence number that is different from a first compute sequence number indicated by the first level assignment information. A query indicating the first compute sequence number is determined for execution. Execution of at least one query operator of the query is performed in accordance with a level included in the first subset of levels based on determining to utilize the first level assignment information based on the query indicating the first compute sequence number.

Abstract: A method includes determining a query for execution against a dataset that includes a plurality of records, where values of the plurality of records corresponding to a first subset of the plurality of fields are stored via a first storage mechanism, and values of the plurality of records corresponding to a second subset of the plurality of fields are stored via a second storage mechanism. Execution of the query is facilitated by accessing, via the first storage mechanism, values of at least one first field included in the first subset of the plurality of fields and accessing, via the second storage mechanism, values of at least one 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 at least one first field and the values of the at least one second field.