Abstract: A query processing system is operable to determine a set of query rules that includes a minimum result set size rule. A query is received from a requesting entity. A size of a result set of the query is determined. Compliance data is determined based on determining whether the size of the result set complies with the minimum result set size rule. When the compliance data indicates the size of the result set complies with the minimum result set size rule, a query result for the query is generated based on the result set, and the query result is generated to the requesting entity. When the compliance data indicates the size of the result set does not comply with the minimum result set size rule: transmission of the query result to the requesting entity is foregone.

Abstract: A database system is operable to determine a query expression that includes a call to a differentiation function, and execute the query expression based on determining an ordered set of input rows to the differentiation function based on accessing a corresponding plurality of relational database rows in at least one relational database table, and further based on generating an ordered set of output values as output of executing the differentiation function upon the ordered set of input rows based on performing a window function upon each row in the ordered set of input rows to return a differentiation output value for the each row as a function of a set of multiple consecutive rows in the ordered set of input rows that includes the each row.

Abstract: A data stream processing system is operable to generate key assignment data indicating assignment of each of a plurality of subsets of a plurality of possible keys to a plurality of feed receiver modules by assigning one owner feed receiver module of the plurality of feed receiver modules to each key of the plurality of possible keys for a plurality of incoming messages, and by further assigning a set of follower feed receiver modules of the plurality of feed receiver modules to the each key of the plurality of possible keys. The plurality of incoming messages are processed via the plurality of feed receiver modules based on the key assignment data.

Abstract: A database system is operable to generate a query operator execution flow for a query that includes a plurality of operators implementing a plurality of parallelized optimization processes configured to facilitate generating of a machine learning model. The query operator execution flow is executed in conjunction with executing the query based on executing the plurality of operators. Executing each of the plurality of parallelized optimization processes includes generating a corresponding set of candidate model coefficients of a plurality of sets of candidate model coefficients. A corresponding set of candidate model coefficients is based on processing the set of best positions generated via the second type of optimization algorithm. The machine learning model is generated in executing the query based on selection of a most favorable set of candidate model coefficients from a plurality of sets of candidate model coefficients outputted via the plurality of parallelized optimization processes.

Abstract: A database system is operable to read a plurality of rows from memory of a relational database stored in memory resources. Each of the plurality of rows are assigned to a corresponding one of a plurality of training data subsets of the plurality of rows based on performing a row dispersal process. A plurality of sets of candidate model coefficients are generated based on executing a plurality of parallelized optimization processes. Each set of candidate model coefficients is generated based on executing a corresponding parallelized optimization process upon a corresponding training data subset independently from executing other ones of the plurality of parallelized optimization processes upon other ones of the plurality of training data subsets. A most favorable set of candidate model coefficients is selected from the plurality of sets of candidate model coefficients generated via the plurality of parallelized optimization processes.

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

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 database system is operable to determine a plurality of queries for execution. Query data for each query of the plurality of queries is determined, where the query data for the each query indicates a memory usage estimate, an internal runtime estimate, and an external runtime estimate. Query initiation data is generated by determining whether to initiate execution of one query of the plurality of queries at a first temporal period occurring after initiating execution of a subset of the plurality of queries and occurs before the execution of the subset of the plurality of queries is complete, based on the query data of the one query. Execution of the one query is initiated when the query initiation data indicates a determination to initiate execution of the one query in the first temporal period.

Abstract: An analytics system is operable to receive a first plurality of query requests from a plurality of requesting entities. Query pricing scheme data is automatically generated based on the first plurality of query requests. A second plurality of query requests are received from the plurality of requesting entities. Query cost data is automatically generated for each of the second plurality of query requests by utilizing the query pricing scheme data. The query cost data for each of the second plurality of query requests is transmitted to a corresponding one of the plurality of requesting entities.

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 method for execution by a record processing and storage system includes assigning each of a plurality of key space sub-intervals of a cluster key domain to a corresponding one of a plurality of processing core resources, and generating a plurality of segments from the set of records via the plurality of processing core resources. Each processing core resource in the plurality of processing core resources generates a subset of the plurality of segments by identifying a proper subset of the set of records based on having cluster key values included in a corresponding one of the plurality of key space sub-intervals, and by generating the subset of the plurality of segments to include the proper subset of the set of records.

Abstract: A method includes determining a data set for storage that includes a plurality of uncompressed data slabs in accordance with a serialized data slab ordering. A storage data set that includes a plurality of compressed data slabs is created based on the data set in accordance with the serialized data slab ordering. Each compressed data slab of the plurality of compressed data slabs is generated from at least one corresponding uncompressed data slab of the plurality of uncompressed data slabs that includes a plurality of values based on generating compressed data for each compressed data slab based on the at least one corresponding uncompressed data slab, and generating compression information for each compressed data slab. The storage data set is stored via a plurality of computing devices.

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 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 determining a first set of query rules and receiving a query from a requesting entity. The first set of query rules is filtered to generate a proper subset of the first set of query rules by selecting only ones of the first set of query rules with parameter data comparing favorably to parameters of the query. Compliance data indicating whether the query complies with the first set of query rules is generated by determining whether the query complies with the proper subset of the first set of query rules. When the compliance data indicates the query complies with the first set of query rules, a query result is determined for the query and the query result is transmitted to the requesting entity. When the compliance data indicates the query does not comply with the first set of query rules, transmission of the query is foregone.

Abstract: A database system is operable to generate a first segment that includes a first subset of a plurality of rows. A first secondary indexing scheme for indexing the first segment is selected from a plurality of secondary indexing options, and first index data for the first segment is generated in accordance with the first secondary indexing scheme. A second segment is generated that includes a second subset of the plurality of rows. A second secondary indexing scheme for indexing the second segment is selected from the plurality of secondary indexing options, and second index data is generated for the second segment in accordance with the second secondary indexing scheme. Execution of a query is facilitated by utilizing the first index data and the second index data.

Abstract: A database system is operable to determine a query that includes a join expression for execution. A set of input rows are dispersed for processing via a plurality of parallelized join processes in conjunction with executing the join expression based on identifying a first proper subset of the set of input rows based on a null-handling strategy. First rows in the first proper subset are dispersed for processing across the plurality of parallelized join processes in accordance with the null-handling strategy. second rows in a set difference between the set of input rows and the first proper subset are dispersed across the plurality of parallelized join processes in accordance with a join key-based assignment strategy. The set of input rows are processed via the plurality of parallelized join processes.

Abstract: A method includes generating a plurality of pages from a plurality of records received from a plurality of data sources. Deduplication of the plurality of pages is facilitated based on a plurality of page metadata of the plurality of pages based on, for the each page of the plurality of pages. A filtered set of potentially-intersecting pages is identified for each given page as a proper subset of the plurality of pages stored in the page storage system based on first comparison parameters, and an intersecting set of pages that include a row number intersection with the given page is identified as a proper subset of the filtered set of potentially-intersecting pages based on second comparison parameters. Records with records with row numbers included in row number intersections with other pages in the intersecting set of pages are removed from the each page.

Abstract: A database system is operable to store a plurality of column values for a first column of a plurality of rows. A query having a query predicate indicating a negation of a condition for the first column based on a first value is executed. A first index element is applied to identify a first proper subset of the plurality of rows having values for the first column meeting the condition based on accessing index data. At least one second index element is applied to identify a second proper subset of the plurality of rows having values for the first column meeting at least one missing data-based condition based on accessing the index data. A set difference between the plurality of rows and a union of the first proper subset and the second proper subset is identified. A query resultant for the query is generated based on the set difference.