Building a hash table
US9779123B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 7, 2016 |
| Grant date | Oct 3, 2017 |
| Priority date | — |
| Expiry date | Mar 6, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2456
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques for performing database operations using vectorized instructions are provided. In one technique, a hash table build phase involves executing vectorized instructions to determine whether a bucket in a hash table includes a free slot for inserting a key. A number of data elements from the bucket are loaded in a register. A vectorized instruction is executed against the register may be used to determine a position, within the register, that contains the “smallest” data element. If the data element at that position is zero (or negative), then it is determined that the corresponding position in the bucket is an available slot for inserting a key and corresponding data value.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.