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 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 includes receiving, by a first computing entity of a database system, a query request that is formatted in accordance with a generic query format. The method further includes generating, by the first computing entity, an initial query plan based on the query request and a query instruction set. The method further includes determining, by the first computing entity, storage parameters. The method further includes determining, by the first computing entity, processing resources for processing the query request based on the storage parameters. The method further includes generating, by the first computing entity, an optimized query plan from the initial query plan based on the storage parameters, the processing resources, and optimization tools. The method further includes sending, by the first computing entity, the optimized query plan to a second computing entity for distribution and execution of the optimized query plan.

Abstract: A computing device is operable to receive a plurality of partition allocation requests based on execution of a corresponding plurality of query operations in conjunction with execution of a corresponding query. Processing a first partition allocation request of the plurality of partition allocation requests corresponding to execution of a first operation of the corresponding plurality of query operations is based on allocating a set of partitions of a plurality of partitions. Content is loaded into the set of partitions for access in executing the first operation. Access to the content via the set of partitions is facilitated in conjunction with execution of the first operation. The set of partitions are released based on determining the first operation has completed access of the content in conjunction with the execution of the first operation.

Abstract: A database system is operable to generate query output based on executing a plurality of operators of a query operator execution flow for a query. Executing each operator can include generating a set of output query rows based on processing a set of input query rows, maintaining execution tracking data for the each operator that includes at least one counter tracking at least one event type, and generating a set of execution tracking rows based on sampling the execution tracking data. The query output includes a final set of rows corresponding to a query resultant and a final set of execution tracking rows generated by at least one final operator based on an aggregation of a plurality of sets of execution tracking rows generated by the plurality of operators.

Abstract: A large highly parallel database management system includes thousands of nodes storing huge volume of data. The database management system includes multiple query optimizers for determining low cost execution plans for queries. The database management system is adapted to receive a data query. An execution plan generator component of the database management system generates an initial execution plan for the query. The initial execution plan is fed as input to more than one query optimizers. Each optimizer starts with the initial execution plan, generates alternative execution plans, and determines a satisfactory execution plan that incurs the lowest cost. The database management system compares the selected execution plans by the optimizers and selects one with the lowest cost. The multiple query optimizers run in parallel.

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 networked database management system (DBMS) is disclosed. In particular, the disclosed DBMS includes a plurality of nodes, one of which is elected as a designated leader. The designated leader is elected using a consensus algorithm, such as tabulated random votes, RAFT or PAXOS. The designated leader is responsible for managing open coding lines, and determining when to close an open coding line.

Abstract: A computing entity is operable to a data set for storage that includes a plurality of uncompressed data slabs. A storage data set that includes a plurality of compressed data slabs is created based on the data set, and the storage data set is stored via a plurality of computing devices. 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, and each compressed data slab is generated to include compressed data and compression information. The compressed data is generated based on determining non-null ones of the plurality of values of the at least one corresponding uncompressed data slab. The compression information is generated based on positions of the non-null ones of the plurality of values in accordance with a serialized value ordering.

Abstract: A computing system is operable to generate a first plurality of lines of coding blocks that includes a first plurality of data blocks and a first plurality of parity blocks. A first set of segments of a first segment group that collectively include the first plurality of lines of coding blocks are generated, and the first set of segments of the first segment group are stored via a first plurality of computing devices of a first storage cluster of the computing system. A second plurality of lines of coding blocks that includes a second plurality of data blocks and a second plurality of parity blocks are generated. A second set of segments of a second segment group that collectively include the second plurality of lines of coding blocks are generated. The second set of segments of the second segment group are stored via a second plurality of computing devices of a second storage cluster of the computing system.

Abstract: A record processing and storage system is operable to receive a set of records for storage. The set of records are included in a plurality of pages stored by a page storage system, and each page of the plurality of pages includes a plurality of records in the set of records. Key value-based record distribution data is generated for the set of records based on a plurality of cluster key values of the set of records. A cluster key domain spanned by the plurality of cluster key values is divided into a plurality of key space sub-intervals based on the key value-based record distribution data. The set of records are segregated into a plurality of row subsets corresponding to the plurality of key space sub-intervals. A plurality sets of segments are generated by processing the plurality of row subsets in parallel.

Abstract: A node of a database system is operable to determine, at a first time, to prepare for a shutdown. The shutdown of the node is performed at a second time that is a period of time after the first time based on the node delaying the shutdown until a plurality of currently running processes being run by the node that initiated prior to the first time are determined to be complete. During the period of time after the first time and prior to performing the shutdown, a set of new processing requests are rejected by the node.

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

Abstract: A database system is operable to determine a set of segments that include a set of rows required to execute at least one query. At least one virtual segment in the set of segments is determined. At least two data portions in a first segment of the at least one virtual segment are identified. A locally rebuilt set of rows for the at least two data portions is generated based on retrieving at least two corresponding data portions of at least one other segment from storage and rebuilding at least two data portions utilizing the retrieved at least two corresponding data portions. 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 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 node of a computing system includes a main memory and a plurality of processing core resources. 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 method includes obtaining a plurality of data partitions of a data set for storage in a database system. The method further includes determining a first data storage coding scheme for a first partition of the plurality of data partitions, where the first data storage coding scheme includes first encoding parameters regarding encoding the first partition into first data segments and first parity segments. The method further includes determining a second data storage coding scheme for a second partition of the plurality of data partitions. The method further includes dividing the first partition to produce a first number of first raw data segments, where the first number is based on the first data storage coding scheme. The method further includes dividing the second partition to produce a second number of second raw data segments, where the second number is based on the second data storage coding scheme.

Abstract: A method by one or more processing units of a database management system includes determining to transition a collection of data from storage in a set of first temperature storage nodes to storage in a set of second temperature nodes based on one or more criteria associated with the collection of data, where each first temperature storage node of the set of first temperature storage nodes is paired with a corresponding second temperature storage node of the set of second temperature storage nodes to form a set of parallel node pairs. The method further includes transitioning storage of the collection of data in parallel, by each parallel node pair of the set of parallel node pairs, from storage in the set of first temperature storage nodes to storage in the set of second temperature storage nodes.

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.