Ocient Holdings LLC

Daniel Coombs

George Kondiles

Andrew D Baptist

S Christopher Gladwin

Jason Arnold

Joseph Jablonski

Greg R Dhuse

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.

Implementing different secondary indexing schemes for different segments stored via a database system

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.

Data stream processing system and methods for use therewith

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.

Generating classification data via a query processing system

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.

Routing feedback data blocks via a prioritized feedback communication mechanism

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.

Locally rebuilding rows for query execution via a database system

A database system is operable to initiate execution of a query via a subset of a plurality of nodes. After initiating the execution of the query, failure detection data is generated indicating a first node included in the subset of the plurality of nodes based on determining execution condition data for the first node compares unfavorably to node execution condition requirements. Node reassignment data is generated based on the failure detection data by assigning a new node in the plurality of nodes to replace the first node in the query execution plan for a remainder of the execution of the query. A resultant is generated for the query in accordance with completion of the execution of the query, where at least a portion of the execution of the query is performed via the new node.

Reassignment of nodes during query execution

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.

Accessing both replication based storage and redundancy coding based storage for query execution

Generating key assignment data for message processing

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.

Processing queries based on rebuilding portions of virtual segments

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.

Utilizing a prioritized feedback communication mechanism based on backlog detection data

A processing system of a node is operable to determine a query for execution and determine a set of segments that each include a corresponding set of rows required to execute the query. A first segment of the set of segments is determined to be processed as a virtual segment. A locally rebuilt set of rows corresponding to the first segment is generated by utilizing a recovery scheme based on determining the first segment is to be processed as a virtual segment. Execution of the query is facilitated by utilizing the locally rebuilt set of rows.

Query execution via virtual segments

A database system operates by: receiving a user-generated secondary indexing hint data for a dataset from a client device, wherein the client device generated the user-generated hint data based on user input in response to at least one prompt displayed by an interactive interface displayed via a display device of the client device; generating a plurality of segments that each include distinct subsets of a plurality of rows of a dataset; automatically selecting, for each of the plurality of segments, a secondary indexing scheme from a plurality of secondary indexing options based on the user-provided secondary indexing hint data; generating a plurality of secondary indexes for each of the plurality of segments in accordance with the corresponding secondary indexing scheme; and storing the plurality of segments and the plurality of secondary indexes in memory.

Per-segment secondary indexing in database systems

A node is operable to determine to send at least on data block to a destination node. A second relay node of an initial route that includes exactly a predefined number of relay nodes for relaying at least one data block from the node to a destination node is identified. A set of intermediate node options is identified by identifying nodes of the database system capable of receiving the at least one data block from the node and further capable of sending the at least one data block to the second relay node. Intermediate node selection data is generated by selecting one intermediate node from the set of intermediate node options. The at least one data block is transmitted from the node to the one intermediate node via the first direct connection to facilitate sending of the at least one data block from the node to the destination node.

Dynamic data block routing via a database system

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.

Utilizing key assignment data for message processing

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.

Growing community of inventors

Chicago, IL, United States of America

Daniel Coombs