公开(公告)号：US12242481B1

公开(公告)日：2025-03-04

申请号：US18423196

申请日：2024-01-25

Applicant: Oracle International Corporation

Inventor： James Kearney ,  Weiwei Gong

IPC: G06F16/00 ,  G06F9/38 ,  G06F16/2453 ,  G06F16/2455 ,  G06F16/27

Abstract: Data structures and methods are described to enable a hardware optimized dynamic string table for accelerating relational database queries. A method comprises retrieving a lookup key for a query against a dynamic string table, the lookup key associated with a key length and a key hash. The method further comprises configuring a formatted lookup key as in-line or out-of-line based on whether the key length exceeds a maximum inline key size. The method further comprises replicating, into a first plurality of single instruction, multiple data (SIMD) lanes, the formatted lookup key. The method further comprises writing a candidate bucket, selected from the dynamic string table based on the key hash, into a second plurality of SIMD lanes. The method further comprises performing a SIMD compare of the first plurality of SIMD lanes and the second plurality of SIMD lanes, and returning an associated code when the lookup key is matched.

公开(公告)号：US12153539B1

公开(公告)日：2024-11-26

申请号：US18201073

申请日：2023-05-23

Applicant: Oracle International Corporation

Inventor： Kangnyeon Kim ,  Weiwei Gong ,  James Kearney ,  Harshada Chavan

IPC: G06F15/16 ,  G06F15/167

Abstract: An append operation is provided for using a plurality of threads on a plurality of streaming multiprocessors of a graphical processing unit. The append operation writes results into a result buffer. Executing the append operation comprises claiming, by each given thread within the plurality of threads having a result to write, a portion of a selected WCB, writing, by the given thread, the result to the portion of the selected WCB, and in response to a flush condition being met for the selected WCB, copying contents of the selected WCB to a result buffer.

公开(公告)号：US11797539B2

公开(公告)日：2023-10-24

申请号：US17018018

申请日：2020-09-11

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  James Kearney ,  Weiwei Gong

IPC: G06F16/2455 ,  G06F16/22 ,  G06F16/25 ,  G06F9/30 ,  G06F9/38

CPC classification number: G06F16/2456 ,  G06F9/30047 ,  G06F9/3887 ,  G06F16/2255 ,  G06F16/252

Abstract: The present invention relates to hash join acceleration. In an embodiment, a computer receives a request to join build data rows with probe data rows. Each data row is associated with a respective join key value. From multiple buckets of a hash table, a bucket is selected that contains entries of multiple respective join key values in respective locations within the bucket. Whether or not the bucket contains an entry of the join key value of a build data row is detected. While building, multiple locations within the bucket are concurrently inspected to find an empty location in which to store the entry of the join key value of the build data row. The bucket is concurrently probed to detect whether or not the entries in the bucket include an entry of a join key value of a probe data row. For the join request, a response is sent that is based on the concurrent probing of the bucket.

公开(公告)号：US20250138830A1

公开(公告)日：2025-05-01

申请号：US18384734

申请日：2023-10-27

Applicant: Oracle International Corporation

Inventor： Weiwei Gong ,  Harshada Chavan ,  James Kearney ,  Kangnyeon Kim

IPC: G06F9/38

Abstract: An approach is provided for a thorough and clean way of handling graph overflows in graph execution on single instruction, multiple threads (SIMT) hardware with resumable graph support. The solution does not assume that the input and output fit in the buffers allocated in the SIMT hardware. The approach maintains state of the execution for each kernel and uses multiple iterations of graph execution, making progress in each iteration until all data items are processed through the graph on SIMT hardware. This iterative processing of the graph is transparent to the end user. For resumability, the approach treats buffers as circular buffers instead of serial buffers. With the help of counters, the approach keeps track of the start and end indexes of input and output buffers, thus achieving seamless graph resumability when re-execution is required for only a subset of kernels.

公开(公告)号：US11868348B2

公开(公告)日：2024-01-09

申请号：US17018694

申请日：2020-09-11

Applicant: Oracle International Corporation

Inventor： Shasank Kisan Chavan ,  James Kearney ,  Weiwei Gong

IPC: G06F16/2453 ,  G06F16/22

CPC classification number: G06F16/24537 ,  G06F16/2255

Abstract: The present invention relates to join acceleration. In an embodiment, a computer receives a request for a relational join of build data rows with probe data rows. Based on the request for the relational join, a particular kind of data map from many kinds of data map that can implement the relational join is dynamically selected. Based on the build data rows, an instance of the particular kind of data map is populated. A response is sent for the request for the relational join that is based on the probe data rows and the instance of the particular kind of data map.