×

Efficient join on dynamically compressed inner for improved fit into cache hierarchy

  • US 10,303,791 B2
  • Filed: 03/20/2015
  • Issued: 05/28/2019
  • Est. Priority Date: 03/20/2015
  • Status: Active Grant
First Claim
Patent Images

1. A method comprising:

  • joining, using a hash join process, data between at least two column data sets from hash table columns from at least two hash tables, wherein values of one or more join keys of each of the data sets is represented in a compressed form, indicated by an encoding scheme; and

    dynamically compressing the one or more join keys with a compression scheme during an outer scan operation of the hash join process, the compression scheme being dynamically selected based on join key data type, wherein different compression schemes are selected for the hash table columns including;

    numerical typed key columns, decimal typed key columns and character string typed key columns.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×