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

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 database system is operable to determine power usage policy data and generate operation requirement data based on the power usage policy data. A database operation is determined for execution, and an energy utilization-based operation limitation enforcement function is performed upon energy utilization-based operation restriction enforcement input data to generate energy utilization-based operation restriction enforcement data for the database operation based on applying the operation requirement data. The database operation is executed when the energy utilization-based operation restriction enforcement data indicates execution of the operation is allowed based on execution of the database operation adhering to the operation requirement data. Execution of database operation is foregone when the energy utilization-based operation restriction enforcement data indicates execution of the operation is disallowed based on execution of the database operation not adhering to the operation requirement data.

Abstract: A database system is operable to generate a query operation energy utilization estimation function based on historic energy utilization data and historic query operation execution data. A query is determined for execution and energy utilization estimation input data is determined for the query operation. The query operation energy utilization estimation function is performed upon the energy utilization estimation input data to generate energy utilization estimate data for the query operation. An energy efficiency strategy for the database system is applied based on the energy utilization estimate data generated for the query operation.

Abstract: A database system operates by storing a plurality of array field values for an array field of a plurality of rows and generating index data for the array field based on: indexing non-null element values of the plurality of array fields for the plurality of rows, indexing null-valued ones of the plurality of array fields for the plurality of rows, indexing ones of the plurality of array fields for the plurality of rows having an empty set of elements, and indexing ones of the plurality of fields for the plurality of rows having at least one null element value. Wherein the database system further operates by: determining a query including a query predicate indicating an array operation for the array field; and applying an IO pipeline in conjunction with execution of the query.

Abstract: A database system includes a plurality of computing devices. Each computing device includes a plurality of processing modules, a computing device operating system, and an application specific operating system. The computing device operating system includes a computing device operating system file system management instruction set. The application specific operating system includes at least one custom file system management instruction set operable to configure operation of a configurable set of processing modules of the plurality of processing modules based on generating a corresponding file system management configuration signal for each processing module of the configurable set of processing modules indicating a selected file system management instruction set of the computing device operating system or the application specific operating system.

Abstract: A node of a computing system includes a main memory and a plurality of processing core resources that each can adjust a power level. The main memory includes a computing device section and a database section. The computing device section includes a computing device operating system area and a computing device general area. The database section includes a database section that includes a database operating system area, a disk area, a network area, and a database general area. The database operating system area allocates at least one portion of the main memory for database operations that is locked from access by the computing device operating system area.

Abstract: A database system operates by: determining a query for execution against a dataset that indicates a filtering predicate denoting a disjunction between a first range-based predicate and a second range-based predicate; accessing distribution data for the dataset indicating a plurality of kernels for a plurality of points in a multi-dimensional space; identifying a first sub-region within the multi-dimensional space corresponding to the first range-based predicate; identifying a second sub-region within the multi-dimensional space corresponding to the second range-based predicate; computing a disjunction probability approximation value based on an average portion summation value across a plurality of portion summation values generated for the plurality of kernels; and executing the query based on the disjunction probability approximation value.

Abstract: A database system is operable to perform a power supply strategy selection function based on first energy utilization-based operation optimizer input data to generate first energy utilization-based power supply strategy data denoting, for each power supply type of a plurality of power supply types, a corresponding first proportion of power supply resources that be implemented as the each power supply type. A first set of power supply resources is selected to execute a first database operation based on the first energy utilization-based power supply strategy data. The first set of power supply resources are utilized to power a first set of computing devices to enable the first set of computing devices to participate in execution of the first database operation in accordance with the first energy utilization-based power supply strategy data.

Abstract: A database system operates by: determining a first query that indicates a first request to generate a K means model; executing the first query to generate K means model data for the K means model; determining a second query that indicates a second request to apply the K means model to input data; and executing the second query to generate model output of the K means model for the input data based on, for each row in the input data: determining a plurality of distances to the final set of centroids; and identifying a classification label for an identified one of the final set of centroids having a smallest one of the plurality of distances as the model output.