High-performance hash joins using memory with extensive internal parallelism
US9817612B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 30, 2014 |
| Grant date | Nov 14, 2017 |
| Priority date | — |
| Expiry date | Jan 22, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F13/1615
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In one embodiment, a computer-implemented method includes issuing, to a DRAM with EIP, a first group of two or more load requests to load data from a hash table constructed from hashed join-key values of a dimension table for a hash-join procedure. A second group of two or more load requests is issued. First response data is received, responsive to the first group of load requests. The first response data is processed while awaiting second response data responsive to the second group. Processing the first response data includes identifying matches between the join-key values corresponding to entries in the load requests of the first group and one or more hash buckets in the first response data. The size of the second group of load requests is selected such that a time for processing the first response data is approximately equal to the latency in receiving the second response data.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.