Hash join

The hash join is an example of a join algorithm and is used in the implementation of a relational database management system.wikipedia
11 Related Articles

Join (SQL)

joinjoinsInner join
The hash join is an example of a join algorithm and is used in the implementation of a relational database management system. Hash joins require an equijoin predicate (a predicate comparing records from one table with those from the other table using a conjunction of equality operators '=' on one or more columns).
Actual SQL implementations normally use other approaches, such as hash joins or sort-merge joins, since computing the Cartesian product is slower and would often require a prohibitively large amount of memory to store.

Symmetric hash join

*Symmetric hash join
The symmetric hash join is a special type of hash join designed for data streams.

Block nested loop

This is essentially the same as the block nested loop join algorithm.
In fact, this algorithm is essentially a special-case of the classic hash join algorithm.

Relational database

relational database management systemRDBMSrelational databases
The hash join is an example of a join algorithm and is used in the implementation of a relational database management system.

Database

database management systemdatabasesDBMS
The hash join is an example of a join algorithm and is used in the implementation of a relational database management system.

Tuple

tuplesn-tuple5-tuple
The task of a join algorithm is to find, for each distinct value of the join attribute, the set of tuples in each relation which have that value.

Syntactic predicate

predicatesyntactic
Hash joins require an equijoin predicate (a predicate comparing records from one table with those from the other table using a conjunction of equality operators '=' on one or more columns).

Query optimization

query optimizeroptimizationQuery processing
The set of query plans examined is formed by examining the possible access paths (e.g., primary index access, secondary index access, full file scan) and various relational table join techniques (e.g., merge join, hash join, product join).

LucidDB

According to the product website, its architecture is based on column-store, bitmap indexing, hash join/aggregation, and page-level multiversioning.