Ocient Holdings LLC

Richard George Wendel, Iii

Greg R Dhuse

Benjamin Daniel Rabe

George Kondiles

Anna Veselova

Matthew Ashbeck

Finley Jordan Lau

Andrew Michael Bass

Hassan Farahani

Johannes Altmanninger

A processing module of a database system is operable to determining a query for execution. A plurality of row sets are processed over a temporal period in conjunction with execution of the query based on automatically selecting a requested number of rows to be included in each row set based on row scheduling parameters, generating a scheduling request for the requested number of rows, and receiving each row set for processing in response to the scheduling request via access to one segment of a set of segments required for execution of the query. A query resultant for the query is generated based on processing of the plurality of row sets, and further based on processing of an additional plurality of rows included in the set of segments via a set of other processing modules implemented in parallel with the processing module.

Query execution via scheduling segment chunks for parallelized processing based on requested number of rows

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 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 method includes performing a search of an inverted index structure indexing values of a column to generate an in-range indexed value set by identifying all indexed values of the inverted index structure falling within a range corresponding to a range-based filter. A set of characteristics of the in-range indexed value set are identified based on performing the search of an inverted index structure. When the set of characteristics compare favorably to the set of index-usage requirements, output is generated based on performing a plurality of searches to the inverted index structure based on the in-range indexed value set. When the set of characteristics compare unfavorably to the set of index-usage requirements, the output is generated without performing any searches to the inverted index structure.

Applying range-based filtering during query execution based on utilizing an inverted index structure

A database system is operable to write to a file buffer corresponding to geospatial index data for a plurality of rows based on processing each given row of the plurality of rows. A new leaf node of a set of leaf nodes in a temporary leaf node buffer when the given row includes a geospatial object. When the temporary leaf node buffer is determined to have a number of leaf nodes meeting a predetermined threshold number of leaf nodes, a new tree-based index structure of a set of tree-based index structures of the geospatial index data is built via processing the temporary leaf node buffer. The geospatial index data is stored based on writing the file buffer to disk memory resources. A query is executed against a relational database table based on accessing the geospatial index data in the disk memory resources.

Growing community of inventors

Cincinnati, OH, United States of America

Richard George Wendel, Iii