US 2017/0255676 A1Published application

Adjusting a quantity of hash partitions for a hash join operation

AssigneeInternational Business Machines Corporation

InventorsGopi K. Attaluri, Vijayshankar Raman, David C. Sharpe

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method implemented by at least one processing device, a processing device, and a computer program product are provided for adjusting hash partitions for a hash join operation. An amount of rows within each of an initial number of hash partitions is determined during assignment of respective rows to respective hash partitions. The initial number of hash partitions is adjusted to a final number of hash partitions based on the amount of rows within each of the initial number of hash partitions and an amount of available memory. The adjusting further includes determining the final number of hash partitions based on the amount of rows within each of the initial number of hash partitions and the amount of available memory, and assigning the rows to the final number of hash partitions. The hash join operation is then performed.

Claims7

Dependent claims

A method for adjusting hash partitions for a hash join operation, the method comprising:

determining an amount of rows within each hash partition of an initial number of hash partitions, during assignment of respective rows to respective hash partitions, the initial number of hash partitions being based on static information and a historical amount of available memory;
adjusting the initial number of hash partitions to a final number of hash partitions based on the amount of rows within each of the initial number of hash partitions and an amount of available memory, the adjusting further comprising:
determining the final number of the hash partitions based on the amount of rows within each of the initial number of hash partitions and the amount of available memory, and
assigning the rows to the final number of the hash partitions;
and performing the hash join operation with the final number of hash partitions.

2 more elements

Dependencies are inferred from the claim text.

Facts

Application: 15/481,793Filed 7 Apr 2017
Priority: 3 Mar 2016
Published: 7 Sep 2017
Term ends: Not estimatedThe source records don’t support an estimate.

Classification5 codes

G06F 16/2456
Binary matching operations: join operations
G06F 16/2255
Indexing structures: hash tables
G06F 16/24554
Of query operations: unary operations; Data partitioning operations
G06F 16/27
Of structured data, e.g. relational data: replication, distribution or synchronisation of data between databases or within a distributed database…

Family

Application15/060,086Continuation · filed 3 Mar 2016
Application15/481,793Continuation
US 10,157,193 B2Related patent
US 10,671,637 B2Related patent
US 2017/0255672 A1Published application
US 2017/0255676 A1This patent

From the US filing history. Foreign family members aren’t listed.

Timeline

Citations

Open elsewhere

Building an agent or pulling many patents? Use the API or MCP server instead of scraping pages. Get an API key