Ocient Inc.

Ocient Holdings LLC

Other

Joseph Jablonski

George Kondiles

S Christopher Gladwin

Rhett Colin Starr

Jason Arnold

Andrew D Baptist

Daniel Coombs

Greg R Dhuse

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.

Query execution via communication with an object storage system via an object storage communication protocol

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 method for execution by one or more database storage nodes of a database management system includes obtaining a row of data that includes a plurality of columns. The method further includes generating a data confidence value for data within one or more columns of the plurality of columns. The method further includes storing the data confidence value in a memory of the database management system.

Confidence-based database management systems and methods for use therewith

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.

Database system with coding cluster and methods for use therewith

A payload store within a database management system includes a first set of nodes that include a first node that includes a memory, a network interface, a storage device, and a processing unit. The processing unit receives, via the network interface, a first portion of data to be stored in a plurality of storage devices of the first set of nodes, and splits the first portion into a first set of data rows that includes a plurality of subsets of data rows and a last subset of data rows. The processing unit further randomly assigns the plurality of subsets of data rows and the last subset of data rows between the first set of nodes and stores a first number of data rows in the storage device. The processing unit further sends, via the network interface, a second number of data rows to the second node for storage therein.

Randomized data distribution in highly parallel database management 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 method for execution by a computer of a database management system includes obtaining a dataset that includes a set of data records, where the data set is associated with a set of data characteristics. The method further includes ranking analytical calculations of a list of analytical calculations that are able to be executed on the dataset based on the set of data characteristics and a set of analytical calculation characteristics associated with the list of analytical calculations to produce a ranked list of analytical calculations. The method further includes selecting an analytical calculation from the ranked list of analytical calculations based on the ranking. The method further includes executing the selected analytical calculation on the dataset to produce an analytical calculation result.

Efficient database management system and method for use therewith

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

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.

Data transition in highly parallel database management system

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

Database management system with coding cluster and methods for use therewith

A method for managing data storage and retrieval and operated within a database management system includes retrieving a set of confidence data records from memory of the database management system, where a confidence data record of the set of confidence data records includes a set of data columns and one or more confidence columns populated with one or more data confidence values associated with data within one or more data columns of the set of data columns. The method further includes analyzing the set of confidence data records to produce a result, where the result includes a confidence level that is based on corresponding ones of the one or more data confidence values associated with the data within one or more data columns of the set of data columns.

Database management systems for managing data with data confidence

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

Joseph Jablonski