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 data processing system is operable to determining a query for execution and generate a query operator execution flow for the query that includes a first at least one operator serially before a second at least one operator. The first at least one operator of the query operator execution flow is executed based on generating a request for rows in accordance with an object storage communication protocol indicating filtering parameter data parameter, sending the request to an object storage system, and receiving a response indicating a filtered row set from the object storage system. The second at least one operator of the query operator execution flow is executed based on processing the filtered row set indicated in the response in accordance with the second at least one operator to produce the query resultant.

Abstract: A database system operates by: determining a first query that indicates a first request to generate a K nearest neighbors (KNN) model; executing the first query to generate KNN model data for the KNN model, wherein the KNN model data is set as a reduced dataset for one of a plurality of training iterations; determining a second query that indicates a second request to apply the KNN model to input data; and executing the second query to generate model output of the KNN model for the input data based on, for each row in the input data, identifying a classification label for the each row from the discrete set of labels based on performing the KNN classification algorithm to classify the each row in the input data by applying the reduced data set.

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 determine a query for execution against at least one relational database table and executing the query. Executing the query is based on identifying a plurality of required binomial coefficient values required for generating a set of output values for the query. The plurality of required binomial coefficient values are precomputed and stored in cache memory resources. Generating each output value of the set of output values is based on identifying a subset of the plurality of required binomial coefficient values for generating the each output value, and accessing the subset of the plurality of required binomial coefficient value in the cache memory resources. Each output value is generated as a function of the subset of the plurality of required binomial coefficient values.

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 execute a row dispersal operator, in conjunction with execution of a query operator execution flow for a corresponding query, to disperse a plurality of input rows across the set of parallelized operations based on determining a plurality of input data blocks that collectively includes the plurality of input rows, where each input data block in the plurality of input data blocks a corresponding proper subset of the plurality of input rows. Each data block of the plurality of input data blocks is assigned to a corresponding one of the set of parallelized operations for processing in accordance with a uniform assignment scheme, and each data block is forwarded to the corresponding one of the set of parallelized operations by reference.

Abstract: A user device is operable to determine a query request based on first user input to a graphical user interface displayed by the user device. Query cost data is determined based on the query request. A prompt is displayed via the graphical user interface that indicates the query cost data. Query approval data is determined based on second user input to the graphical user interface in response to the prompt. The query request is transmitted to an analytics system for execution against a database system when the query approval data indicates approval to transmit the query request.

Abstract: A transfer segment group task processing module of a database system is operable to send a first begin segment group transfer instruction to a first storage cluster based on a determination to transfer a set of segments stored via the first storage cluster to a second storage cluster. A target first ownership sequence number is received from the first storage cluster. A second begin segment group transfer instruction to the second storage cluster. A transfer complete notification is received from the second storage cluster. A complete storage instruction is sent to the second storage cluster. An updated second ownership sequence number is received from the second storage cluster indicating updating of second data ownership information of the second storage cluster. A commit transfer instruction is sent to the first storage cluster based on updated second ownership sequence number received from the second storage cluster.

Abstract: A record processing and storage system is operable to generating a set of pages that includes corresponding records included in a plurality of row data via a plurality of processing resources based on each processing resource in the plurality of processing resources generating a corresponding subset of the set of pages. A single storage transaction is performed to store the set of pages based on writing the corresponding records included in the ones of the plurality of row data to a page storage system. 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 is generated and transmitted to a computing device.

Abstract: A database system is operable to generate an IO pipeline that includes a primary cluster key pipeline element serially after a secondary index pipeline element. The IO pipeline is executed based on applying the secondary index pipeline element of the IO pipeline to generate row list output, and applying the primary cluster key pipeline element to determine a first set of row ranges, determine a second set of row ranges of row list output generated by the secondary index pipeline element, and generate, from the first set of row ranges and the second set of row ranges, a result set having a plurality of outputs, each indicating a cluster key and a row range for the cluster key.

Abstract: A database system is operable to assign a first node as a task monitoring node for a task and assign a second node as a task execution node for the task. The task is executed via the first node and the second node based on the first node sending a plurality of polls to the second node, the second node initiating execution of the task based on one of the plurality of polls, the second node sending a plurality of task status data to the first node, the first node maintaining current task status data for the task a shared metadata state based on the plurality of task status data, the second node completing execution of the task and caching task results in memory resources, the first node receiving the task results from the second node; and the second node removing the task results from the memory resources.

