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

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

Abstract: A record processing and storage system is operable to receive a plurality of labeled row data from a data source. Each labeled row data of the plurality of labeled row data includes at least one record and a corresponding row number of a plurality of row numbers. A plurality of pages are generated from records included in the labeled row data. The plurality of pages are stored via a page storage system. A plurality of page metadata corresponding to the plurality of pages is generated, where each of the plurality of page metadata is generated based on at least corresponding one row number of at least one labeled row data with records included in a corresponding one of the plurality of pages. Deduplication of duplicated records included the plurality of pages is facilitated based on the plurality of page metadata.

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 query processing system operates by determining a set of query rules, receiving a query from a requesting entity, and generating compliance data by determining whether the query complies with the set of query rules prior to an execution of the query. When the compliance data indicates the query complies with the set of query rules: generating a query result by facilitating the execution of the query against a database system; and transmitting the query result to the requesting entity. When the compliance data indicates the query does not comply with the set of query rules: foregoing facilitation of the execution of the query.

Abstract: A database system operates by determining a query operator execution flow that includes a negation of a logical connective indicating a first column of a plurality of rows in a first operand of the logical connective and indicating a second column of the plurality of rows in a second operand of the logical connective; and facilitating execution of the negation of the logical connective of the query operator execution flow against the plurality of rows utilizing first and second index data of a probabilistic indexing scheme on first and second columns of the plurality of rows.

Abstract: A record processing and storage system operates by: generating a set of pages from a plurality of row data via a plurality of processing core resources, wherein each processing core resource in the plurality of processing core resources generate a corresponding subset of the set of pages, independently from and in parallel with processing of other subsets of the set of pages via other ones of the plurality of processing core resources; facilitating performance of a single storage transaction to store the set of pages; identifying a page set interval based on a plurality of row number intervals of the set of pages; generating, based on completing the single storage transaction, row durability data indicating a least favorably ordered row number of a plurality of row numbers corresponding to the plurality of row data; and transmitting the row durability data to a computing device associated with the plurality of row data.

Abstract: A database system operates by facilitating execution of a query, where each of a plurality of sequential operator execution steps includes: determining whether each operator of a plurality of operators of a query operator execution flow is currently executable; generating a plurality of priority values by calculating a priority value for each operator based on whether each operator is determined to be currently executable, and based on a position value of each operator; identifying one operator of with a most favorable priority value; facilitating execution of the one operator on a queued set of data blocks to generate at least one output data block; identifying a next operator serially positioned consecutively after the one operator; and appending the at least one output data block to another queued set of data blocks of the next operator.

Abstract: A method includes determining, in accordance with a first ordering, a plurality of read requests for a memory device. The plurality of read requests are added to a memory device queue for the memory device in accordance with the first ordering. The plurality of read requests in the memory device queue are processed, in accordance with a second ordering that is different from the first ordering, to determine read data for each of the plurality of read requests. The read data for the each of the plurality of read requests is added one of a set of ordered positions, based on the first ordering, of a ring buffer as the each of the plurality of reads requests is processed. The read data of a subset of the plurality of read requests is submitted based on adding the read data to a first ordered position of the set of ordered positions of the ring buffer.

Abstract: A node includes a plurality of processing core resources. Each processing core resource of the plurality of processing core resources includes a corresponding processing module, a corresponding memory interface module, a corresponding memory device, and a corresponding cache memory. The plurality of processing core resources of the node is operable to collectively perform corresponding operations of the node. Each processing core resource of the plurality of processing core resources of the node is operable to perform operations independently from other ones of the plurality of processing core resources of the node.

Abstract: A method includes determining a query request corresponding to a requesting entity. Query cost data is generated for the query request. Minimum query cost compliance data is generated for the query request based on the query cost data. A query result is for the query request is determined based on execution of the query request against a database system and the query result is transmitted to the requesting entity when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule.

Abstract: A query processing system is operable to determining a query pricing scheme and receive a query request from a requesting entity that indicates at least one query function for execution against a database system. Query cost data is generated based on the at least one query function by utilizing the query pricing scheme. The query cost data is transmitted to the requesting entity.

Abstract: A node of a database system is operable to receive a plurality of data blocks. Based on backlog detection data, at least one feedback data block is generated to be sent to the set of source nodes. Feedback relay node selection data selecting at least one of the plurality of nodes in the database system for facilitating routing of the at least one feedback data block from the node to at least one of the set of source nodes via a prioritized feedback communication mechanism is generated. 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 of the plurality of nodes facilitates routing of the at least one feedback data block from the node via the prioritized feedback communication mechanism.

Abstract: A database system operates by: receiving a plurality of row data associated with a first data source; identifying a subset of row data from the plurality of row data that includes only ones of the plurality of row data that compare favorably to maintained row durability data; generating at least one page from ones of the plurality of row data included in the subset of row data; storing the at least one page in long term storage; generating updated row durability data indicating a least favorably ordered row number of a plurality of row numbers corresponding to the subset of row data based on storing the at least one page in long term storage; and updating the maintained row durability data to indicate the least favorably ordered row number of the updated row durability data.

Abstract: A database system is operable to determine a request to implement a K Nearest Neighbors (KNN) algorithm to generate classification data for a set of new records. A query operator execution flow is determined for the request that includes a KNN-join operator. A query resultant that indicates classification data for the set of new records is generated by performing a plurality of operator executions in accordance with the query operator execution flow based on, for each record of the set of new records, generating a plurality of similarity measures by performing a similarity function on the each record and each of a set of previously-classified records; identifying a proper subset of the set of previously-classified records that includes exactly a predefined number of records; and joining the each record with the proper subset of the set of previously-classified records.

Abstract: A database system is operable to determine a query for execution that requires access to a set of records stored by the database system. A first proper subset of the set of records are accessed in conjunction with executing the query by reading exactly one of a set of multiple replicas of each record of the first proper subset of the set of records from the replication-based storage system. A second proper subset of the set of records are accessed in conjunction with executing the query by reading at least one redundancy-coded segment from the redundancy-coding based storage system. A final resultant for the query is generated by performing at least one query operation on the first proper subset of the set of records and the second proper subset of the set of records in conjunction with executing the query.

Abstract: A computing device of a database system includes a plurality of processing modules, a computing device operating system, and an application specific operating system. The application specific operating system includes at least one custom instruction set that configures operation of a configurable set of processing modules of the plurality of processing modules based on generating, for each processing module of the configurable set of processing modules, a corresponding configuration signal indicating a selected instruction set of either the computing device operating system or the application specific operating system. Each processing module of the configurable set of processing modules operates in accordance with the selected instruction set based on the corresponding configuration signal.

Abstract: A method includes generating a predictive model mapping batch size to estimated memory utilization based on a plurality of prior batch sizes applied for performing a corresponding plurality of prior data format conversions, and further based on a plurality of prior actual memory utilization occurring in performing the corresponding plurality of prior data format conversions. A next batch size is automatically selected for performance of a subsequent data format conversion based on the predictive model and a current memory availability. A batch of data for performance of the subsequent data format conversion is identified based on the batch of data having the next batch size. The subsequent data format conversion is performed the batch of data, and an actual amount of memory utilized in performing the subsequent data format conversion is determined. The predictive model is updated based on the next batch size and the actual amount of memory utilized.

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.