You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@calcite.apache.org by "Andrei Sereda (Jira)" <ji...@apache.org> on 2019/08/21 21:55:00 UTC

[jira] [Commented] (CALCITE-2979) Add a batch-based nested loop join algorithm

    [ https://issues.apache.org/jira/browse/CALCITE-2979?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16912716#comment-16912716 ] 

Andrei Sereda commented on CALCITE-2979:
----------------------------------------

This is very useful feature. Thank you, Khawla.

+1 to get released in 1.21.0 

We'll try it out internally. 

> Add a batch-based nested loop join algorithm
> --------------------------------------------
>
>                 Key: CALCITE-2979
>                 URL: https://issues.apache.org/jira/browse/CALCITE-2979
>             Project: Calcite
>          Issue Type: Improvement
>          Components: core
>    Affects Versions: 1.19.0
>            Reporter: Stamatis Zampetakis
>            Assignee: Khawla Mouhoubi
>            Priority: Major
>              Labels: performance, pull-request-available
>          Time Spent: 2h 20m
>  Remaining Estimate: 0h
>
> Currently, Calcite provides a tuple-based nested loop join algorithm implemented through EnumerableCorrelate and EnumerableDefaults.correlateJoin. This means that for each tuple of the outer relation we probe (set variables) in the inner relation.
> The goal of this issue is to add new algorithm (or extend the correlateJoin method) which first gathers blocks (batches) of tuples from the outer relation and then probes the inner relation once per block.
> There are cases (eg., indexes) where the inner relation can be accessed by more than one value which can greatly improve the performance in particular when the outer relation is big.



--
This message was sent by Atlassian Jira
(v8.3.2#803003)