Ocient Holdings LLC

Ocient Inc.

Other

Oclient Inc.

George Kondiles

Jason Arnold

S Christopher Gladwin

Joseph Jablonski

Andrew D Baptist

Daniel Coombs

Rhett Colin Starr

Anna Veselova

Ravi V Khadiwala

Donald Scott Clark

Finley Jordan Lau

Natalia Marie Jenuwine

Andrew Michael Bass

Greg R Dhuse

Susmita Saha

Alyssa Catherine Wagenmaker

Ellis Mihalko Saupe

Richard George Wendel, Iii

Jacob Walker Trueb

Philip Joseph Dakin

Dave Boutcher

Alexander Neben

Sarah Kate Schieferstein

Samuel Peter Bove

Andrew Park

Gregory A Papadopoulos

Hassan Farahani

David Charles Boutcher

Pieter Charles Jas Svenson

Johannes Altmanninger

Ryan Joseph Kluzinski

Pavel Yusim

Kevin Garner

A database system operates by: determining a query pricing scheme; receiving a query request from a requesting entity that indicates at least one query function for execution against a database system; determining a power consumption value based on the at least one query function; generating query cost data based on the at least one query function by utilizing the query pricing scheme based on the power consumption value; and transmitting the query cost data to the requesting entity.

Generating query cost data based on power and at least one query function of a query request

A database system is operable to determine to generate a segment rebuild plan for rebuilding a first segment based on accessing first segment metadata for the first segment. A plurality of replicated part location data is determined for a plurality of parts of the first segment based on processing the first segment metadata and based on applying a deterministic segment part replica dispersal algorithm previously utilized to store the segment group. Nodes of the database system storing a corresponding plurality of sibling parts required to rebuild the plurality of parts of the first segment are determined based on the plurality of replicated part location data and based on storage location-to-node mapping data. The first segment is rebuilt based on applying the segment rebuild plan.

Generating a segment rebuild plan via a node of a database system

A record processing and storage system operates by: receiving formatted row data that includes a fixed-length batch section and a temporary variable-length batch section; storing, in a compressed data format, at least one variable-length data value of each of a plurality of temporary variable-length row sections of each of the plurality of formatted row data; generating a plurality of modified formatted row data from the plurality of formatted row data by, for each formatted row data, replacing a fixed-length offset value for each variable-length field stored in the compressed data format with a key value utilized to access the corresponding variable-length data value in the compressed data format; and truncating the each formatted row data to remove inclusion of the temporary variable-length batch section; and storing the plurality of modified formatted row data as a plurality of pages in a page storage system.

Processing formatted record data with fixed and variable lengths

A database system operates by: determining a query request corresponding to a requesting entity; generating potential query cost data based on query cost data for the query request including power consumption and further based on running query cost data for at least one previous query request corresponding to the requesting entity; generating minimum query cost compliance data for the query request based on determining whether the potential query cost data complies with a minimum query cost rule; when the minimum query cost compliance data indicates the potential query cost data complies with the minimum query cost rule: determining a query result for the query request based on execution of the query request against a database system.

Generating query cost data for query requests based on power

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.

Creating compressed data slabs that each include compressed data and compression information for storage in a database system

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.

Executing of lock management functions to updating lock state data of a database system

A database system operates by: determining a query pricing scheme, wherein the query pricing scheme indicates a record valuation scheme; receiving a query request from a requesting entity that indicates access to a subset of a plurality of records in a database system; generating query cost data based on the subset of the plurality of records by utilizing the query pricing scheme and a power consumption, wherein generating the query cost data includes: calculating plurality of record valuations by calculating a record valuation for each of the plurality of records in the subset of the plurality of records, and aggregating over the plurality of record valuations to generate a query price total indicated in the query cost data; and transmitting the query cost data to the requesting entity.

Power based query processing system and methods for use therewith

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.

Allocating partitions for storing a data set for subsequent query execution

A method for execution, by a first intermediate node of a plurality of nodes in a database management system, includes processing a message that includes data that is being sent in accordance with a routing path from a source node to a destination node, is a first size, and indicates a next node of the routing path, wherein the first intermediate node is limited to communication with a subset of nodes of the plurality of nodes, and wherein the subset of nodes includes the next node. The method further includes maintaining a tracking table that indicates a total amount of data sent to each node of the subset of nodes during a first time period. The method further includes resetting the total amount of data sent to each of the subset of nodes to zero based one or more of a command and an initiation of a second time period.

System and method for optimal routing in a large database management system

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.

Enforcement of a minimum result set size rule for queries requested for execution against a database system

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

Utilizing query approval data determined based on query cost data for a query request

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.

Transfer of a set of segments between storage clusters of a database system

A record processing and storage system operates by: generating a set of pages from a plurality of row data via a plurality of processing core resources, wherein each processing core resource in the plurality of processing core resources generate a corresponding subset of the set of pages, independently from and in parallel with processing of other subsets of the set of pages via other ones of the plurality of processing core resources; facilitating performance of a single storage transaction to store the set of pages; identifying a page set interval based on a plurality of row number intervals of the set of pages; generating, 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; and transmitting the row durability data to a computing device associated with the plurality of row data.

Growing community of inventors

Chicago, IL, United States of America

George Kondiles