Ocient Holdings LLC

Susmita Saha

Ellis Mihalko Saupe

George Kondiles

Sarah Kate Schieferstein

Samuel Peter Bove

Jason Arnold

Greg R Dhuse

Finley Jordan Lau

Alyssa Catherine Wagenmaker

Max Guthmann

Ryan Joseph Kluzinski

Anna Veselova

Andrew Park

Andrew Michael Bass

Natalia Marie Jenuwine

Pieter Charles Jas Svenson

David Charles Boutcher

Pavel Yusim

Kevin Garner

A database system operates by: determining a query for execution against a dataset that indicates a filtering predicate denoting a disjunction between a first range-based predicate and a second range-based predicate; accessing distribution data for the dataset indicating a plurality of kernels for a plurality of points in a multi-dimensional space; identifying a first sub-region within the multi-dimensional space corresponding to the first range-based predicate; identifying a second sub-region within the multi-dimensional space corresponding to the second range-based predicate; computing a disjunction probability approximation value based on an average portion summation value across a plurality of portion summation values generated for the plurality of kernels; and executing the query based on the disjunction probability approximation value.

Query execution in database systems based on disjunction probability

A query processing system operates by: determining a query for execution that indicates a join expression and further indicates a threshold maximum number of output rows for the join expression; determining a query operator execution flow for the join expression that includes performance of two join operations based on the threshold maximum number of output rows for the join expression, wherein a union of output of the two join operations is semantically equivalent to an output of the join expression; and executing the query based on: performing the two join operations in parallel upon sets of input rows; and based on determining a set of output rows outputted by the two join operations has reached the threshold maximum number of output rows, finalizing execution of the query before at least one of the two join operations has finished processing its input rows.

Query processing with limit optimization in a database system

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.

Performing shutdown of a node in a database system

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.

Generating execution tracking rows during query execution via a database system

A database system is operable to determine a query for execution. The database system can execute a left join operation for the query based on receiving a plurality of left input rows, and forwarding all of the plurality of left input rows are forwarded. It is determined whether any right input rows match with each given left input row based on a hash map. When one right input row is identified as matching with the given left input row, a value of right input row is copied and emitted in conjunction with the given left input row. When no right input rows are identified as matching with the given left input row, a null value is emitted in conjunction with the given left input row.

Processing left join operations via a database system based on forwarding input

A database system is operable to execute a query transaction to generate addendum part data updating a segment A target storage node receives a plurality of sets of buffered rows and a plurality of flush requests. The target storage nodes each of a plurality of addendum parts in response to receiving a corresponding one of a plurality of flush requests. The target node assigns a plurality of version numbers to the plurality of addendum parts. A coordinator operator execution module commits only a final addendum part having a most recent version number as the addendum part data for the segment.

Distributed generation of addendum part data for a segment stored via a database system

Growing community of inventors

Chicago, IL, United States of America

Susmita Saha