Prasanna Rajaperumal

US Patent:

20220222255, Jul 14, 2022

Filed:

Mar 30, 2022

Appl. No.:

17/657257

Inventors:

- Bozeman MT, US
Igor Demura - San Mateo CA, US
Varun Ganesh - San Bruno CA, US
Prasanna Rajaperumal - San Mateo CA, US
Libo Wang - Foster City CA, US
Jiaqi Yan - Menlo Park CA, US

International Classification:

G06F 16/2453

Abstract:

Embodiments of the present disclosure may provide a dynamic query execution model. This query execution model may provide acceleration by scaling out parallel parts of a query (also referred to as a fragment) to additional computing resources, for example computing resources leased from a pool of computing resources. Execution of the parts of the query may be coordinated by a parent query coordinator, where the query originated, and a fragment query coordinator.

US Patent:

20220197886, Jun 23, 2022

Filed:

Mar 10, 2022

Appl. No.:

17/654296

Inventors:

- Bozeman MT, US
Thierry Cruanes - San Mateo CA, US
Jeffrey Rosen - San Mateo CA, US
William Waddington - Stateline NV, US
Prasanna Rajaperumal - San Mateo CA, US
Abdul Munir - San Mateo CA, US

International Classification:

G06F 16/22
G06F 16/27
G06F 7/08
G06F 16/28

Abstract:

Disclosed herein are embodiments of systems and methods for selecting partitions for reclustering based on distribution of overlapping partitions. In an example, a database platform makes a determination to at least partially recluster a database table that includes data stored across a plurality of partitions. The database platform responsively selects a subset of the partitions. The selecting of the subset includes identifying a point on a domain of a clustering key that corresponds to a local maximum of overlapping partitions, and also includes selecting the subset from among a group of overlapping partitions. The group includes at least one partition that overlaps the identified point on the domain of the clustering key. Each partition in the selected subset is above a reduction goal of overlapping partitions. The database platform at least partially reclusters the selected subset based on the clustering key.

US Patent:

20210397615, Dec 23, 2021

Filed:

Aug 31, 2021

Appl. No.:

17/462699

Inventors:

- Bozeman MT, US
Abdul Munir - San Mateo CA, US
Jiaqi Yan - San Mateo CA, US
William Waddington - San Mateo CA, US
Prasanna Rajaperumal - San Mateo CA, US
Thierry Cruanes - San Mateo CA, US

International Classification:

G06F 16/2458
G06F 16/2453
G06F 9/50
G06F 16/2455

Abstract:

Resource provisioning systems and methods are described. In an embodiment, a system includes a plurality of shared storage devices collectively storing database data, an execution platform, and a compute service manager. The compute service manager is configured to determine a task to be executed in response to a trigger event and determine a query plan for executing the task, wherein the query plan comprises a plurality of discrete subtasks. The compute service manager is further configured to assign the plurality of discrete subtasks to one or more nodes of a plurality of nodes of the execution platform, determine whether execution of the task is complete, and in response to determining the execution of the task is complete, store a record in the plurality of shared storage devices indicating the task was completed.

US Patent:

20210374135, Dec 2, 2021

Filed:

Jun 1, 2020

Appl. No.:

16/889033

Inventors:

- San Mateo CA, US
Igor Demura - San Mateo CA, US
Varun Ganesh - San Mateo CA, US
Prasanna Rajaperumal - San Mateo CA, US
Libo Wang - Foster City CA, US
Jiaqi Yan - San Mateo CA, US

International Classification:

G06F 16/2453

Abstract:

Embodiments of the present disclosure may provide a dynamic query execution model. This query execution model may provide acceleration by scaling out parallel parts of a query (also referred to as a fragment) to additional computing resources, for example computing resources leased from a pool of computing resources. Execution of the parts of the query may be coordinated by a parent query coordinator, where the query originated, and a fragment query coordinator.

US Patent:

20210374136, Dec 2, 2021

Filed:

May 28, 2021

Appl. No.:

17/333358

Inventors:

- San Mateo CA, US
Igor Demura - San Mateo CA, US
Varun Ganesh - San Mateo CA, US
Prasanna Rajaperumal - San Mateo CA, US
Libo Wang - Foster City CA, US
Jiaqi Yan - San Mateo CA, US

International Classification:

G06F 16/2453
G06F 16/14
G06F 16/11
G06F 16/16
G06F 9/48

Abstract:

Embodiments of the present disclosure may provide a dynamic query execution model with fault tolerance and failure recovery techniques. Embodiments of the present disclosure may utilize checkpoints to map processed output files to their corresponding input files. Therefore, if an error occurs in processing one or more files, the system may only need to reschedule processing of selected file(s).

US Patent:

20210357263, Nov 18, 2021

Filed:

Jun 9, 2021

Appl. No.:

17/342713

Inventors:

- Bozeman MT, US
Igor Demura - San Mateo CA, US
Varun Ganesh - San Mateo CA, US
Prasanna Rajaperumal - San Mateo CA, US
Libo Wang - Foster City CA, US
Jiaqi Yan - San Mateo CA, US

International Classification:

G06F 9/50
H04L 29/08
G06F 9/54

Abstract:

Embodiments of the present disclosure may provide dynamic and fair assignment techniques for allocating resources on a demand basis. Assignment control may be separated into at least two components: a local component and a global component. Each component may have an active dialog with each other; the dialog may include two aspects: 1) a demand for computing resources, and 2) a total allowed number of computing resources. The global component may allocate resources from a pool of resources to different local components, and the local components in turn may assign their allocated resources to local competing requests. The allocation may also be throttled or limited at various levels.

US Patent:

20210248126, Aug 12, 2021

Filed:

Apr 29, 2021

Appl. No.:

17/243795

Inventors:

- San Mateo CA, US
Thierry Cruanes - San Mateo CA, US
Jeffrey Rosen - San Mateo CA, US
William Waddington - San Mateo CA, US
Prasanna Rajaperumal - San Mateo CA, US
Abdul Munir - San Mateo CA, US

International Classification:

G06F 16/22
G06F 16/28
G06F 7/08
G06F 16/27

Abstract:

Disclosed herein are systems and methods for incremental reclustering of database tables based on local maxima of partition overlap. In an embodiment, a database platform makes a determination, based on one or more incremental-reclustering criteria, to incrementally recluster a database table, which has a clustering key and which is stored across a plurality of partitions. In response to making the determination, the database platform selects a subset of the partitions, and at least incrementally reclusters the selected subset. The selecting of the subset includes identifying a local maximum of a quantity of overlapping partitions in the plurality of partitions with respect to a domain of the clustering key of the table, where the overlapping partitions overlap with respect to the clustering key.

US Patent:

20210240695, Aug 5, 2021

Filed:

Apr 23, 2021

Appl. No.:

17/238539

Inventors:

- San Mateo CA, US
Benoit Dageville - San Mateo CA, US
Prasanna Rajaperumal - San Mateo CA, US
Jiaqi Yan - San Mateo CA, US

International Classification:

G06F 16/23
G06F 16/24
G06F 16/27
G06F 16/22

Abstract:

Systems, methods, and devices for incrementally refreshing a materialized view are disclosed. A method includes generating a materialized view based on a source table. The method includes merging the source table and the materialized view to generate a merged table to identify whether an update has been executed on the source table that is not reflected in the materialized view. The method includes, in response to detecting an update made to the source table that is not reflected in the materialized view, applying the update to the materialized view.