Details
-
New Feature
-
Status: Stalled (View Workflow)
-
Major
-
Resolution: Unresolved
-
None
-
None
Description
Motivation:
1. Allows to handle non-equi joins.
2. Allows to implement "cartesian join".
Description: Currently CS has only "hash join" algorithm which uses "hash table" for "small side column" and iterates for each element on "large side column" trying to match that value in the given "hash table". We have to add new "nested loop" join which will iterate over "small side column" values for each value in "large side column" asymptotic complexity O(n*m).