Oracle International Corporation

James Kearney

Weiwei Gong

Shasank Kisan Chavan

Kangnyeon Kim

Harshada Chavan

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.

Hardware optimized string table for accelerated relational database queries

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.

GPU-optimized append operation with latch-free write combining on shared memory

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.

Hardware friendly key value table design to support relational hash join

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.

Growing community of inventors

Cambridge, MA, United States of America

James Kearney