Abstract: A node of a database system is operable to execute a shuffle operator based on, during a first temporal period, reserving a first amount of memory, allocating, to each of a plurality of other nodes, a corresponding number of fixed-memory units based on the first amount of memory, and process first data received from the plurality of other nodes in accordance with the corresponding number of fixed-memory units allocated to the each of the plurality of other nodes. During a second temporal period after the first temporal period, the first amount of memory is updated to a second amount of memory based on comparing an available amount of memory with a configured memory threshold, an updated corresponding number of fixed-memory units is re-allocated, and second data received from the plurality of other nodes in accordance with the corresponding number of fixed-memory units is processed.

Abstract: A record processing and storage system is operable to generate data source assignment data by segregating a plurality of data sources into a plurality of data source sets mapped to a corresponding plurality of storage clusters of the record processing and storage system. For each of the plurality of storage clusters, a corresponding subset of a plurality of pages is generated to include only ones of a plurality of records received from data sources included in a corresponding one of the plurality of data source sets, and the corresponding subset of the plurality of pages via storage resources of the each of the plurality of storage clusters. For each of the plurality of storage clusters, deduplication of each page included in the corresponding subset of the plurality of pages is facilitated based on metadata comparisons with other pages included in the corresponding subset of the plurality of pages.

Abstract: A storage system is operable to transition from operation in accordance with a first storage scheme to operation in accordance with a second storage scheme by, for each storage device of the plurality of storage devices, expanding a storage size of a single storage structure of the corresponding plurality of data storage structures identified to implement the second storage scheme from an initial size to a final size consuming full storage resources of the each storage device based on writing all new data of a plurality of write requests to the single storage structure in accordance with the second storage scheme, performing at least one expansion of the single storage structure within the each storage device in response to an expansion condition being met, and completing transition based on the single storage structure reaching the final size consuming the full storage resources of the each storage device.

Abstract: A database system is operable to maintain lock state data that includes a mapping of a plurality of lock state structures to a plurality of lock scope identifiers. Each of the plurality of lock state structures maintains a set of lock requests based on storing a queue of pending lock requests and a set of granted lock requests. A lock management function is executed to update the lock state data for one of the plurality of lock state structures. In response to executing the lock management function, an evaluation function is executed to further update the one of the plurality of lock state structures based on moving at least one lock request from the front of the queue of pending lock requests to the set of granted lock requests based on determining to move the at least one lock request.

Abstract: A database system operates by: generating first segment addendum data indicating at least one addendum part indicating at least one change to a first segment of a plurality of segments, updating segment part activation data to indicate a first ownership sequence number (OSN) range for activation of the first segment addendum data during query execution, executing a first query, having a first ownership sequence number, based on accessing the first segment in response to first data ownership information tagged with the first ownership sequence number indicating activation of the first segment, and further based on foregoing applying of the at least one addendum part for the first segment in response to the first ownership sequence number falling outside of the first OSN range indicated in the segment part activation data for the first segment addendum data, and executing a second query, having a second ownership sequence number, based on accessing the first segment in response to second data ownership informat

Abstract: A database system is operable to generate an addendum part indicating deletion of a set of rows of a plurality of rows of a dataset based on generating a row list based on identifying the set of rows for deletion from the dataset and compressing the row list in a set of compressed blocks written to disk memory resources. Based on determining to process the addendum part, the addendum part is read based on decompressing the row list based on access in the set of compressed block in the disk memory resources and emitting the row list for processing.

Abstract: A database system is operable to execute a query based on, during a first temporal period, executing a multiplexer operation in conjunction with a first mode of operation to generate a first plurality of multiplexer output, and executing a load operation upon the first plurality of multiplexer output to generate initial load operation output from the first plurality of multiplexer output. In response to a determination to transition to execution of the multiplexer operation in conjunction with a second mode of operation, the multiplexer operation is further executed in conjunction with the second mode of operation during a second temporal period to generate a second plurality of multiplexer output for processing via the load operation. The load operation is further executed upon the second plurality of multiplexer output to generate further load operation output.

Abstract: A database system operates by: executing a query against a relational database table indicating a predicate applied to geospatial data of a geospatial data column, based on: applying an inner predicate to internal level nodes when traversing a set of internal levels of the each tree-based index structure to identify a first subset of leaf nodes in a plurality of leaf nodes of the each tree-based index structure based on identifying internal nodes having internal node bounding boxes meeting the inner predicate; and applying a leaf predicate to only leaf nodes included in the first subset of leaf nodes of the tree-based index structure to identify a second subset of leaf nodes of the first subset of leaf nodes corresponding to only leaf nodes of the first subset of leaf nodes having corresponding leaf node bounding boxes meeting the leaf predicate; wherein a query resultant of the query is generated based on geospatial objects of the geospatial data column for ones of a plurality of rows of the relational datab