US 11,868,348 B2
Hardware friendly key value table design to support relational hash join
Shasank Kisan Chavan, Menlo Park, CA (US); James Kearney, Cambridge, MA (US); and Weiwei Gong, Belmont, CA (US)
Assigned to Oracle International Corporation, Redwood Shores, CA (US)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on Sep. 11, 2020, as Appl. No. 17/018,694.
Claims priority of provisional application 62/899,587, filed on Sep. 12, 2019.
Claims priority of provisional application 62/899,589, filed on Sep. 12, 2019.
Claims priority of provisional application 62/899,603, filed on Sep. 12, 2019.
Prior Publication US 2021/0081417 A1, Mar. 18, 2021
Int. Cl. G06F 16/2453 (2019.01); G06F 16/22 (2019.01)
CPC G06F 16/24537 (2019.01) [G06F 16/2255 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
receiving a request for a relational join of a build plurality of data rows with a probe plurality of data rows;
selecting, based on the request for the relational join, a particular kind of data map from a plurality of kinds of data map that can be used for said relational join of said build plurality of data rows with said probe plurality of data rows, wherein:
the plurality of kinds of data map includes a first kind of data map and a second kind of data map,
the first kind of data map does not store a build key,
the first kind of data map stores values that have a first size,
the second kind of data map stores values that have a second size that is not the first size;
populating, based on the build plurality of data rows, the particular kind of data map; and
sending a response to the request for the relational join that is based on the probe plurality of data rows and the particular kind of data map;
wherein the method is performed by one or more computers.