公开(公告)号：US20230195730A1

公开(公告)日：2023-06-22

申请号：US18109024

申请日：2023-02-13

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  William Martinez Cortes ,  Weiwei Gong

IPC: G06F16/2455 ,  G06F16/28 ,  G06F16/22

CPC classification number: G06F16/24552 ,  G06F16/284 ,  G06F16/2246 ,  G06F16/2255

Abstract: Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

公开(公告)号：US11921722B2

公开(公告)日：2024-03-05

申请号：US18109024

申请日：2023-02-13

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  William Martinez Cortes ,  Weiwei Gong

IPC: G06F16/00 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/28

CPC classification number: G06F16/24552 ,  G06F16/2246 ,  G06F16/2255 ,  G06F16/284

Abstract: Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

公开(公告)号：US20220083553A1

公开(公告)日：2022-03-17

申请号：US17537591

申请日：2021-11-30

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  William Martinez Cortes ,  Weiwei Gong

IPC: G06F16/2455 ,  G06F16/28 ,  G06F16/22

Abstract: Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

公开(公告)号：US11222018B2

公开(公告)日：2022-01-11

申请号：US16923352

申请日：2020-07-08

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  William Martinez Cortes ,  Weiwei Gong

IPC: G06F16/00 ,  G06F16/2455 ,  G06F16/28 ,  G06F16/22

Abstract: Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

公开(公告)号：US11580108B2

公开(公告)日：2023-02-14

申请号：US17537591

申请日：2021-11-30

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  William Martinez Cortes ,  Weiwei Gong

IPC: G06F16/00 ,  G06F16/2455 ,  G06F16/28 ,  G06F16/22

Abstract: Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.

公开(公告)号：US20210081490A1

公开(公告)日：2021-03-18

申请号：US16848375

申请日：2020-04-14

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： William Martinez Cortes ,  Shasank Kisan Chavan ,  Siva Ravada ,  Ying Hu

IPC: G06F17/16 ,  G06F9/38

Abstract: Techniques described herein perform spherical PIP analysis by detecting whether a test ray (defined by a test point (TP) and a point (EP) that is external to a spherical polygon) crosses edge arcs (“edges”) of the polygon based on relative orientations of vertices of the test ray and edges. A classifier vector (CV) for a test ray is calculated based on the cross-product of the TP and the EP. Using the CV, the orientation of each vertex of the polygon with respect to the test ray is determined. Candidate edges having vertices with opposite orientations with respect to the test ray are identified. Crossing edges are determine by calculating CVs for each candidate edge, and determining orientations of the TP and EP with respect to each candidate edge. A set of crossing edges is determined, where the TP and the EP have opposite orientations with respect to each crossing edge.

公开(公告)号：US20210073233A1

公开(公告)日：2021-03-11

申请号：US16923352

申请日：2020-07-08

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  William Martinez Cortes ,  Weiwei Gong

IPC: G06F16/2455 ,  G06F16/22 ,  G06F16/28

Abstract: Herein are techniques for dynamic aggregation of results of a database request, including concurrent grouping of result items in memory based on quasi-dense keys. Each of many computational threads concurrently performs as follows. A hash code is calculated that represents a particular natural grouping key (NGK) for an aggregate result of a database request. Based on the hash code, the thread detects that a set of distinct NGKs that are already stored in the aggregate result does not contain the particular NGK. A distinct dense grouping key for the particular NGK is statefully generated. The dense grouping key is bound to the particular NGK. Based on said binding, the particular NGK is added to the set of distinct NGKs in the aggregate result.